An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 9, 1997, Pages 983-990

  Nakano, Koji ^a   Olariu, Stephan ^b  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b ECS Building   (United States)

Author keywords

ANN; ARANN; Lower bounds; Mobile computing; Proximity problems; Reconfigurable mesh

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; IMAGE PROCESSING; MATHEMATICAL MODELS; MATHEMATICAL MORPHOLOGY; OPTIMIZATION; PATTERN RECOGNITION; PROBLEM SOLVING;

GEOGRAPHIC NEIGHBORHOOD GRAPH; NEAREST NEIGHBOR PROBLEM; PROXIMITY PROBLEMS; RECONFIGURABLE MESH; RELATIVE NEIGHBORHOOD GRAPH;

ALGORITHMS;

EID: 0031234989     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.615443     Document Type: Article

References (25)

1. Y. Ben-Asher, D. Peleg, R. Ramaswani, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, vol. 13, pp. 139-153, 1991.
2. L.P. Chew and R.L. Drysdale, "Voronoi Diagrams Based on Convex Functions," Proc. First ACM Symp. Computational Geometry, pp. 235-244, 1985.
3. R. Cole and M.T. Goodrich, "Optimal Parallel Algorithms for Point-Set and Polygon Problems," Algorithmica, vol. 7, pp. 3-23, 1992.
4. R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: Wiley and Sons, 1973.
5. J. Jang and V.K. Prasanna, "Parallel Geometric Problems on the Reconfigurable Mesh," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 127-130, St. Charles, Ill., 1992.
6. J. Jang and V.K. Prasanna, "An Optimal Sorting Algorithm on Reconfigurable Meshes," Proc. Int'l Parallel Processing Symp., pp. 130-137, 1992,.
7. J. Katajainen and O. Nevalainen, "Computing Relative Neighborhood Graphs in the Plane," Pattern Recognition, vol. 19, pp. 221-228, 1986.
8. H. Li and M. Maresca, "Polymorphic-Torus Network," IEEE Trans. Computers, vol. 38, pp. 1,345-1,351, 1989.
9. R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching - Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 93-102, 1995.
10. R. Lin, S. Olariu, J. L. Schwing, and J. Zhang, "Sorting in O(1) Time on a Reconfigurable Mesh of Size N x N," Parallel Computing: From Theory to Sound Practice, Proc. EWPC '92, pp. 16-27, Plenary Address. Amsterdam: IOS Press, 1992.
11. M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490-506, 1993.
12. M. Maresca and H. Li, "Connection Autonomy in SIMD Computers: A VLSI Implementation," J. Parallel and Distributed Computing, vol. 7, pp. 302-320, 1989.
13. R. Miller, V.K.P. Kumar, D. Reisis, and Q.F. Stout, "Parallel Computations on Reconfigurable Meshes," IEEE Trans. Computers, vol. 42, pp. 678-692, 1993.
14. M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Mesh with Buses," Proc. Seventh Int'l Parallel Proc. Symp., pp. 174-181, Apr. 1993.
15. S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Data Movement on Reconfigurable Meshes," Int'l J. High Speed Computing, vol. 6, pp. 311-323, 1994.
16. S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Ann. Allerton Conf. Comm., Control, and Computing, pp. 811-820, 1991.
17. S. Olariu and I. Stojmenovic, "Time-Optimal Proximity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 36, pp. 144-155, 1996.
18. F.P. Preparata and M.I. Shamos, Computational Geometry - An Introduction. Berlin: Springer-Verlag, 1990.
19. J. Rothstein, "Bus Automata, Brains, and Mental Models," IEEE Trans. Systems, Man, and Cybernetics, vol. 18, pp. 522-531, 1988.
20. D.B. Shu and J.G. Nash, "The Gated Interconnection Network for Dynamic Programming," Concurrent Computations, S.K. Tewsburg et al., eds. Plenum Publishing, 1988.
21. K.J. Supowit, "The Relative Neighborhood Graph with an Application to Minimum Spanning Trees," J. ACM, vol. 30, pp. 428-448, 1983.
22. G.T. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set," Pattern Recognition, vol. 12, pp. 261-268, 1980.
23. G.T. Toussaint, "The Symmetric All-Furthest Neighbor Problem," Computers and Mathematics with Applications, vol. 9, pp. 747-754, 1983.
24. B.F. Wang and G.H. Chen, "Constant Time Algorithms for the Transitive Closure Problem and its Applications," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 500-507, 1990.
25. C.C. Weems, S.P. Levitan, A.R. Hanson, E.M. Riseman, J.G. Nash, and D.B. Sheu, "The Image Understanding Architecture," Int'l J. Computer Vision, vol. 2, pp. 251-282, 1989.