
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Koji Nakano, Stephan Olariu, "An Optimal Algorithm for the AngleRestricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 9, pp. 983990, September, 1997.  
BibTex  x  
@article{ 10.1109/71.615443, author = {Koji Nakano and Stephan Olariu}, title = {An Optimal Algorithm for the AngleRestricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {9}, issn = {10459219}, year = {1997}, pages = {983990}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.615443}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Optimal Algorithm for the AngleRestricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications IS  9 SN  10459219 SP983 EP990 EPD  983990 A1  Koji Nakano, A1  Stephan Olariu, PY  1997 KW  Reconfigurable mesh KW  lower bounds KW  proximity problems KW  ANN KW  ARANN KW  mobile computing. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given a set
[1] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[2] L.P. Chew and R.L. Drysdale, "Voronoi Diagrams Based on Convex Functions," Proc. First ACM Symp. Computational Geometry, pp. 235244, 1985.
[3] R. Cole and M.T. Goodrich, "Optimal Parallel Algorithms for PointSet and Polygon Problems," Algorithmica, vol. 7, pp. 323, 1992.
[4] R. Duda, P. Hart, and D. Stork, Pattern Classification. New York: John Wiley&Sons, 2001.
[5] J. Jang and V.K. Prasanna, "Parallel Geometric Problems on the Reconfigurable Mesh," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 127130,St. Charles, Ill., 1992.
[6] J. Jang and V.K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,” Proc. Int’l Parallel Processing Symp., pp. 130137, Mar. 1992.
[7] J. Katajainen and O. Nevalainen, "Computing Relative Neighborhood Graphs in the Plane," Pattern Recognition, vol. 19, pp. 221228, 1986.
[8] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[9] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, Jan. 1995.
[10] R. Lin, S. Olariu, J. L. Schwing, and J. Zhang, "Sorting in O(1) Time on a Reconfigurable Mesh of Size N×N," Parallel Computing: From Theory to Sound Practice, Proc. EWPC '92, pp. 1627, Plenary Address. Amsterdam: IOS Press, 1992.
[11] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[12] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[13] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[14] M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Meshes With Buses," Proc. Int'l Parallel Processing Symp., pp. 174181, 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. 311323, 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. 811820, 1991.
[17] S. Olariu and I. Stojmenovic, "TimeOptimal Proximity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 36, pp. 144155, 1996.
[18] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[19] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522531, Apr. 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.L. Supowit,“The relative neighborhood graph with an application to minimum spanning trees,” J. ACM, vol. 30, pp. 428448, 1983.
[22] G.T. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set," Pattern Recognition, vol. 12, pp. 261268, 1980.
[23] G.T. Toussaint, "The Symmetric AllFurthest Neighbor Problem," Computers and Mathematics with Applications, vol. 9, pp. 747754, 1983.
[24] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500507, 1991.
[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. 251282, 1989.