On incremental rendering of silhouette maps of a polyhedral scene

  • Authors:
  • Alon Efrat;Leonidas J. Guibas;Olaf A. Hall-Holt;Li Zhang

  • Affiliations:
  • The University of Arizona, Department of Computer Science, Gould-Simpson Building, PO Box 210077, Tucson, AZ 85721-0077, USA;Computer Science Department, Stanford University, 353 Serra Mall, Stanford, CA 94305, USA;Department of Mathematics, Statistics, and Computer Science St. Olaf College, USA;Hewlett Packard Labs, Mail Stop 1250, 1501 Page Mill Road, Palo Alto, CA 94304, USA

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00



We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can be as large as many millions. It is sometimes advantageous to render only the silhouettes of the objects, rather than the objects themselves. Such an approach is regularly used for example in the domain of non-photorealistic rendering, where the rendering of silhouette edges plays a key role. The difficult part in efficiently implementing a kinetic approach to this problem is to realize when the rendered silhouette undergoes a combinatorial change. In this paper, we obtain bounds on several problems involving the number of these events for a collection of k objects, with a total of n edges. We assume that our objects are convex polytopes, and that the viewpoint is moving along a straight line, or along an algebraic curve of bounded low degree. We also study the special case when the scene is a polyhedral terrain, and present improved bounds for this case. In addition to bounding the number events, we also obtain algorithms that compute all the changes occurring during a linear motion both for general scenes and for terrains.