Article

Free access

Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version)

Authors:

Michael T. Goodrich,

Joseph S. B. Mitchell,

Mark W. OrletskyAuthors Info & Claims

SCG '94: Proceedings of the tenth annual symposium on Computational geometry

Pages 103 - 112

https://doi.org/10.1145/177424.177572

Published: 10 June 1994 Publication History

Abstract

We present practical methods for approximate geometric pattern matching in d-dimensions along with experimental data regarding the quality of matches and running times of these methods versus those of a branch-and-bound search. Our methods are faster than previous methods but still produce good matches.

References

[1]

P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, "Selecting distances in the plane," in Pro,:. 6th Annu. A G'M Sympos. Comput. Geom., 321-331, 1990.]]

Digital Library

[2]

H. Alt, B. Behrends, and J. B16mer, "Approximate matching of polygonal shapes," in Proc. 7th Annu. ACM $yrnpos. Comput. Geom., 186-193, 1991.]]

Digital Library

[3]

H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, "Congruence, similarity and symmetries of geometric objects,'' Discrete Comput. Geom., 3, 237-256, 1988.]]

Digital Library

[4]

E. M. Arkin, K. Kedem, 2. S. B. Mitchell, J. Sprinzak, and M. Werman, "Matching points into pairwisedisjoint noise regions: combinatorial bounds and algorithms,'' ORSA J. Comput., 4(4), 375-38,5, 1992.]]

[5]

S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu, "An optimal algorithm for approximate nearest neighbor searching," in Proc. 5th A CM. SiAM $!tmp. on Discrete Algorithms, 1994.]]

Digital Library

[6]

L. P. Chew, M. Goodrich, D. Huttenlocher, K. Keclam, J. Kl~inh~rg, and D. Kravets, "Geometric pattern matching under Euclidean motion," in Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 151-156, 1993.]]

[7]

L. P. Chew and K. Kedem, "Improvements on geometric pattern matching problems," in Proc. 8rd Scan& Workshop Algorithm Theory, Lecture Notes in Computer Science, vol. 621, Springer-Verlag, 318-325, 1992.]]

Digital Library

[8]

R. Cole, "Slowing down sorting networks to obtain faster sorting algorithms," in Proc. ~5th Annu. IEEE Sympos. Found. Comput. Sci., 255-260, 1984.]]

[9]

R. Cole, "Parallel merge sort," SIAM J. Comput., 17(4), 770-785, 1988.]]

Digital Library

[10]

R. Cole, 3. SaJowe, W. Steiger, and E. Szemer~di, "An optimal-time algorithm for slope selection," SIAM J. Gomput., 18, 792-810, 1989.]]

Digital Library

[11]

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, Mass., 1990.]]

Digital Library

[12]

H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol. 10, Springer-Verlag, Heidelberg, West Germany, 1987.]]

Digital Library

[13]

J. D. Foley and A. Van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley, Reading, MA, 1982.]]

Digital Library

[14]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. I-I. Freeman, New York, NY, 1979.]]

Digital Library

[15]

M. Goodrich and R. Tamassia, "Dynamic trees and dynamic point location," in Proc. 23rd Annu. A CM Sympos. Theory Comput., 523-533, 1991.]]

Digital Library

[16]

P. J. Heffernan, "Generalized approximate algorithms for point set congruence," in Proc. 3rd Workshop Algorithms Data Struct., Lecture Notes in Computer Science, vol. 709, 373-384, 1993.]]

Digital Library

[17]

P. J. Heffernan and S. Schirra, "Approximate decision algorithms for point set congruence," in Proc. 8th Annu. A CM Sympos. Comput. Geom., 93-101, 1992.]]

Digital Library

[18]

D. P. Huttenlocher and K. Kedem, "Computing the minimum Hausdorff distance for point sets under translation," in Proc. 6th Annu. A CM Sympos. Comput. Geom., 340-349, 1990.]]

Digital Library

[19]

D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg, "On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane," in Proc. 8th Annu. A CM Sympos. Comput. Geom., 110-120, 1992.]]

Digital Library

[20]

D. P. ttuttenlocher, K. Kedem, and M. Sharir, "The upper envelope of Voronoi surfaces and its applications,'' in Proc. 7th Annu. A CM Sympos. Comput. Geom., 194-203, 1991.]]

Digital Library

[21]

K. Imai, S. Sumino, and H. Imai, "Minimax geometric fitting of two corresponding sets of points," in Proc. 5th Annu. A CM Sympos. Comput. Geom., 266-275, 1989.]]

Digital Library

[22]

N. Megiddo, "Applying parallel computation algorithms in the design of serial algorithms," J. A CM, 30, 852-865, 1983.]]

Digital Library

[23]

K. Mehlhorn, Multi-dimensional Searching and Computational Geometry, Data Structures and Algorithms, vol. 3, Springer-Verlag, Heidelberg, West Germany, 1984.]]

Digital Library

[24]

F. P. Preparata and M. I. Shamos, Uomputational Geometry: an Introduction, Springer-Verlag, New York, NY, 1985.]]

Digital Library

[25]

G. Rote, "Computing the minimum Hausdorff distance between two point sets on a line under translation," inform. Process. Lett., 38, 123-127, 1991.]]

