Computer Science – Computational Geometry
Scientific paper
2004-05-10
Computer Science
Computational Geometry
12 pages, 10 figures. To appear at Eurographics 2004
Scientific paper
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.
Eppstein David
Gopi M.
No associations
LandOfFree
Single-Strip Triangulation of Manifolds with Arbitrary Topology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Single-Strip Triangulation of Manifolds with Arbitrary Topology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single-Strip Triangulation of Manifolds with Arbitrary Topology will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-20768