Scalable parallel algorithms for geometric pattern recognition

Journal of Parallel and Distributed Computing

Volumn 58, Issue 3, 1999, Pages 466-486

  Boxer, Laurence ^a,b   Miller, Russ ^b   Rau Chaplin, Andrew ^c  

^a NIAGARA UNIVERSITY   (United States)

^b State Univ of New York at Buffalo ^*  (United States)

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Parallel algorithms; computational geometry; scalable algorithms; coarse grained multicomputer

Indexed keywords

EID: 0004511228     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1565     Document Type: Article

References (34)

1. Agarwal P. K. Partitioning arrangements of lines. II. Applications. Discr. Comput. Geom. 5:1990;533-573.
2. Agarwal P. K. Intersection and Decomposition Algorithms for Planar Arrangements. 1991;Cambridge Univ. Press, Cambridge.
3. Agarwal P. K., Sharir M., Shor P. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Combin. Theory Ser. A. 52:1989;228-274.
4. Akl S. G., Lyons K. A. Parallel Computational Geometry. 1993;Prentice-Hall, New York.
5. Atallah M. J. Some dynamic computational geometry problems. Comp. Math. Appl. 11:1985;1171-1181.
6. Boxer L. Finding congruent regions in parallel. Parallel Comput. 18:1992;807-810.
7. Boxer L. Point set pattern matching in 3-D. Pattern Recognit. Lett. 17:1996;1293-1297.
8. Boxer L. Faster point set pattern matching in 3-D. Pattern Recognition Letters. 19:1998;1235-1240.
9. Boxer L., Miller R. Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. Pattern Recognition Letters. 14:1993;17-22.
10. Boxer L., Miller R., Rau-Chaplin A. Some scalable parallel algorithms for geometric problems. SUNY at Buffalo Department of Computer Science Technical Report. 1996.
11. L. Boxer, R. Miller, and A. Rau-Chaplin, Some scalable parallel algorithms for geometric problems, in Proceedings IASTED Conference on Parallel and Distributed Computing and Systems, 1996, pp. 426-430.
12. Boxer L., Miller R., Rau-Chaplin A. Scaleable parallel algorithms for lower envelopes with applications. J. Parallel Distrib. Comput. 53:1998;91-118.
13. B. Chazelle, An optimal convex hull algorithm and new results on cuttings, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 29-38.
14. Clarkson K. L., Edelsbrunner H., Guibas L. J., Sharir M., Welzl E. Combinatorial complexity bounds for arrangements of curves and surfaces. Discrete and Computational Geometry. 5:1990;99-160.
15. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and, T. von Eicken, LogP: Towards a Realistic Model of Parallel Computation, in, Proc. 4th ACM SIGPLAN Sym. on Principles of Parallel Programming, 1993.
16. Davenport H., Schinzel A. A combinatorial problem connected with differential equations. Amer. J. Math. 87:1965;684-694.
17. F. Dehne, A. Fabri, and A. Rau-Chaplin, Scalable parallel geometric algorithms for multicomputers, in Proc. 9th ACM Symp. on Computational Geometry, 1993, pp. 298-307.
18. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, in Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, 1995, pp. 27-33.
19. X. Deng and P. Dymond, Efficient routing and message bounds for optimal parallel algorithms, in Proceedings International Parallel Processing Symposium, 1995, pp. 556-562.
20. de Rezende P. J., Lee D. T. Point set pattern matching in d-dimensions. Algorithmica. 13:1995;387-404.
21. Diallo M., Ferreira A., Rau-Chaplin A., Ubeda S. Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. J. Parallel Distrib. Comput. 56:1999;47-70.
22. Erdos P. On a set of distances of n points. Amer. Math. Monthly. 53:1946;248-250.
23. Goodrich M. T., Kravetz D. Point set pattern matching. Johns Hopkins University Department of Computer Science Technical Report. 1992.
24. Hambrusch S., Khokhar A. C3: An architecture-independent model for coarse-grained parallel machines. Purdue University Computer Sciences Technical Report. 1993.
25. Hart S., Sharir M. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica. 6:1986;151-177.
26. Kahng A. B., Robins G. Optimal algorithms for extracting spatial regularity in images. Pattern Recognit. Lett. 12:1991;757-764.
27. Lei C-L., Liaw H-T. A parallel algorithm for finding congruent regions. Comput. Graphics. 16:1992;289-294.
28. Miller R., Stout Q. F. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. 1996;MIT Press, Cambridge.
29. Pach J., Sharir M. Repeated angles in the plane and related problems. J. Combin. Theory. 59:1992;12-22.
30. Shih Z. C., Lee R. C. T., Yang S. N. A parallel algorithm for finding congruent regions. Parallel Comput. 13:1990;135-142.
31. Spencer J., Szemeredi E., Trotter W. T. Jr. Unit distances in the Euclidean plane. Graph Theory and Combinatorics. 1984;Academic Press, London. p. 293-303.
32. Valiant L. G. A bridging model for parallel computation. Comm. ACM. 33:1990;103-111.
33. Van Kreveld M. J., De Berg M. T. Finding squares and rectangles in sets of points. BIT. 31:1991;202-219.
34. Wiernik A., Sharir M. Planar realization of nonlinear Davenport-Schinzel sequences by segments. Discrete and Computational Geometry. 3:19