Access Restriction

Author Hétroy, Franck ♦ Attali, Dominique
Source Hyper Articles en Ligne (HAL)
Content type Text
Publisher The Eurographics Association
File Format PDF
Language English
Subject Keyword info ♦ Computer Science [cs]/Computational Geometry [cs.CG] ♦ Computer Science [cs]/Graphics [cs.GR]
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.
Educational Use Research
Learning Resource Type Proceeding
Publisher Date 2003-05-01
Organization conferenceOrganizer G.-P. Bonneau, S. Hahmann, C. Hansen
Page Count 8
Starting Page 67
Ending Page 74