Efficient algorithms to detect null-homologous cycles on 2-manifolds

International Journal of Computational Geometry and Applications

Volumn 7, Issue 3, 1997, Pages 167-174

  Dey, Tamal K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Computational topology; Cycle; Homology; Manifold; Triangulation

Indexed keywords

EID: 0031505859     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195997000119     Document Type: Article

References (12)

1. T. K. Dey and H. Schipper, "A new technique to compute the polygonal schema for 2-manifolds and null-homotopy detection," Discrete Comput. Geom., 14 (1995), 93-110.
2. T. K. Dey and S. Guha, "Optimal algorithms for curves on surfaces," Proc. 35th IEEE Sympos. Foundations Comput. Sc., Milwaukee, USA, 1995, pp. 266-273.
3. C. Delfinado and H. Edelsbrunner, "An incremental algorithm for betti numbers of simplicial complexes," 9th. Ann. Sympos. Comput. Geom., 1993, 232-239.
4. P. J. Giblin, Graphs, Surfaces and Homology, Halsted Press, New York, 1977.
5. J. Hersberger and J. Snoeyink, "Around and around: computing the shortest loop," Proc. 3rd Canad. Conf. on Comput. Geom. 1991, 157-161.
6. K. Melhorn and C. K. Yap, "Constructive Whitney-Graustein theorem: or how to untangle closed planar curves," SIAM J. Comput. 20 (1991), 603-621.
7. W. S. Massey, Algebraic Topology: An Introduction, Springer-Verlag, New York, 1967.
8. J. R. Munkres, Elements of Algebraic Topology, Addison-Wesley Publishing, 1984.
9. H. Schipper, "Determining contractibility of curves," Proc. 8th ACM Sympos. on Comput. Geom. 1992, 358-367.
10. J. S. Snoeyink, "Topological approaches in computational geometry," Tech. Report STAN-CS-90-1331, Stanford University, 1990.
11. G. Vegter, "Kink-free deformations of polygons," Proc. 5th ACM Sympos. on Comput. Geom. 1989, 61-68.
12. G. Vegter and C. K. Yap, "Computational complexity of combinatorial surfaces," Proc. 6th ACM Sympos. on Comput. Geom. 1990, 102-111.