Curve reconstruction, the traveling salesman problem and Menger's theorem on length

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Curve reconstruction, the traveling salesman problem and Menger's theorem on length

Full text

Pdf (896 KB)

Source

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

Miami Beach, Florida, United States

Pages: 207 - 216

Year of Publication: 1999

ISBN:1-58113-068-6

Author

Joachim Giesen

Institut für Theoretische Informatik, ETH Zürich, CH-8092 Zürich, Switzerland

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): 4, Downloads (12 Months): 17, Citation Count: 14

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/304893.304973 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.

	1	A.D. Aleksandrov, Yu.G. Reshetnyak Integral Curvature of a curve in n-dimensional Euclidean space, Sib. Math. J. 29(1), pp. 1-16 (1988)
	2	Nina Amenta , Marshall Bern , David Eppstein, The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, v.60 n.2, p.125-135, March 1, 1998 [doi>10.1006/gmip.1998.0465]
	3	F. Bernardini, C. L. Bajaj Sampling and Reconstructing Manifolds Using Alpha-Shapes, Proc. of the Ninth Canadian Conference on Computational Geometry 1997, pp. 193-198 (1997)
	4	Tamal K. Dey , Piyush Kumar, A simple provable algorithm for curve reconstruction, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.893-894, January 17-19, 1999, Baltimore, Maryland, United States
	5	Joachim Giesen, Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem, Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, p.164-176, March 17-19, 1999
	6	K. Menger (ed.) Ergebnisse eines Mathematischen Kolloquiums 2, Kolloquium 5.II.1930, Teubher Leipzig (1932)
	7	K. Menger Untersuchungen iiber eine allgemeine Metrik. Vierte Untersuchung. Zur Metrik der Kurvea, Math. Ann. 103, pp. 467-501 (1932)
	8	Yu.G. Reshetnyak Some Applications of integral Geometry to the Theory of Curves of Finite Rotation, Sib. Math. J. 29(1), pp. 109-116 (1988)

CITED BY 14

	N. Amenta , S. Choi , T. K. Dey , N. Leekha, A simple algorithm for homeomorphic surface reconstruction, Proceedings of the sixteenth annual symposium on Computational geometry, p.213-222, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
	Daniel Freedman, Combinatorial curve reconstruction in Hilbert spaces: a new sampling theory and an old result revisited, Computational Geometry: Theory and Applications, v.23 n.2, p.227-241, September 2002
	Ernst Althaus , Kurt Mehlhorn, TSP-based curve reconstruction in polynomial time, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.686-695, January 09-11, 2000, San Francisco, California, United States
	Jean-Daniel Boissonnat , Frédéric Cazals, Smooth surface reconstruction via natural neighbour interpolation of distance functions, Proceedings of the sixteenth annual symposium on Computational geometry, p.223-232, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
	Tamal K. Dey , Kurt Mehlhorn , Edgar A. Ramos, Curve reconstruction: connecting dots with good reason, Proceedings of the fifteenth annual symposium on Computational geometry, p.197-206, June 13-16, 1999, Miami Beach, Florida, United States
	Udo Adamy , Joachim Giesen , Matthias John, Surface reconstruction using umbrella filters, Computational Geometry: Theory and Applications, v.21 n.1, p.63-86, January 2002
	Tamal K. Dey , Rephael Wenger, Reconstruction curves with sharp corners, Proceedings of the sixteenth annual symposium on Computational geometry, p.233-241, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
	Stefan Funke , Edgar A. Ramos, Reconstructing a collection of curves with corners and endpoints, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.344-353, January 07-09, 2001, Washington, D.C., United States
	Tamal K. Dey , Joachim Giesen , Samrat Goswami , Wulue Zhao, Shape dimension and approximation from samples, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.772-780, January 06-08, 2002, San Francisco, California
	Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos, Manifold reconstruction from point samples, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	Yong Zeng , Thanh An Nguyen , Baiquan Yan , Shuren Li, A distance-based parameter free algorithm for curve reconstruction, Computer-Aided Design, v.40 n.2, p.210-222, February, 2008
	Udo Adamy , Joachim Giesen , Matthias John, New techniques for topologically correct surface reconstruction, Proceedings of the conference on Visualization '00, p.373-380, October 2000, Salt Lake City, Utah, United States
	Thanh An Nguyen , Yong Zeng, VICUR: A human-vision-based algorithm for curve reconstruction, Robotics and Computer-Integrated Manufacturing, v.24 n.6, p.824-834, December, 2008
	Yll Haxhimusa , Walter G. Kropatsch , Zygmunt Pizlo , Adrian Ion, Approximative graph pyramid solution of the E-TSP, Image and Vision Computing, v.27 n.7, p.887-896, June, 2009