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
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Spatial layout representation for query-by-sketch content-based image retrieval
Pattern Recognition Letters
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Computing Largest Common Point Sets under Approximate Congruence
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Point matching under non-uniform distortions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A knowledge based system for content-based retrieval of Scalable Vector Graphics documents
Proceedings of the 2004 ACM symposium on Applied computing
Two-dimensional pattern matching with rotations
Theoretical Computer Science
A Logic for SVG Documents Query and Retrieval
Multimedia Tools and Applications
Automatically and accurately conflating orthoimagery and street maps
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Fast Approximate Point Set Matching for Information Retrieval
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Exact algorithms for partial curve matching via the Fréchet distance
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Smoothed analysis of probabilistic roadmaps
Computational Geometry: Theory and Applications
Geometric pattern matching for point sets in the plane under similarity transformations
Information Processing Letters
Approximate input sensitive algorithms for point pattern matching
Pattern Recognition
Structured knowledge representation for image retrieval
Journal of Artificial Intelligence Research
Two-dimensional pattern matching with rotations
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On the complexity of affine image matching
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Blocked pattern matching problem and its applications in proteomics
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Approximate point set pattern matching with Lp-norm
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Improved approximation bounds for planar point pattern matching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
An efficient approximation algorithm for point pattern matching under noise
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Non-crossing matchings of points with geometric objects
Computational Geometry: Theory and Applications
Deterministic length reduction: fast convolution in sparse data and applications
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
One-dimensional approximate point set pattern matching with Lp-norm
Theoretical Computer Science
| Hi-index | 0.00 |
Two sets of points in $d$-dimensional space are given: a {\it data set\/} $D$ consisting of $N$ points, and a {\it pattern set\/} or {\it probe\/} $P$ consisting of $k$ points. We address the problem of determining whether there is a transformation, among a specified group of transformations of the space, carrying $P$ into or near (meaning at a small directed Hausdorff distance of) $D$. The groups we consider are translations and rigid motions. Runtimes of approximately $O(n \log n)$ and $O(n^d \log n)$ respectively are obtained (letting $n=\max\{N,k\}$ and omitting the effects of several secondary parameters). For translations, a runtime of approximately $O(n(ak+1)\log^2 n)$ is obtained for the case that a constant fraction $a