Measuring the resemblance of polygonal curves

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Measuring the resemblance of polygonal curves

Full text

Pdf (693 KB)

Source

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

Berlin, Germany

Pages: 102 - 109

Year of Publication: 1992

ISBN:0-89791-517-8

Authors

Helmut Alt
Michael Godau

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): 28, Citation Count: 4

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.142699 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.

	ABB	Helmut Alt , Bernd Behrends , Johannes Blömer, Approximate matching of polygonal shapes (extended abstract), Proceedings of the seventh annual symposium on Computational geometry, p.186-193, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109669]
	ABGW	Helmut Alt , Johannes Blömer , Michael Godau , Hubert Wagener, Approximation of convex polygons, Proceedings of the seventeenth international colloquium on Automata, languages and programming, p.703-716, July 1990, Warwick University, England
	C	Richard Cole, Parallel merge sort, SIAM Journal on Computing, v.17 n.4, p.770-785, August 1988 [doi>10.1137/0217049]
	CLR	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	E	G.M. EWING, Calculus of Variations with Applications, Dover Publ., New York, 1985.
	Fr	M. FRI~CHET, Sur quelques points du calcul fonctionnel, Rendiconti del Circolo Mathematico di Palermo, Vol. 22, 1906, pp. 1-74.
	G1	Michael Godau, A natural metric for curves—computing the distance for polygonal chains and approximation algorithms, Proceedings of the 8th annual symposium on Theoretical aspects of computer science, p.127-136, February 1991, Hamburg, Germany
	G2	M. GODAU, Die Fr6chet-Metrik fiir Polygonziige ~ Algorithmen zur Abstandsmessung und Approximation, Diplomarbeit, Fachbereich Mathematik, FU Berlin 1991.
	GPY	J. E. Goodman , J. Pach , C. K. Yap, Mountain climbing, ladder moving, and the ring-width of a polygon, American Mathematical Monthly, v.96 n.6, p.494-510, June–July 1989 [doi>10.2307/2323971]
	M	Nimrod Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, Journal of the ACM (JACM), v.30 n.4, p.852-865, Oct. 1983 [doi>10.1145/2157.322410]
	N	B.K. NATARAJAN, On Piecewise Linear Appproximations to Curves, Hewlett-Packard Laboratories, Technical Report, HPL-91-36. Palo Alto, USA, 1991.

CITED BY 4

	Andrew B. Kahng, Classical floorplanning harmful?, Proceedings of the 2000 international symposium on Physical design, p.207-213, May 2000, San Diego, California, United States
	James D. Fix , Richard E. Ladner, Multiresolution banded refinement to accelerate surface reconstruction from polygons, Proceedings of the fourteenth annual symposium on Computational geometry, p.240-248, June 07-10, 1998, Minneapolis, Minnesota, United States
	Gill Barequet , Michael T. Goodrich , D. Z. Chen , O. Daescu , J. Snoeyink, Efficiently approximating polygonal paths in three and higher dimensions, Proceedings of the fourteenth annual symposium on Computational geometry, p.317-326, June 07-10, 1998, Minneapolis, Minnesota, United States
	Michael Elad , Ayellet Tal , Sigal Ar, Content based retrieval of VRML objects: an iterative and interactive approach, Proceedings of the sixth Eurographics workshop on Multimedia 2001, p.107-118, September 08-09, 2001, Manchester, UK