返回
Single-strips for fast interactive rendering
DOI:10.1007/s00371-006-0018-2.png)
摘要
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.
Keyword:
single-strip
weighted perfect matching
Hamiltonian cycle
vertex cache
visibility culling
期刊
IF:
2.9
论文数:
4.6K
被引数:
6.5K
机构
暂无机构信息
引用论文
Advances and challenges in oral health after a decade of the “Smiling Brazil” Program“Smiling Brazil”计划十年后的口腔健康进展与挑战

