Skip to Main content Skip to Navigation
Conference papers

An Upper Bound on the Average Size of Silhouettes

Marc Glisse 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 that approximate surfaces in some reasonable way; the surfaces may not be convex or differentiable and they may have boundaries. We prove that such polyhedra have silhouettes of expected size $O(\sqrt{n})$ where the average is taken over all points of view and $n$ is the complexity of the polyhedron.
Document type :
Conference papers
Complete list of metadata
Contributor : Marc Glisse <>
Submitted on : Friday, September 15, 2006 - 2:23:55 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Links full text




Marc Glisse. An Upper Bound on the Average Size of Silhouettes. 22nd ACM Symposium on Computational Geometry 2006, Jun 2006, Sedona, Arizona, United States. pp.105-111, ⟨10.1145/1137856.1137874⟩. ⟨inria-00095282⟩



Record views