Skip to Main content Skip to Navigation
New interface
Conference papers

Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface

Abstract : A closed orientable surface of genus g can be obtained by appropriate identi cation of pairs of edges of a 4g-gon (the polygonal schema). The identi ed edges form 2g loops on the surface, that are disjoint except for their common end-point. These loops are generators of both the fundamental group and the homology group of the surface. The inverse problem is concerned with nding a set of 2g loops on a triangulated surface, such that cutting the surface along these loops yields a (canonical) polygonal schema. We present two optimal algorithms for this inverse problem. Both algorithms have been implemented using the CGAL polyhedron data structure.
Document type :
Conference papers
Complete list of metadata
Contributor : Anne Verroust-Blondet Connect in order to contact the contributor
Submitted on : Wednesday, May 22, 2013 - 1:53:03 PM
Last modification on : Thursday, March 17, 2022 - 10:08:24 AM
Long-term archiving on: : Friday, August 23, 2013 - 2:50:12 AM


Publisher files allowed on an open archive




Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust. Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface. SoCG '01 - Seventeenth annual symposium on Computational geometry, Jun 2001, Medford, United States. pp.80-89, ⟨10.1145/378583.378630⟩. ⟨hal-00804691⟩



Record views


Files downloads