Iterative stripification of a triangle mesh: focus on data structures

Date issued

2004

Journal Title

Journal ISSN

Volume Title

Publisher

UNION Agency

Abstract

In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decrease the number of strips. Our method is a major improvement of a proposed one originally devised for both static and continuous level-of-detail (CLOD) meshes and retains this feature. The usage of a dynamical identification strategy for the strips allows us to drastically reduce the length of the searching paths in the graph needed for the rearrangement and produce loop-free triangle strips without any further controls and post-processing, while requiring a more sophisticated implementation to manage the search and undo operations.

Description

Subject(s)

počítačová geometrie, objektové modelování, geometrické algoritmy

Citation

WSCG '2004: Posters: The 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, 2.-6. February 2004, Plzen, p. 133-136.
OPEN License Selector