On incremental rendering of silhouette maps of a polyhedral scene

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

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. © 2007 Published by Elsevier B.V.

Cite

CITATION STYLE

APA

Efrat, A., Guibas, L. J., Hall-Holt, O. A., & Zhang, L. (2007). On incremental rendering of silhouette maps of a polyhedral scene. Computational Geometry: Theory and Applications, 38(3), 129–138. https://doi.org/10.1016/j.comgeo.2006.12.003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free