An Upper Bound on the Average Size of Silhouettes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 2008

An Upper Bound on the Average Size of Silhouettes

Abstract

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for a large class of objects, namely for polyhedra or, more generally, tessellated surfaces that approximate surfaces in some reasonable way. The approximated surfaces are two-manifolds that may be non-convex and non-differentiable and may have boundaries. The tessellated surfaces should, roughly speaking, have no short edges, have fat faces, and the distance between the mesh and the surface it approximates should never be too large. We prove that such tessellated surfaces of complexity \(n\) have silhouettes of expected size \(O(\sqrt{n})\) where the average is taken over all points of view. The viewpoints can be chosen at random at infinity or at random in a bounded region.
Fichier principal
Vignette du fichier
silhouette_FINAL.pdf (312.93 Ko) Télécharger le fichier
Vignette du fichier
2008 Average Size of Silhouettes.png (90.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

inria-00336571 , version 1 (04-11-2008)

Identifiers

Cite

Marc Glisse, Sylvain Lazard. An Upper Bound on the Average Size of Silhouettes. Discrete and Computational Geometry, 2008, 40 (2), pp.241-257. ⟨10.1007/s00454-008-9089-3⟩. ⟨inria-00336571⟩
143 View
99 Download

Altmetric

Share

Gmail Facebook X LinkedIn More