Even faster point set pattern matching in 3D

Laurence Boxer

doi:10.1117/12.364091

23 September 1999 Even faster point set pattern matching in 3D

Laurence Boxer

Proceedings Volume 3811, Vision Geometry VIII; (1999) https://doi.org/10.1117/12.364091
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

Abstract

Several recent papers have produced successively faster running times for solution of the Point Set Matching Problem (PSPM) (finding all congruent copies of a pattern in a sample set) in Euclidean 3-space, R³. Here, we obtain further improvement in the speed with which this problem can be solved. The source of the improvement over the previous fastest running time is a better upper bound for the volume of output, derived from a recent result. The previous best sequential running time for PSPM in R³ is O{kn²[(lambda) ₆(n)/n$RT^0.5 log n }, where k is the size of the pattern and n is the size of the sample set. Here, we give a sequential algorithm for the PSPM in R³ running in O[n²log n + kn^1.8 log n (log*n)^O(1)$RT time. Solutions to related problems are also discussed.

Citation Download Citation

Laurence Boxer "Even faster point set pattern matching in 3D", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); https://doi.org/10.1117/12.364091

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available