An Iterative Stripification Algorithm Based on Dual Graph Operations
| dc.contributor.author | Porcu, Massimiliano B. | en_US |
| dc.contributor.author | Scateni, Riccardo | en_US |
| dc.date.accessioned | 2015-11-12T07:55:31Z | |
| dc.date.available | 2015-11-12T07:55:31Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.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. | en_US |
| dc.description.seriesinformation | Eurographics 2003 - Short Presentations | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.20031052 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | An Iterative Stripification Algorithm Based on Dual Graph Operations | en_US |
Files
Original bundle
1 - 1 of 1