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.
Type de document :
Communication dans un congrès
SoCG '01 - Seventeenth annual symposium on Computational geometry, Jun 2001, Medford, United States. ACM, pp.80-89, 2001, 〈http://dl.acm.org/citation.cfm?doid=378583.378630〉. 〈10.1145/378583.378630〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00804691
Contributeur : Anne Verroust-Blondet <>
Soumis le : mercredi 22 mai 2013 - 13:53:03
Dernière modification le : jeudi 26 avril 2018 - 10:28:52
Document(s) archivé(s) le : vendredi 23 août 2013 - 02:50:12

Fichier

scg01-1.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

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. ACM, pp.80-89, 2001, 〈http://dl.acm.org/citation.cfm?doid=378583.378630〉. 〈10.1145/378583.378630〉. 〈hal-00804691〉

Partager

Métriques

Consultations de la notice

291

Téléchargements de fichiers

109