Hierarchical generalized triangle strips

Velho, Luiz; Figueiredo, Luiz Henrique de; Gomes, Jonas

doi:10.1007/s003710050160

Cited by 31 publications

(12 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A wide range of papers about multiresolution or level of detail [8,9,10,11,12,13] that benefit from using hardware optimized rendering primitives have recently appeared. However, as they are built from a fixed and static mesh, they usually produce low quality approximations when applied to a mesh with extreme deformations.…”

Section: Multiresolutionmentioning

confidence: 99%

Level-of-Detail Triangle Strips for Deforming Meshes

Ramos

Chover

Parus

et al. 2008

Computational Science – ICCS 2008

View full text Add to dashboard Cite

Abstract. Applications such as video games or movies often contain deforming meshes. The most-commonly used representation of these types of meshes consists in dense polygonal models. Such a large amount of geometry can be efficiently managed by applying level-of-detail techniques and specific solutions have been developed in this field. However, these solutions do not offer a high performance in real-time applications. We thus introduce a multiresolution scheme for deforming meshes. It enables us to obtain different approximations over all the frames of an animation. Moreover, we provide an efficient connectivity coding by means of triangle strips as well as a flexible framework adapted to the GPU pipeline. Our approach enables real-time performance and, at the same time, provides accurate approximations.

show abstract

Section: Multiresolutionmentioning

confidence: 99%

Level-of-Detail Triangle Strips for Deforming Meshes

Ramos

Chover

Parus

et al. 2008

Computational Science – ICCS 2008

View full text Add to dashboard Cite

show abstract

“…Similarly to our approach, [38] construct triangle strips that enhance the use of the vertex cache, regardless of its size. Further, [5,36] also explore the relationship between mesh locality and triangle strips.…”

Section: Related Workmentioning

confidence: 99%

Single-strips for fast interactive rendering

et al. 2006

View full text Add to dashboard Cite

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, normalbased 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.

show abstract

“…The classic STRIPE algorithm [ESV96] makes a global analysis of the input triangle mesh, trying to find patches that can be efficiently striped. Velho et al [VdFG99] build and maintain triangle strips incrementally while creating a triangle mesh simultaneously. Chow [Cho97] builds strips by reusing the points added to previous strips as often as possible.…”

Section: Related Workmentioning

confidence: 99%

Single-strip triangulation of manifolds with arbitrary topology

Eppstein

Gopi

2004

Proceedings of the Twentieth Annual Symposium on Computational Geometry

View full text Add to dashboard Cite

Abstract. Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few long strips. In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model. Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary. New vertices are introduced at midpoints of edges and the new triangles thus formed are coplanar with their parent triangles, hence the visual fidelity of the geometry is not changed. We prove that the increase in the number of triangles due to this splitting is 50% in the worst case, however for all models we tested the increase was less than 2%. We also prove tight bounds on the number of triangles needed for a single-strip representation of a model with holes on its boundary. Our strips can be used not only for efficient rendering, but also for other applications including the generation of space filling curves on a manifold of any arbitrary topology.

show abstract

Hierarchical generalized triangle strips

Cited by 31 publications

References 8 publications

Level-of-Detail Triangle Strips for Deforming Meshes

Level-of-Detail Triangle Strips for Deforming Meshes

Single-strips for fast interactive rendering

Single-strip triangulation of manifolds with arbitrary topology

Contact Info

Product

Resources

About