Abstract
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 of the sample set. Further, if the pattern we seek to match is a collinear set, the running time of our algorithm reduces to O(n 2 + kn 3 2 [λ 6(n)/n] case1 4 log n) . These results improve upon the O( kn 3) running time of the algorithm given in (De Rezende and Lee, 1995) for the case d = 3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
