Computer Science – Computational Geometry
Scientific paper
2007-02-14
Computer Science
Computational Geometry
Scientific paper
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 be non-convex and non-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.
Glisse Marc
Lazard Sylvain
No associations
LandOfFree
An Upper Bound on the Average Size of Silhouettes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Upper Bound on the Average Size of Silhouettes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Upper Bound on the Average Size of Silhouettes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-209710