.png){kind=icon}
Return
Single-strips for fast interactive rendering
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-006-0018-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Representing a triangulated two manifold using a single triangle strip is an NP-complete problem. By introducing a few Steiner vertices, recent works find such a single-strip, and hence a linear ordering of edge-connected triangles of the entire triangulation. In this paper, we extend previous results [10] that exploit this linear ordering in efficient triangle-strip management for high-performance rendering. We present new algorithms to generate single-strip representations that follow different user defined constraints or preferences in the form of edge weights. These functional constraints are application dependent. For example, normal-based constraints can be used for efficient rendering after visibility culling, or spatial constraints for highly coherent vertex-caching. We highlight the flexibility of this approach by generating single-strips with preferences as arbitrary as the orientation of the edges. We also present a hierarchical single-strip management strategy for high-performance interactive 3D rendering.
Keywords:
single-strip
weighted perfect matching
Hamiltonian cycle
vertex cache
visibility culling
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more