The Visual Computer

, Volume 22, Issue 6, pp 372–386

Single-strips for fast interactive rendering

  • Pablo Diaz-Gutierrez
  • Anusheel Bhushan
  • M. Gopi
  • Renato Pajarola
Special Issue Paper

DOI: 10.1007/s00371-006-0018-2

Cite this article as:
Diaz-Gutierrez, P., Bhushan, A., Gopi, M. et al. Visual Comput (2006) 22: 372. doi:10.1007/s00371-006-0018-2

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.

Keywords

Single-strip Weighted perfect matching Hamiltonian cycle Vertex cache Visibility culling 

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  • Pablo Diaz-Gutierrez
    • 1
  • Anusheel Bhushan
    • 1
  • M. Gopi
    • 2
  • Renato Pajarola
    • 3
  1. 1.444, Computer Science BuildingUniversity of California, IrvineIrvineUSA
  2. 2.430, Computer Science BuildingUniversity of California, IrvineIrvineUSA
  3. 3.Department of InformaticsUniversity of ZurichZürichSwitzerland

Personalised recommendations