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 ...

We give an algorithm for matching finite points sets in Euclidean 3-space, R 3. The algorithm runs in O (knS/2[ A6 (n)/n ] 1/4.

Several recent papers have produced successively faster running times for solution of the Point Set Matching Problem (PSPM) (finding all congruent copies of ...

Jan 20, 2015 · I have two sets of points A and B, whereas the points can be 2D or 3D. Both sets have the same size n, which is rather low (5 - 20). I would like to know how ...

Point pattern matching has been extensively studied and has many applications. The paper "Using k-d Trees for Robust 3D Point Pattern Matching" by Li and ...

Jan 7, 2015 · I would try the Iterative Closest Point algorithm. A simple version like the one you need should be easy to implement.

ppm3d is a 3D Point Pattern Matching package that is designed to find the closest match for a given 3D motif in a 3D point cloud.

Simple algorithms for partial point set pattern matching under rigid motion. This paper presents simple and deterministic algorithms for partial point set ...

Point-set registration, also known as point-cloud registration or scan matching, is the process of finding a spatial transformation

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally nonrigid distribution.