Abstract / Description of output
We investigate whether polyhedral models suffice for accurate silhouette computation. Therefore, we set up a theoretical framework, a mathematical foundation, to compare various algorithms computing silhouettes on spatial and topological accuracy. Within this carefully constructed environment, we can argue on a formal basis why some silhouette-computing algorithms are better than others. In doing so, we distinguish image space algorithms and object space algorithms. We show that only object space algorithms that respect topology are accurate enough for general applications.
Original language | English |
---|---|
Title of host publication | Geometric Modeling and Graphics, 2003. Proceedings. 2003 International Conference on |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 69-74 |
Number of pages | 6 |
ISBN (Print) | 0-7695-1985-7 |
DOIs | |
Publication status | Published - 1 Jul 2003 |
Keywords / Materials (for Non-textual outputs)
- algorithm theory
- approximation theory
- computational geometry
- rendering (computer graphics)
- accurate silhouette
- image rendering
- image space algorithm
- object space algorithm
- polygonal approximation
- polyhedral model
- silhouette computation
- spatial accuracy
- topological accuracy
- Algorithm design and analysis
- Computer applications
- Computer science
- Graphical user interfaces
- Graphics
- Pipelines
- Pixel
- Rendering (computer graphics)
- Solid modeling
- Topology