Single-strips for fast interactive rendering
Pablo Diaz-Gutierrez, Anusheel Bhushan, M. Gopi, Renato Pajarola
In The Visual Computer, 22(6), 2006.
Abstract: 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(s): Single-strip, Weighted perfect matching, Hamiltonian cycle, Vertex cache, Visibility culling
@article{Diaz-Gutierrez:2006:SFF,
author = {Pablo Diaz-Gutierrez and Anusheel Bhushan and M. Gopi and Renato Pajarola},
title = {Single-strips for fast interactive rendering},
journal = {The Visual Computer},
volume = {22},
number = {6},
pages = {372--386},
year = {2006},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."