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 metadatas

https://hal.inria.fr/hal-00804691
Contributor : Anne Verroust-Blondet <>
Submitted on : Wednesday, May 22, 2013 - 1:53:03 PM
Last modification on : Tuesday, April 30, 2019 - 5:14:02 PM
Long-term archiving on : Friday, August 23, 2013 - 2:50:12 AM

File

scg01-1.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

351

Files downloads

202