Detection of constrictions on closed polyhedral surfaces
| dc.contributor.author | Hétroy, F. | en_US |
| dc.contributor.author | Attali, D. | en_US |
| dc.contributor.editor | G.-P. Bonneau and S. Hahmann and C. D. Hansen | en_US |
| dc.date.accessioned | 2014-01-30T07:36:32Z | |
| dc.date.available | 2014-01-30T07:36:32Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | We define constrictions on a surface as simple closed geodesic curves, i.e. curves whose length is locally minimal. They can be of great interests in order to cut the surface in smaller parts. In this paper, we present a method to detect constrictions on closed triangulated surfaces. Our algorithm is based on a progressive approach. First, the surface is simplified by repeated edge collapses. The simplification continues until we detect an edge whose collapse would change the topology of the surface. It happens when three edges of the surface form a triangle that does not belong to the surface. The three edges define what we call a seed curve and are used to initialize the search of a constriction. Secondly, the constriction is progressively constructed by incrementally refining the simplified surface until the initial surface is retrieved. At each step of this refinement process, the constriction is updated. Some experimental results are provided. | en_US |
| dc.description.seriesinformation | Eurographics / IEEE VGTC Symposium on Visualization | en_US |
| dc.identifier.isbn | 3-905673-01-0 | en_US |
| dc.identifier.issn | 1727-5296 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VisSym/VisSym03/067-074 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Detection of constrictions on closed polyhedral surfaces | en_US |
Files
Original bundle
1 - 1 of 1