Digital Library

[26]

W. Rucklidge, "Lower bounds for the complexity of the Hausdorff distance," in Proc. 5th Canad. Con/. Cornput. Geom., Waterloo, Canada, 145-150, 1993.]]

Cited By

Zhao LMbachu JLiu Z(2022)Developing an Integrated BIM+GIS Web-Based Platform for a Mega Construction ProjectKSCE Journal of Civil Engineering10.1007/s12205-022-0251-x26:4(1505-1521)Online publication date: 28-Jan-2022
https://doi.org/10.1007/s12205-022-0251-x
Huang ZFeng QWang JXu J(2022)Small Candidate Set for Translational Pattern SearchAlgorithmica10.1007/s00453-022-00997-x84:10(3034-3053)Online publication date: 5-Jul-2022
https://doi.org/10.1007/s00453-022-00997-x
Kosarevsky SLatypov V(2012)Practical Procedure for Position Tolerance Uncertainty Determination via Monte-Carlo Error PropagationMeasurement Science Review10.2478/v10048-012-0001-112:1(1-7)Online publication date: 1-Jan-2012
https://doi.org/10.2478/v10048-012-0001-1
Show More Cited By

Index Terms

Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version)
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Approximate Geometric Pattern Matching Under Rigid Motions

We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal and conduct experiments to show ...
Simple algorithms for partial point set pattern matching under rigid motion

This paper presents simple and deterministic algorithms for partial point set pattern matching in 2D. Given a set P of n points, called sample set, and a query set Q of k points (n>=k), the problem is to find a matching of Q with a subset of P under ...
Approximate pattern matching with gap constraints

Pattern matching is a key issue in sequential pattern mining. Many researchers now focus on pattern matching with gap constraints. However, most of these studies involve exact pattern matching problems, a special case of approximate pattern matching and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SCG '94: Proceedings of the tenth annual symposium on Computational geometry

June 1994

400 pages

ISBN:0897916484

DOI:10.1145/177424

Chairman:
Kurt Mehlhorn
U.S. Army Research Office

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SCG94

Sponsor:

SCG94: Tenth Symposium on Computational Geometry

June 6 - 8, 1994

New York, Stony Brook, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
627
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)8

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao LMbachu JLiu Z(2022)Developing an Integrated BIM+GIS Web-Based Platform for a Mega Construction ProjectKSCE Journal of Civil Engineering10.1007/s12205-022-0251-x26:4(1505-1521)Online publication date: 28-Jan-2022
https://doi.org/10.1007/s12205-022-0251-x
Huang ZFeng QWang JXu J(2022)Small Candidate Set for Translational Pattern SearchAlgorithmica10.1007/s00453-022-00997-x84:10(3034-3053)Online publication date: 5-Jul-2022
https://doi.org/10.1007/s00453-022-00997-x
Kosarevsky SLatypov V(2012)Practical Procedure for Position Tolerance Uncertainty Determination via Monte-Carlo Error PropagationMeasurement Science Review10.2478/v10048-012-0001-112:1(1-7)Online publication date: 1-Jan-2012
https://doi.org/10.2478/v10048-012-0001-1
Shao TXu WYin KWang JZhou KGuo B(2011)Discriminative Sketch‐based 3D Model Retrieval via Robust Shape MatchingComputer Graphics Forum10.1111/j.1467-8659.2011.02050.x30:7(2011-2020)Online publication date: 4-Nov-2011
https://doi.org/10.1111/j.1467-8659.2011.02050.x
Fober TGlinca GKlebe GHullermeier E(2011)Superposition and Alignment of Labeled Point CloudsIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2011.428:6(1653-1666)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1109/TCBB.2011.42
da Silva JBorges Dde Barros Vidal F(2011)A dynamic approach for approximate pairwise alignment based on 4-points congruence sets of 3D points2011 18th IEEE International Conference on Image Processing10.1109/ICIP.2011.6116701(889-892)Online publication date: Sep-2011
https://doi.org/10.1109/ICIP.2011.6116701
Zhou YWei WYu CSun YXing CShen WShi X(2011)A Munkres Particle Swarm optimization algorithm for point pattern matchingProceedings 2011 International Conference on Human Health and Biomedical Engineering10.1109/HHBE.2011.6029033(1164-1167)Online publication date: Aug-2011
https://doi.org/10.1109/HHBE.2011.6029033
Meng YZhang H(2011)Registration of point clouds using sample-sphere and adaptive distance restrictionThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-011-0580-027:6-8(543-553)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1007/s00371-011-0580-0
Fu BWang L(2010)Constant time approximation scheme for largest well predicted subsetProceedings of the 16th annual international conference on Computing and combinatorics10.5555/1886811.1886866(429-438)Online publication date: 19-Jul-2010
https://dl.acm.org/doi/10.5555/1886811.1886866
Agarwal PHar-Peled SSharir MWang Y(2010)Hausdorff distance under translation for points and ballsACM Transactions on Algorithms10.1145/1824777.18247916:4(1-26)Online publication date: 3-Sep-2010
https://dl.acm.org/doi/10.1145/1824777.1824791
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents