An upper bound on the average size of silhouettes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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(√n) where the average is taken over all points of view and n is the complexity of the polyhedron.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
PublisherAssociation for Computing Machinery (ACM)
Pages105-111
Number of pages7
ISBN (Print)1595933409, 9781595933409
DOIs
Publication statusPublished - 1 Jan 2006
Externally publishedYes
Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
Duration: 5 Jun 20067 Jun 2006

Publication series

NameProceedings of the Annual Symposium on Computational Geometry
Volume2006

Conference

Conference22nd Annual Symposium on Computational Geometry 2006, SCG'06
Country/TerritoryUnited States
CitySedona, AZ
Period5/06/067/06/06

Keywords

  • Polyhedron
  • Silhouette
  • Upper bound

Fingerprint

Dive into the research topics of 'An upper bound on the average size of silhouettes'. Together they form a unique fingerprint.

Cite this