@inproceedings{d08ac29b7a84464aa51dafe53ad8f182,
title = "Computational complexity of combinatorial surfaces",
abstract = "We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in O(n log n) time, where n is the total number of vertices, edges and faces. We also give an O(n log n + gn) algorithm for constructing canonical generators of the fundamental group of a surface of genus g. This is useful in constructing homeomorphisms between combinatorial surfaces.",
author = "Gert Vegter and Yap, {Chee K.}",
year = "1990",
doi = "10.1145/98524.98546",
language = "English (US)",
isbn = "0897913620",
series = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",
pages = "102--111",
booktitle = "Proc Sixth Annu Symp Comput Geom",
note = "Proceedings of the Sixth Annual Symposium on Computational Geometry ; Conference date: 06-06-1990 Through 08-06-1990",
}