Transforming curves on surfaces

Journal of Computer and System Sciences

Volumn 58, Issue 2, 1999, Pages 297-325

  Dey, Tamal K ^a   Guha, Sumanta ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b University of Wisconsin Milwaukee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; TOPOLOGY;

COMBINATORIAL GROUP THEORY; HOMOTOPY;

COMPUTATIONAL GEOMETRY;

EID: 0032623455     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1619     Document Type: Article

References (22)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT press, Cambridge, MA, 1991.
2. M. Dehn, Über unendliche diskontinuierliche Gruppen, Math. Ann. 71 (1912), 116-144.
3. M. Dehn, Transformation der Kurven auf zweiseitingen Flächen, Math. Ann. 72 (1912), 413-421.
4. M. Dehn, "Papers on Group Theory and Topology" (trans. by J. Stillwell), Springer-Verlag, New York/Berlin, 1987.
5. C. Delfinado and H. Edelsbrunner, An incremental algorithm for betti numbers of simplical complexes, in "9th Ann. Symp. Comp. Geom., 1993," pp. 232-239.
6. T. K. Dey, A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection, in "Proc. 10th ACM Symp. Comp. Geom., 1994," pp. 277-284.
7. T. K. Dey, H. Edelsbrunner, and S. Guha, Computational topology, preprint.
8. T. K. Dey, and H. Schipper, A new technique to compute polygonal schema for 2-manifolds with applications to null-homotopy detection, Disc. & Comp. Geom. 14 (1995), 93-110.
9. H. Edelsbrunner, Modeling with simplical complexes: Topology, geometry, and algorithms, in "Proc. 6th Canad. Conf. Comp. Geom., 1994," pp. 36-44.
10. M. D. Greendlinger, On Dehn's algorithm for the conjugacy and word problems with applications, Comm. Pure Appl. Math. 13 (1960), 641-677.
11. L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (1985), 74-123.
12. D. E. Knuth J. H. Morris, and V. R. Pratt, Fast pattern matching on strings, SIAM J. Comput. 2 (1977), 323-350.
13. R. C. Lyndon and P. E. Schupp, "Combinatorial Group Theory," Springer-Verlag, 1977.
14. W. S. Massey, "Algebraic Topology: An Introduction," Harcourt, Brace & World, New York, 1967.
15. P. S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. Steklov 44 (1955), 143.
16. H. Poincaré, Cinquième complément à l'analysis situs, Rend. Circ. Mat. Palermo 18 (1904), 45-110.
17. H. Schipper, Determining contractibility of curves, in "Proc. 8th ACM Symp. Comp. Geom., 1992," pp. 358-367.
18. I. M. Singer and J. A. Thorpe, "Lecture Notes on Elementary Topology and Geometry," Springer-Verlag, 1967.
19. J. Stillwell, "Classical Topology and Combinatorial Group Theory," Springer-Verlag, 1980.
20. J. J. Rotman, "The Theory of Groups," 2nd ed., Allyn & Bacon, New York, 1973.
21. G. Vegter, Computational topology, preprint.
22. G. Vegter and C. K. Yap, Computational complexity of combinatorial surfaces, in "Proc. 6th ACM Symp. Comp. Geom., 1990," pp. 102-111.