Scalable Parallel Algorithms for Geometric Pattern Recognition
Authors:
- Laurence BoxerLBLaurence Boxer
- Russ MillerRMRuss Miller
- Andrew Rau-ChaplinARAndrew Rau-Chaplin
- 1 September 1999
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 58 (3) , 466-486
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Faster point set pattern matching in 3-DPattern Recognition Letters, 1998
- Scaleable Parallel Algorithms for Lower Envelopes with ApplicationsJournal of Parallel and Distributed Computing, 1998
- Point set pattern matching in 3-DPattern Recognition Letters, 1996
- Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar latticesPattern Recognition Letters, 1993
- Finding congruent regions in parallelParallel Computing, 1992
- An optimal convex hull algorithm and new results on cuttings1991
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985