Tracing compressed curves in triangulated surfaces

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2012, Pages 131-140

  Erickson, Jeff ^a   Nayyeri, Amir ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Computational topology; Geodesics; Normal coordinates

Indexed keywords

COMPUTATIONAL TOPOLOGY; FINITE SET; GEODESICS; LOCAL COORDINATE SYSTEM; NORMAL COORDINATE; POLYNOMIAL-TIME; SURFACE TRIANGULATION; TRACING ALGORITHM; TRIANGULATED SURFACES;

ALGORITHMS; POLYNOMIAL APPROXIMATION; TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 84863956926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2261250.2261270     Document Type: Conference Paper

References (49)

1. Ian Agol, Joel Hass, and William P. Thurston. The computational complexity of knot genus and spanning area. Trans. Amer. Math. Soc. 358(9):3821-3850, 2006. ArXiv:math/0205057.
2. David Avis, Teren Gum, and Godfried T. Toussaint. Visiblity between two edges of a simple polygon. Vis. Comput. 2:342-357, 1986.
3. Jon Louis Bentley and Andrew Chi-Chih Yao. An almost optimal algorithm for unbounded searching. Inform. Proc. Lett. 5:82-87, 1976.
4. Joan S. Birman and Caroline Series. Geodesics with bounded intersection number on surfaces are sparsely distributed. Topology 24(2):217-225, 1985.
5. Joan S. Birman and Caroline Series. Algebraic linearity for an automorphism of a surface group. J. Pure Appl. Algebra 52:227-275, 1988.
6. Benjamin A. Burton. The complexity of the normal surface solution space. Proc. 26th Ann. Symp. Comput. Geom., 201-209, 2010.
7. Benjamin A. Burton and Melih Ozlen. Computing the cross-cap number of a knot using integer programming and normal surfaces. ACM Trans. Math. Software (to appear), 2012. ArXiv:1107.2382.
8. Bernard Chazelle. A theorem on polygon cutting with applications. Proc. 23rd Ann. IEEE Symp. Found. Comput. Sci., 339-349, 1982.
9. Max Dehn. Die Gruppe der Abbildungsklassen (Das arithmetische Feld auf Flächen). Acta Mathematica 69:135-206, 1938.
10. Erik D. Demaine and Joseph O'Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge Univ. Press, 2007.
11. Herbert Edelsbrunner and John Harer. Computational Topology: An Introduction. American Mathematical Society, 2010.
12. Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1):37-59, 2004.
13. Albert Fathi, François Laudenbach, and Valentin Poénaru. Travaux de Thurston sur les surfaces. Astérisque 66-67. Soc. Math. de France, 1979. Séminaire Orsay. English translation in [14].
14. Albert Fathi, François Laudenbach, and Valentin Poénaru. Thurston's Work on Surfaces. Mathematical Notes. Princeton Univ. Press, 2011. Translated by Djun Kim and Dan Margalit. English translation of [13].
15. Wolfgang Haken. Theorie der Normalflächen: Ein Isotopiekriterium für den Kreisknoten. Acta Mathematica 105:245-375, 1961.
16. Joel Hass, Jeffrey C. Lagarias, and Nicholas Pippenger. The computational complexity of knot and link problems. J. ACM 46(2):185-211, 1999.
17. Frank Herrlich and Gabriela Schmithüsen. An extraordinary origami curve. Math. Nachr. 281(2):219-237, 2008.
18. John Hershberger and Subhash Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. J. Algorithms 18(3):403-431, 1995.
19. Helmuth Kneser. Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten. Jahresbericht Deutschen Math.-Verein. 38:248-260, 1930.
20. Gabriel Lamé. Note sur la limite du monbre des divisions dand la recherche du plus grand commun divisur entre dex nombres entiers. Compt. Rend. Acad. Sci., Paris 19:857-870, 1844.
21. Der-Tsai Lee and Franco P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks 14:393-410, 1984.
22. Yury Lifshits. Processing compressed texts: A tractabiliity border. Proc. 18th Ann. Symp. Combin. Pattern Matching, 228-240, 2007. Lecture Notes Comput. Sci. 4850, Springer-Verlag.
23. Lazar Aronovich Lyusternik. Shortest Paths: Variational Problems. Popular Lectures Math. 13. Pergamon Press, 1964. Translated and adapted from the Russian by P. Collins and Robert B. Brown.
24. Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. J. Discrete Algorithms[Hermes] 1(1):187-204, 2000.
25. Richard Moeckel. Geodesics on modular surfaces and continued fractions. Ergodic Theory Dynam. Sys. 2:69-83, 1982.
26. Bojan Mohar and Carsten Thomassen. Graphs on Surfaces. Johns Hopkins Univ. Press, 2001.
27. Nuclear Monkey Software. Narbacular Drop. Video game, 2005.
28. János Pach and Géza Tóth. Recognizing string graphs is decidable. Discrete Comput. Geom. 28(4):593-606, 2001.
29. Robert C. Penner. The action of the mapping class group on curves in surfaces. L'Enseignment Mathématique 30:39-55, 1984.
30. Robert C. Penner and John L. Harer. Combinatorics of Train Tracks. Annals of Math. Studies 125. Princeton Univ. Press, 1992.
31. Wojciech Plandowski and Wojciech Rytter. Application of Lempel-Ziv encodings to the solution of word equations. Proc. 25th Int. Conf. Automata Lang. Prog., 731-742, 1998. Lecture Notes Comput. Sci. 1443, Springer-Verlag.
32. John M. Robson and Volker Diekert. On quadratic word equations. Proc. 16th Ann. Conf. Theoretical Aspects Comput. Sci., 217-226, 1999. Lecture Notes Comput. Sci. 1563, Springer-Verlag.
33. John M. Robson and Volker Diekert. Quadratic word equations. Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, 314-326, 1999. Springer-Verlag.
34. Wojciech Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci. 302:211-222, 2003.
35. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovic. Algorithms for normal curves and surfaces. Proc. 8th Int. Conf. Comput. Combin., 370-380, 2002. Lecture Notes Comput. Sci. 2387, Springer-Verlag.
36. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovic. Recognizing string graphs in NP. J. Comput. System Sci. 67(2):365-380, 2003.
37. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovic. Spiraling and folding: The topological view. Proc. 19th Ann. Canadian Conf. Comput. Geom., 73-76, 2007.
38. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovic. Computing Dehn twists and geometric intersection numbers in polynomial time. Proc. 20th Canadian Conf. Comput. Geom., 111-114, 2008. Full version: Tech. Rep. 05-009, Comput. Sci. Dept, DePaul Univ., April 2005, (http://facweb.cs.depaul.edu/ research/techreports/abstract05009.htm).
39. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovic. Spiraling and folding: The word view. Algorithmica 60(3):609-626, 2011.
40. Saul Schleimer. Sphere recognition lies in NP. Preprint, July 2004. ArXiv:math/0407047.
41. Caroline Series. The modular surface and continued fractions. J. London Math. Soc. 31:69-80, 1985.
42. Caroline Series. Geometrical Markov coding of geodesics on surfaces of constant negative curvature. Ergodic Theory Dynam. Sys. 6(4):601-625, 1986.
43. Jeffrey Shallit. Origins of the analysis of the Euclidean algorithm. Hist. Math. 21:401-419, 1994.
44. Daniel Štefankovic. Algorithms for simple curves on surfaces, string graphs, and crossing numbers. Ph.D. thesis, Dept. Comput. Sci., Univ. Chicago, June 2005.
45. John Stillwell. Classical Topology and Combinatorial Group Theory, 2nd edition. Graduate Texts in Mathematics 72. Springer-Verlag, 1993.
46. William P. Thurston. On the geometry and dynamics of diffeomorphisms of surfaces. Bull. Amer. Math. Soc. 19(2):417-431, 1988. Circulated as a preprint in 1976.
47. Godfried T. Toussaint. Shortest path solves edge-to-edge visibility in a polygon. Patt. Recog. Letters 4(3):165-170, 1986.
48. Valve Corporation. Portal. Video game, 2007.
49. Andy Wachowski and Larry Wachowski. Matrix Revolutions. Warner Bros., 2003. Motion picture.