Time-optimal nearest-neighbor computations on enhanced meshes

Journal of Parallel and Distributed Computing

Volumn 36, Issue 2, 1996, Pages 144-155

  Olariu, Stephan ^a   Stojmenović, Ivan ^b  

^a ECS Building   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (39)

1. 1. Aggarwal, A. Optimal bounds for finding maximum on array of processors with k global buses. IEEE Trans. Comput. C-35 (1986), 62-64.
2. 2. Akl, S. G., and Lyons, K. A. Parallel Computational Geometry Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. 3. Ballard, D. H., and Brown, C. M. Computer Vision. Prentice-Hall, Englewood Cliffs, NJ, 1982.
4. 4. Bar-Noy, A., and Peleg, D. Square meshes are not always optimal, IEEE Trans. Comput. C-40 (1991), 196-204.
5. 5. Batcher, K. E. Design of massively parallel processor, IEEE Trans. Comput. C-29 (1980), 836-840.
6. 6. Bhagavathi, D., Gurla, H., Olariu, S., Schwing, J. L., and Zhang, J. Square meshes are not optimal for convex hull computation. IEEE Trans. Parallel Distrib. Systems, to appear.
7. 7. Bhagavathi, D., Bokka, V., Gurla, H., Olariu, S., Schwing, J. L., and Stojmenović, I. Time-optimal visibility-related problems on meshes with multiple broadcasting. IEEE Trans. Parallel Distrib. Systems 6 (1995), 687-703.
8. 8. Bhagavathi, D., Looges, P. J., Olariu, S., Schwing, J. L., and Zhang, J. A fast selection algorithm on meshes with multiple broadcasting. IEEE Trans. Parallel Distrib. Systems 5 (1994), 772-778.
9. 9. Bhagavathi, D., Olariu, S., Shen, W., and Wilson, L. A time-optimal multiple search algorithm on enhanced meshes, with applications. J. Parallel Distrib. Comput. 22 (1994), 113-120.
10. 10. Bhagavathi, D., Olariu, S., Schwing, J. L., Shen, W., Wilson, L., and Zhang J. Convexity problems on meshes with multiple broadcasting. J. Parallel Distrib. Comput. 27 (1995), 142-156.
11. 11. Blanz, W.-E., Petkovic, D., and Sanz, J. L. C. Algorithms and architectures for machine vision. In Chen, C. H. (Ed.). Signal Processing Handbook. Dekker, New York, 1989.
12. 12. Bokhari, S. H. Finding maximum on an array processor with a global bus. IEEE Trans. Comput. C-33 (1984), 133-139.
13. 13. Cahn, R., Poulsen, R., and Toussaint, G. Segmentation of cervical cell images. J. Histochem. Cytochem. 25 (1977), 681-688.
14. 14. Chen, Y. C., Chen, W. T., Chen, G. H., and Sheu, J. P. Designing efficient parallel algorithms on mesh connected computers with multiple broadcasting. IEEE Trans. Parallel Distrib. Systems 1 (1990), 241-246.
15. 15. Chen, Y. C., Chen, W. T., and Chen, G.-H. Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting. J. Parallel Distrib. Comput. 15 (1992), 79-84.
16. 16. Cole, R., and Goodrich, M. T. Optimal parallel algorithms for pointset and polygon problems. Algorithmica 7 (1992), 3-23.
17. 17. Cook, S. A., Dwork, C., and Reischuk, R. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15 (1986), 87-97.
18. 18. Duda, R. O., and Hart, P. E. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
19. 19. Gualtieri, J. A., LeMoigne, J., and Packer, C. V. Distance between images. Proc. 4th Symposium on Frontiers of Massively Parallel Computation. McLean, VA, 1992, pp. 216-223.
20. 20. JáJá, J. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1991.
21. 21. Jeong, C. S., and Lee, D. T. Parallel geometric algorithms on a mesh-connected computer. Algorithmics 5 (1990), 155-177.
22. 22. Kumar, V. P., and Raghavendra, C. S. Array processor with multiple broadcasting. J. Parallel Distrib. Comput. 2 (1987), 173-190.
23. 23. Kumar, V. P., and Reisis, D. I. Image computations on meshes with multiple broadcast. IEEE Trans. Pattern Anal. Mach. Intelligence PAMI-11 (1989), 1194-1201.
24. 24. Lee, D. T., and Preparata, F. P. The all nearest neighbor problem for convex polygons. Inform. Process. Lett. 7 (1978), 189-192.
25. 25. Li, H., and Maresca, M. Polymorphic-torus network. IEEE Trans. Comput. C-38 (1989) 1345-1351.
26. 26. Lin, R., Olariu, S., Schwing, J. L., and Zhang, J. Simulating enhanced meshes, with applications. Parallel Process. Lett. 3 (1993), 59-70.
27. 27. Lin, R., Olariu, S., and Schwing, J. L. An efficient VLSI architecture for digital geometry. Proc. of International IEEE Conference on Application-Specific Array Processors. San Francisco, 1994, pp. 392-403.
28. 28. Li, H, and Stout, Q. F. (Eds.). Reconfigurable Massively Parallel Computers. Prentice-Hall, Englewood Cliffs, NJ, 1991.
29. 29. Lu, M. Constructing the Voronoi diagram on a mesh-connected computer. Proc. of the International Conference on Parallel Processing (1985), 806-811.
30. 30. Maresca, M., and Li, H. Connection autonomy and SIMD computers: A VLSI implementation. J. Parallel Distrib. Comput. 7 (1989), 302-320.
31. 31. Miller, R., and Stout, Q. Mesh computer algorithms for computational geometry. IEEE Trans. Comput. 38 (1989), 321-340.
32. 32. Olariu, S., Schwing, J. L., and Zhang, J. Optimal convex hull algorithms on enhanced meshes. BIT 33 (1993), 396-410.
33. 33. Parkinson, D., Hunt, D. J., and MacQueen, K. S. The AMT DAP 500. 33rd IEEE Comp. Soc. International Conf. 1988, pp. 196-199.
34. 34. Pavlidis, T. Computer Graphics. Comput. Sci. Press, Potomac, MD, 1978.
35. 35. Preparata, F. P., and Shamos, M. I. Computational Geometry-An Introduction. Springer-Verlag, Berlin, 1988.
36. 36. Reddaway, S. F., Wilson, A., and Horn, A. Fractal graphics and image compression on a SIMD processor. Proc. 2nd Symp. on Frontiers of Massively Parallel Computation. Fairfax, VA, 1988, pp. 265-274.
37. 37. Quinn, M. J. Parallel Computing: Theory and Practice. McGraw-Hill, New York, 1994.
38. 38. Schieber, B., and Vishkin, U. Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discrete Appl. Math. 39 (1990), 97-111.
39. 39. Toussaint, G. T. (Ed.). Computational Geometry. Eisevier, North-Holland, Amsterdam, 1985.