Point set pattern matching is an integral part of many pattern recognition problems. We study
a randomized algorithm for the alignment approach to model-based recognition. Under …

We give an algorithm for matching finite points sets in Euclidean 3-space, R 3. The algorithm
runs in O (kn 5 2 [λ 6 (n)/n] 1 4 log n) time, where k is the size of the pattern and n is the size …

We study input sensitive algorithms for point pattern matching under various transformations
and the Hausdorff metric as a distance function. Given point sets P and Q in the plane, the …

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 …

In this paper we apply computational geometry techniques to obtain an efficient algorithm for
the following point set pattern matching problem. Given a set S of n points and a set P of k …

One of the basic building blocks in any point-based registration scheme involves matching
feature points that are extracted from a sensed image to their counterparts in a reference …

The subject of this paper is the design and analysis of Monte Carlo algorithms for two basic
mat thing techniques used in model-based recognition: alignment, and geometric hashing …

Let P= P 1,…, P m and Q= Q 1,…, Q n be two patterns of points. Each pairing (Pi, Qj) of a
point of P with a point of Q defines a relative displacement δij of the two patterns. We can …

Geometry Page 1 DOI: 10.1007/s00454-002-2884-3 Discrete Comput Geom 28:495–510 (2002)
Discrete & Computational Geometry © 2002 Springer-Verlag New York Inc. Combinatorial …

An efficient algorithm for matching two three-dimensional point sets extracted from rigid
objects is described. The algorithm begins by pairing a triplet of noncollinear points in one …