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

Authors:
Michael T. Goodrich;Joseph S. B. Mitchell;Mark W. Orletsky
Affiliations:
Department of Computer Science, The Johns Hopkins University, Baltimore, MD;Department of Applied Math. Statistics, SUNY, Stony Brook, University Stony Brook, NY;Department of Computer Science, The Johns Hopkins University, Baltimore, MD
Venue:
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Year:
1994

Citing 21
Cited 21

Computational geometry: an introduction

Computational geometry: an introduction
Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Congruence, similarity and symmetries of geometric objects

Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Parallel merge sort

SIAM Journal on Computing
An optimal-time algorithm for slope selection

SIAM Journal on Computing
Minimax geometric fitting of two corresponding sets of points

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Introduction to algorithms

Introduction to algorithms
Selecting distances in the plane

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing the minimum Hausdorff distance for point sets under translation

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Dynamic trees and dynamic point location

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximate matching of polygonal shapes (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing the minimum Hausdorff distance between two point sets on a line under translation

Information Processing Letters
Approximate decision algorithms for point set congruence

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improvements on Geometric Pattern Matching Problems

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Generalized Approzimate Algorithms for Point Set Congruence

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures

Geometric tree matching with applications to 3D lung structures

Proceedings of the twelfth annual symposium on Computational geometry
Polynomial-Time Geometric Matching for Object Recognition

International Journal of Computer Vision
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Improved algorithms for robust point pattern matching and applications to image registration

Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
Geometric pattern matching: a performance study

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Geometric matching under noise: combinatorial bounds and algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate congruence in nearly linear time

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximate congruence in nearly linear time

Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Hausdorff distance under translation for points and balls

Proceedings of the nineteenth annual symposium on Computational geometry
Tracking 3-D Pulmonary Tree Structures

MMBIA '96 Proceedings of the 1996 Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA '96)
4-points congruent sets for robust pairwise surface registration

ACM SIGGRAPH 2008 papers
Delaunay triangulations of imprecise pointsin linear time after preprocessing

Proceedings of the twenty-fourth annual symposium on Computational geometry
Delaunay triangulation of imprecise points in linear time after preprocessing

Computational Geometry: Theory and Applications
The Directed Hausdorff Distance between Imprecise Point Sets

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hausdorff distance under translation for points and balls

ACM Transactions on Algorithms (TALG)
Constant time approximation scheme for largest well predicted subset

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Superposition and Alignment of Labeled Point Clouds

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved approximation bounds for planar point pattern matching

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Recognition of binding patterns common to a set of protein structures

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

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.