Approximate decision algorithms for point set congruence

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximate decision algorithms for point set congruence

Full text

Pdf (753 KB)

Source

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

Berlin, Germany

Pages: 93 - 101

Year of Publication: 1992

ISBN:0-89791-517-8

Authors

Paul J. Heffernan
Stefan Schirra

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): 23, 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.142697 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.

	AMWW	Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl, Congruence, similarity and symmetries of geometric objects, Discrete & Computational Geometry, v.3 n.3, p.237-256, Jan., 1988 [doi>10.1007/BF02187910]
	AKMSW	Esther M. Arkin , Klara Kedem , Joseph S. B. Mitchell , Josef Sprinzak , Michael Werman, Matching points into noise regions: combinatorial bounds and algorithms, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.42-51, January 28-30, 1991, San Francisco, California, United States
	AMO	R. K. Ahuja , T. L. Magnanti , J. B. Orlin, Network flows, Optimization, Elsevier North-Holland, Inc., New York, NY, 1989
	AMZ	E.M. Arkin, J.S.B. Mitchell, and K. gikan, Algorithms for Generalized Matching of Point Sets, Presented at the CORS/ORSA/TIMS National Meeting, Vancouver, B.C., May 1989.
	Ba	Henry S. Baird, Model-based image matching using location, Massachusetts Institute of Technology, Cambridge, MA, 1985
	Be	B. Behrends, Algorithmen zur Erkennung der e- Kongruenz yon Punktmengen und Polygonen, Diplomarbeit, Freie Universitit Berlin, Germany, 1990.
	FM	Tomás Feder , Rajeev Motwani, Clique partitions, graph compression and speeding-up algorithms, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.123-133, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103424]
	GT	Andrew V. Goldberg , Robert E. Tarjan, A new approach to the maximum-flow problem, Journal of the ACM (JACM), v.35 n.4, p.921-940, Oct. 1988 [doi>10.1145/48014.61051]
	GTT	A.V. Goldberg, E. Tardos, and R.E. Tarjan. Network Flow Algorithms. In B. Korte, L. Lov~isz, H.J. PrSmel, and A. Schrijver, editors, Paths, Flows, and VLSI-Layout, pp. 101-164. Springer Verlag, 1990.
	He	Paul J. Heffernan, The translation square map and approximate congruence, Information Processing Letters, v.39 n.3, p.153-159, Aug. 16, 1991 [doi>10.1016/0020-0190(91)90112-U]
	HK	Daniel P. Huttenlocher , Klara Kedem, Computing the minimum Hausdorff distance for point sets under translation, Proceedings of the sixth annual symposium on Computational geometry, p.340-349, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98599]
	HKS	Daniel P. Huttenlocher , Klara Kedem , Micha Sharir, The upper envelope of Voronoi surfaces and its applications, Proceedings of the seventh annual symposium on Computational geometry, p.194-203, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109670]
	ISI	K. Imai , S. Sumino , H. Imai, Minimax geometric fitting of two corresponding sets of points, Proceedings of the fifth annual symposium on Computational geometry, p.206-275, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73863]
	Iw	S. Iwanowski, Approximate Congruer~ce arid Symmetry Detection ia the Platte, Ph.D. Thesis, Fa,chbereich Mathematik, Freie Universit~t Berlin, 19!)0.
	KRT	V. King , S. Rao , R. Tarjan, A faster deterministic maximum flow algorithm, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.157-164, September 1992, Orlando, Florida, United States
	LS	Hans-Peter Lenhof , Michiel H. M. Smid, An Optimal Construction Method for Generalized Convex Layers, Proceedings of the 2nd International Symposium on Algorithms, p.349-363, December 16-18, 1991
	Sc1	S. Schirra, Uber die Bitkomplezit~t der e-Kongruenz, Diplomarbeit, Universitgrt des Saarlandes, Saarbrficken, Germany, 1988.
	Sc2	S. Schirra, Approximate Algorithms for Approximate Congruence, Tech. Report A21/90, Universit~t des Saarlandes, Saarbriicken, Germany, 1990.
	Sp	J. Sprinzak, Master's Thesis, Hebrew Univer.,iity, Dept. of Computer Science, 1990.

CITED BY 4

	Michael T. Goodrich , Joseph S. B. Mitchell , Mark W. Orletsky, Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version), Proceedings of the tenth annual symposium on Computational geometry, p.103-112, June 06-08, 1994, Stony Brook, New York, United States
	Helmut Alt , Oswin Aichholzer , Günter Rote, Matching shapes with a reference point, Proceedings of the tenth annual symposium on Computational geometry, p.85-92, June 06-08, 1994, Stony Brook, New York, United States
	Y. Uny Cao , Alex S. Fukunaga , Andrew Kahng, Cooperative Mobile Robotics: Antecedents and Directions, Autonomous Robots, v.4 n.1, p.7-27, March 1997
	Goce Trajcevski , Hui Ding , Peter Scheuermann , Roberto Tamassia , Dennis Vaccaro, Dynamics-aware similarity of moving objects trajectories, Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems, November 07-09, 2007, Seattle, Washington