An Upper Bound on the Average Size of Silhouettes

Marc Glisse 1 Sylvain Lazard 1
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download


https://hal.inria.fr/inria-00336571
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, November 4, 2008 - 3:00:10 PM
Last modification on : Friday, September 20, 2019 - 4:56:41 PM

Files

silhouette_FINAL.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

408

Files downloads

233