### 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 very large - hundreds of thousands or millions, but these may come from only a moderate number of objects that happen to have been finely tessellated. It is sometimes advantageous to render only the silhouettes of the objects, rather than the objects themselves, and then exploit coherence or other methods to optimize the rendering of single-object regions with uniform reflectance properties. Such an approach is also regularly used in the domain of non-photorealistic rendering, where the rendering of silhouette edges plays a key role. The hard 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 a number of combinatorial problems involving the complexity 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. The resulting bounds will then depend on both the number of objects, and the total number of edges, in such a way that we can describe the advantages of focusing on the silhouettes of combinatorially large objects. We also study the special case when the scene is a polyhedral terrain, and present improved bounds for this case. In addition to event bounds, we also obtain algorithms that compute all the changes occurring during a linear motion, (both for general scenes and for terrains).

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |

Publisher | SIAM |

Pages | 910-917 |

Number of pages | 8 |

State | Published - 2000 |

Externally published | Yes |

Event | 11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 9 2000 → Jan 11 2000 |

### Other

Other | 11th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

City | San Francisco, CA, USA |

Period | 1/9/00 → 1/11/00 |

### Fingerprint

### ASJC Scopus subject areas

- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics

### Cite this

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 910-917). SIAM.

**On incremental rendering of silhouette maps of a polyhedral scene.** / Efrat, Alon; Guibas, Leonidas J.; Hall-Holt, Olaf A.; Zhang, Li.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.*SIAM, pp. 910-917, 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/9/00.

}

TY - GEN

T1 - On incremental rendering of silhouette maps of a polyhedral scene

AU - Efrat, Alon

AU - Guibas, Leonidas J.

AU - Hall-Holt, Olaf A.

AU - Zhang, Li

PY - 2000

Y1 - 2000

N2 - 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 very large - hundreds of thousands or millions, but these may come from only a moderate number of objects that happen to have been finely tessellated. It is sometimes advantageous to render only the silhouettes of the objects, rather than the objects themselves, and then exploit coherence or other methods to optimize the rendering of single-object regions with uniform reflectance properties. Such an approach is also regularly used in the domain of non-photorealistic rendering, where the rendering of silhouette edges plays a key role. The hard 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 a number of combinatorial problems involving the complexity 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. The resulting bounds will then depend on both the number of objects, and the total number of edges, in such a way that we can describe the advantages of focusing on the silhouettes of combinatorially large objects. We also study the special case when the scene is a polyhedral terrain, and present improved bounds for this case. In addition to event bounds, we also obtain algorithms that compute all the changes occurring during a linear motion, (both for general scenes and for terrains).

AB - 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 very large - hundreds of thousands or millions, but these may come from only a moderate number of objects that happen to have been finely tessellated. It is sometimes advantageous to render only the silhouettes of the objects, rather than the objects themselves, and then exploit coherence or other methods to optimize the rendering of single-object regions with uniform reflectance properties. Such an approach is also regularly used in the domain of non-photorealistic rendering, where the rendering of silhouette edges plays a key role. The hard 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 a number of combinatorial problems involving the complexity 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. The resulting bounds will then depend on both the number of objects, and the total number of edges, in such a way that we can describe the advantages of focusing on the silhouettes of combinatorially large objects. We also study the special case when the scene is a polyhedral terrain, and present improved bounds for this case. In addition to event bounds, we also obtain algorithms that compute all the changes occurring during a linear motion, (both for general scenes and for terrains).

UR - http://www.scopus.com/inward/record.url?scp=0033902902&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033902902&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033902902

SP - 910

EP - 917

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

PB - SIAM

ER -