Determining contractibility of curves

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Determining contractibility of curves

Full text

Pdf (775 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the eighth annual symposium on Computational geometry table of contents

Berlin, Germany

Pages: 358 - 367

Year of Publication: 1992

ISBN:0-89791-517-8

Author

Haijo Schipper

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 18, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/142675.142749 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	De 12a	Dehn, M.' "Uber unendliche diskontinuierliche Gruppen." Math. Ann. Vol. 71, 1912, pp. 116- 114.
	De 12b	Dehn, M. : "Transformation der Kurven auf zweiseitige Fl~chen." Math. Ann. Vol. 72, 1912, pp. 413- 421.
	He 79	Henle, M. : A combinatomal introduction to topology. San Francisco: W. H. Freeman and Company, 1979.
	HeSn 91a	Hersberger, J. and Snoeyink, J.: "Around and around :computing the shortest loop." Proceedings of the third Canadian Conference on Computational Geometry. 1991, pp. 157- 161.
	HeSn 91b	Hersberger, J. and Snoeyink, J. : "Computing minimum length paths of a given homotopy class." In: Dehne, F., Sack, J.-R. and Santoro, N. (Eds.) "Proceedings of the second Workshop on Algorithms and Data Structures ( WADS '91). Ottawa, August 1991." Goos G. and Hartmanis J. (Eds.) Lecture Notes zn Computer Science, Vol. 519. Berlin, Heidelberg: Springer-Verlag, 1991, pp. 331- 342.
	MeYa88	Kurt Mehlhorn , Chee-Keng Yap, Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, p.410-423, July 11-15, 1988
	Sn 90	Snoeyink, J. S.: "Topological Approaches in Computational Geometry." Stanford University: Report No. $TAN-CS-90-1331., 1990.
	St 80	Stillwell, J.: "Classical Topology and Combinatorial Group Theory." In: Halmos, P. R., Gehring, F.W. and Moore, C. C. (Eds.) : Graduate Texts in Mathematics, Vol. 72. New York, Heidelberg, Berlin: Springer-Verlag, 1980.
	Ve 89	G. Vegter, Kink-free deformations of polygons, Proceedings of the fifth annual symposium on Computational geometry, p.61-68, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73840]
	VeYa90	Gert Vegter , Chee K. Yap, Computational complexity of combinatorial surfaces, Proceedings of the sixth annual symposium on Computational geometry, p.102-111, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98546]

CITED BY 3

	Tamal K. Dey, A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection, Proceedings of the tenth annual symposium on Computational geometry, p.277-284, June 06-08, 1994, Stony Brook, New York, United States
	Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
	Éric Colin de Verdière , Jeff Erickson, Tightening non-simple paths and cycles on surfaces, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.192-201, January 22-26, 2006, Miami, Florida