Computing a canonical polygonal schema of an orientable triangulated surface
- 1 June 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
International audienceA 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 structureKeywords
This publication has 7 references indexed in Scilit:
- Using generic programming for designing a data structure for polyhedral surfacesComputational Geometry, 1999
- Transforming Curves on SurfacesJournal of Computer and System Sciences, 1999
- Computational topologyContemporary Mathematics, 1999
- A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detectionDiscrete & Computational Geometry, 1995
- Classical Topology and Combinatorial Group TheoryPublished by Springer Nature ,1993
- Computational complexity of combinatorial surfacesPublished by Association for Computing Machinery (ACM) ,1990
- Systems of Circuits on Two-Dimensional ManifoldsAnnals of Mathematics, 1921