Single-strip triangulation of manifolds with arbitrary topology

Authors:
David Eppstein;M. Gopi
Affiliations:
University of California - Irvine, Irvine, CA;University of California - Irvine, Irvine, CA
Venue:
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Year:
2004

Citing 6
Cited 4

Optimizing triangle strips for fast rendering

Proceedings of the 7th conference on Visualization '96
Creating full view panoramic image mosaics and environment maps

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Optimized geometry compression for real-time rendering

VIS '97 Proceedings of the 8th conference on Visualization '97
Fast and effective stripification of polygonal surface models

I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Near-optimal fully-dynamic graph connectivity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient algorithms for Petersen's matching theorem

Journal of Algorithms

Technical Section: Comparison of triangle strips algorithms

Computers and Graphics
Technical Section: Optimizing the management of continuous level of detail models on GPU

Computers and Graphics
Not being (super)thin or solid is hard: A study of grid Hamiltonicity

Computational Geometry: Theory and Applications
Rendering continuous level-of-detail meshes by Masking Strips

Graphical Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

This video illustrates a new method for subdividing the surface of a triangulated 3d polyhedron, without changing the geometry of the model, so that the triangles of the subdivided mesh can be ordered into a single triangle strip. Our method guarantees that the subdivided mesh has at most 3/2 the original number of triangles, and in practice performs much better. Our strips can be used not only for efficient rendering, but also for other applications including the generation of space filling curves.