Computational complexity of combinatorial surfaces

Gert Vegter, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProc Sixth Annu Symp Comput Geom
PublisherPubl by ACM
Pages102-111
Number of pages10
ISBN (Print)0897913620
StatePublished - 1990
EventProceedings of the Sixth Annual Symposium on Computational Geometry - Berkeley, CA, USA
Duration: Jun 6 1990Jun 8 1990

Other

OtherProceedings of the Sixth Annual Symposium on Computational Geometry
CityBerkeley, CA, USA
Period6/6/906/8/90

Fingerprint

Computational complexity

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Vegter, G., & Yap, C. (1990). Computational complexity of combinatorial surfaces. In Proc Sixth Annu Symp Comput Geom (pp. 102-111). Publ by ACM.

Computational complexity of combinatorial surfaces. / Vegter, Gert; Yap, Chee.

Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. p. 102-111.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Vegter, G & Yap, C 1990, Computational complexity of combinatorial surfaces. in Proc Sixth Annu Symp Comput Geom. Publ by ACM, pp. 102-111, Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, 6/6/90.
Vegter G, Yap C. Computational complexity of combinatorial surfaces. In Proc Sixth Annu Symp Comput Geom. Publ by ACM. 1990. p. 102-111
Vegter, Gert ; Yap, Chee. / Computational complexity of combinatorial surfaces. Proc Sixth Annu Symp Comput Geom. Publ by ACM, 1990. pp. 102-111
@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 Chee Yap",
year = "1990",
language = "English (US)",
isbn = "0897913620",
pages = "102--111",
booktitle = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Computational complexity of combinatorial surfaces

AU - Vegter, Gert

AU - Yap, Chee

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025054885&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025054885&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025054885

SN - 0897913620

SP - 102

EP - 111

BT - Proc Sixth Annu Symp Comput Geom

PB - Publ by ACM

ER -