Abstract
We derive several algorithms for curves and surfaces represented using normal coordinates. The normal coordinate representation is a very succinct representation of curves and surfaces. For embedded curves, for example, its size is logarithmically smaller than a representation by edge intersections in a triangulation. Consequently, fast algorithms for normal representations can be exponentially faster than algorithms working on the edge intersection representation. Normal representations have been essential in establishing bounds on the complexity of recognizing the unknot [Hak61, HLP99, AHT02], and string graphs [SSŠ02]. In this paper we present efficient algorithms for counting the number of connected components of curves and surfaces, deciding whether two curves are isotopic, and computing the algebraic intersection numbers of two curves. Our main tool are equations over monoids, also known as word equations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Agol, J. Hass, and W. Thurston. 3-manifold knot genus is NP-complete. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC-2002), 2002.
BE+99._M. Bern, D. Eppstein, et al. Emerging challenges in computational topology. ACM Computing Research Repository, September 1999.
T. Dey, H. Edelsbrunner, and S. Guha. Computational topology. In B. Chazelle, J.E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics. American Mathematical Society, 1999.
T. Dey and S. Guha. Transforming curves on surfaces. JCSS: Journal of Computer and System Sciences, 58(2):297–325, 1999.
V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In IC ALP 2001, pages 543–554, 2001.
A. Fomenko and S. Matveev. Algorithmic and computer methods for three-manifolds. Kluwer, 1997.
L. Gçsieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. in Proceedings of SWAT’96, LNCS 1097, pages 392–403, 1996.
W. Haken. Theorie der Normalflächen. Acta Mathematica, 105:245–375, 1961.
J. Hass, J. Lagarias, and N. Pippenger. The computational complexity of knot and link problems. Journal of ACM, 46(2):185–211, 1999.
H. Kneser. Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten. Jahresbericht der Deutschen Mathematikver-Vereinigung, pages 248–260, 1930.
W. Plandowski and W. Rytter. Application of Lempel-Ziv encodings to the solution of words equations. In Automata, Languages and Programming, pages 731–742, 1998.
W. Rytter. Algorithms on compressed strings and arrays. In Proceedings of 26th Annual Conference on Current Trends in Theory and Practice of Infomatics., 1999.
M. Schaefer, E. Sedgwick, and D. Štefankovič. Recognizing string graphs in np. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC-2002), 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schaefer, M., Sedgwick, E., Štefankovič, D. (2002). Algorithms for Normal Curves and Surfaces. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_40
Download citation
DOI: https://doi.org/10.1007/3-540-45655-4_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43996-7
Online ISBN: 978-3-540-45655-1
eBook Packages: Springer Book Archive