Curve reconstruction

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Curve reconstruction: connecting dots with good reason

Full text

Pdf (895 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: 197 - 206

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Tamal K. Dey	Department of CSE, IIT Kharagpur, India 721302
Kurt Mehlhorn	Max-Planck-Institut für Informatik, D-66123 Saarbrücken, Germany
Edgar A. Ramos	Max-Planck-Institut für Informatik, D-66123 Saarbrücken, Germany

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): 5, Downloads (12 Months): 29, Citation Count: 7

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.304972 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	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]
	2	Dominique Attali, r-regular shape reconstruction from unorganized points, Proceedings of the thirteenth annual symposium on Computational geometry, p.248-253, June 04-06, 1997, Nice, France [doi>10.1145/262839.262980]
	3	F. Bernardini and C. L. Bajaj. Sampling and reconstructing manifolds using a-shapes. Proc. 9th Canadian Con}. Comput. Geom., (1997), 193- 198.
	4	Jonathan W. Brandt , V. Ralph Algazi, Continuous skeleton computation by Voronoi diagram, CVGIP: Image Understanding, v.55 n.3, p.329-338, May 1992 [doi>10.1016/1049-9660(92)90030-7]
	5	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
	6	Herbert Edelsbrunner, Shape Reconstruction with Delaunay Complex, Proceedings of the Third Latin American Symposium on Theoretical Informatics, p.119-132, April 20-24, 1998
	7	H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel. On the shape of a set of points in the plane. IEEE Transactions on Information Theory, vol. 29 (4) (1983), 71-78.
	8	L. H. Figueiredo and J. M. Gomes. Computational morphology of curves. Visual Computer, vol. 11 (1994), 105-112.
	9	Joachim Giesen, Curve reconstruction, the traveling salesman problem and Menger's theorem on length, Proceedings of the fifteenth annual symposium on Computational geometry, p.207-216, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304973]
	10	Christopher Gold, Crust and anti-crust: a one-step boundary and skeleton extraction algorithm, Proceedings of the fifteenth annual symposium on Computational geometry, p.189-196, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304971]
	11	D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In "Computational Geometry", edited by G. Toussaint. North Holland, 217-248.
	12	LEDA (Library of Efficient Data Types and Algorithms), http://#aw.mpi-sb.mpg.de/LEDh/ leda. html
	13	Mahmoud Melkemi, A-shapes of a finite point set, Proceedings of the thirteenth annual symposium on Computational geometry, p.367-369, June 04-06, 1997, Nice, France [doi>10.1145/262839.263005]
	14	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	15	G. Toussaint. Pattern recognition and computational complexity. Proc. Fifth Intern. Conf. Pattern Recognition, (1980), 1324-1347.
	16	Remco C. Veltkamp, The &ggr;-neighborhood graph, Computational Geometry: Theory and Applications, v.1 n.4, p.227-246, April 1992 [doi>10.1016/0925-7721(92)90003-B]
	17	C. T. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput, vol. C-20 (1971), 68-86.

CITED BY 7

	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
	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
	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
	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
	Daniel Freedman, Efficient Simplicial Reconstructions of Manifolds from Their Samples, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.10, p.1349-1357, October 2002
	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
	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