An Iterative Stripification Algorithm Based on Dual Graph Operations

Loading...
Thumbnail Image
Date
2003
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics Association
Abstract
This paper describes the preliminary results obtained using an iterative method 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.
Description

        
@inproceedings{
:10.2312/egs.20031052
, booktitle = {
Eurographics 2003 - Short Presentations
}, editor = {}, title = {{
An Iterative Stripification Algorithm Based on Dual Graph Operations
}}, author = {
Porcu, Massimiliano B.
and
Scateni, Riccardo
}, year = {
2003
}, publisher = {
Eurographics Association
}, ISSN = {
1017-4656
}, ISBN = {}, DOI = {
/10.2312/egs.20031052
} }
Citation