Faster point set pattern matching in 3-D-Reference-Cited by-同舟云学术

Faster point set pattern matching in 3-D

Published:1998-11 Issue:13 Volume:19 Page:1235-1240
ISSN:0167-8655
Container-title:Pattern Recognition Letters
language:en
Short-container-title:Pattern Recognition Letters

Author:

Boxer Laurence

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference13 articles.

1. Sharp upper and lower bounds on the length of general Davenport–Schinzel sequences;Agarwal;Journal of Combinatorial Theory A,1989

2. Alt, H., Guibas, L.J., 1996. Discrete geometric shapes: matching, interpolation, and approximation. Report B 96-11, Institut für Informatik, Freie Universität, Berlin

3. Finding congruent regions in parallel;Boxer;Parallel Computing,1992

4. Point set pattern matching in 3-D;Boxer;Pattern Recognition Letters,1996

5. Combinatorial complexity bounds for arrangements of curves and surfaces;Clarkson;Discrete and Computational Geometry,1990

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ant colony optimization based binary search for efficient point pattern matching in images;European Journal of Operational Research;2015-10

2. A fast expected time algorithm for the 2-D point pattern matching problem;Pattern Recognition;2004-08

3. Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset;Algorithms - ESA 2000;2000

4. Even faster point set pattern matching in 3D;Vision Geometry VIII;1999-09-23

5. Scalable Parallel Algorithms for Geometric Pattern Recognition;Journal of Parallel and Distributed Computing;1999-09