This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
January 1997 (vol. 8 no. 1)
pp. 1-12

Abstract—The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: all-pairs nearest neighbors, convex hull, triangulation, two-dimensional maxima, two-set dominance counting, and smallest enclosing box. All these solutions accept N planar points as input and employ an N×N reconfigurable mesh. The basic scheme employed in our implementations is to recursively find an O(1) time solution. The number of recursion levels and the size of the subproblems at each level of recursion are optimized such that the problem decomposition and the solution to the problem can be obtained in constant time. As a result, we have developed some efficient merge techniques to combine the solutions for subproblems on the reconfigurable mesh. These techniques exploit reconfigurability in nontrivial ways leading to constant time solutions using optimal size of the mesh.

[1] Y. Ben-Asher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, Oct. 1991.
[2] Y. Ben-Asher and A. Schuster, "Optical Splitting Graphs," Proc. Int'l Topical Meeting on Optical Computing,Kobe, Japan, 1990.
[3] Y. Ben-Asher, D. Gordon, and A. Schuster, "Optimal Simulations in Reconfigurable Arrays," Technical Report #716, Computer Science Dept., Technion—Israel Inst. of Tech nology, Feb. 1992.
[4] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "Constant Time Convexity Problems on Dense Reconfigurable Meshes," J. Parallel and Distributed Computing, vol. 27, pp. 86-99, 1995.
[5] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "Constant-Time Triangulation Problems on Reconfigurable Meshes," Proc. Application Specific Array Processor, pp. 357-368,San Francisco, Aug. 1994.
[6] R. Cole and U. Vishkin, "Approximate Coin Tossing with Applications to List, Tree and Graph problems," Proc. IEEE Symp. Foundations of Computer Science, pp. 478-491, 1986.
[7] H. Elgindy and P. Wegrowicz, "Selection on the Reconfigurable Mesh," Proc. Int'l Conf. Parallel Processing, pp. III.26-III.33, Aug. 1991.
[8] H. Freeman and R. Shapira, "Determining the Minimal-Area Encasing Rectangle for an Arbitrary Closed Curve," Comm. ACM, vol. 18, pp. 409-413, 1975.
[9] E. Hao, P.D. MacLenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 38-45, 1992.
[10] J. Jang and V.K. Prasanna, ”An Optimal Sorting Algorithm on Reconfigurable Mesh,“ J. Parallel and Distributed Computing, vol. 25, pp. 31-41, 1995.
[11] J. Jang and V.K. Prasanna, "Efficient Parallel Algorithms for Some Geometric Problems on Reconfigurable Mesh," Proc. Int'l Conf. Parallel Processing, pp. III.127-III.130, Aug. 1992.
[12] J. Jang, H. Park, and V.K. Prasanna, "A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 97-106, Feb. 1995.
[13] J. Jang,H. Park,, and V. K. Prasanna,“An optimal multiplication algorithm on reconfigurable mesh,” Proc. Symp. Parallel and Distributed Processing, pp. 384-391, 1992.
[14] J. Jang, V.K. Prasanna, and H. Park, "A Bit Model of Reconfigurable Mesh," Proc. Reconfigurable Architectures Workshop, IPPS '94,Cancun, Mexico, Apr. 1994.
[15] J. Jenq and S. Sahni,“Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching,” Proc. Int’l Parallel Processing Symp., pp. 208-215, 1991.
[16] J. Jenq and S. Sahni,“Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching,” Proc. Int’l Parallel Processing Symp., pp. 208-215, 1991.
[17] J. Jenq and S. Sahni,“Histogramming on a reconfigurable mesh computer,” Proc. Int’l Parallel Processing Symp., pp. 425-432, 1992.
[18] J. Levinson, I. Kuroda, and T. Nishitani, "A Reconfigurable Processor Array with Routing LSIs and General Purpose DSPs," Proc. Int'l Conf. Application Specific Array Processors, Oct. 1992.
[19] H. Li and M. Maresca,“Polymorphic-torus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 1345-1351, Sept. 1989.
[20] R. Lin, "Shift Switching and Novel Arithmetic Schemes," Proc. 29th Asilomar Conf. Signals, Systems, and Computers, pp. 580-585,Pacific Grove, Calif., Nov. 1995.
[21] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93-102, Jan. 1995.
[22] R. Lin, S. Olariu, J. Schwing, and J. Zhang, "A VLSI-Optimal Constant Time Sorting on Reconfigurable Mesh," Proc. Ninth European Workshop Parallel Computing, pp. 1-16,Spain, 1992.
[23] P.D. MacKenzie and Q. Stout,“Asymptotically efficient hypercube algorithms for computationalgeometry,” Proc. Third Symp. the Frontiers of Massively Parallel Computation, pp. 8-11, 1990.
[24] R. Miller,V.K. Prasanna Kumar,D.I. Reisis,, and Q.F. Stout,“Meshes with reconfigurable buses,” MIT Conf. on Advanced Research in VLSI, pp. 163-178, 1988.
[25] R. Miller and Q.F. Stout, "Mesh Computer Algorithms for Computational Geometry," IEEE Transactions on Computers, vol. 38, no. 3, pp. 321-340, Mar. 1989.
[26] R. Miller, V.K. Prasanna Kumar, D. Reisis, and Q.F. Stout, "Image Computations on Reconfigurable Mesh," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 925-930, 1988.
[27] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[28] K. Nakano, T. Msuzawa, and N. Tokura, "A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array," Inst. of Electronics, Information, and Communication Engineers, vol. E-74, no. 11, pp. 3,894-3,901, Nov. 1991.
[29] M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Meshes With Buses," Proc. Int'l Parallel Processing Symp., pp. 174-181, 1993.
[30] M. Nigam and S. Sahni, "Computational Geometry on a Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 86-93, 1994.
[31] M. Nigam and S. Sahni, "Triangulation on a Reconfigurable Mesh with Buses," Proc. Int'l Conf. Parallel Processing, pp. 251-257, 1994.
[32] S. Olariu,J.L. Schwing,, and J. Zhang,“Fast computer vision algorithms for reconfigurable meshes,” Image and Vision Computing, pp. 610-616, 1992.
[33] S. Olariu, J.L. Schwing, and J. Zhang, "Time-Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396-410, 1993.
[34] H. Park, V.K. Prasanna, and J. Jang, "Fast Arithmetic on Reconfigurable Meshes," Proc. Int'l Conf. Parallel Processing, Aug. 1993.
[35] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[36] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[37] D.I. Reisis, "Parallel Computations on Meshes with Static and Reconfigurable Buses," PhD Thesis, Dept. of EE-Systems, Univ. of Southern California, May 1989.
[38] D.I. Reisis, "An Efficient Convex Hull Computation on the Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 142-145, Mar. 1992.
[39] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522-531, Apr. 1988.
[40] D.B. Shu, L.W. Chow, J.G. Nash, and C.C. Weems, "A Content Addressable Array Parallel Processor," Proc. IEEE Workshop VLSI Signal Processing III, R.W. Brodersen and H.S. Moscovitz, eds., pp. 120-128.New York: IEEE CS Press, 1988.
[41] L. Snyder, "Introduction to the Configurable Highly Parallel Computer," Computer, vol. 15, no. 1, pp. 47-56, Jan. 1982.
[42] Q.F. Stout, "Meshes with Multiple Buses," Proc. IEEE Conf. Foundations of Computer Science, pp. 264-272, Oct. 1986.
[43] C. Subbaraman, J.L. Trahan, and R. Vaidyanathan, "List Ranking and Graph Algorithms on the Reconfigurable Multiple Bus Machine," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 244-247,St. Charles, Ill., Aug. 1993.
[44] R.K. Thiruchelvan,J.L. Trahan,, and R. Vaidyanathan,“On the Power of Segmenting and Fusing Buses,” Proc. of Int’l Parallel Processing Symp., pp. 79-83, Apr. 1993.
[45] J.L. Trahan, R. Vaidyanathan, and C.P. Subbaraman, "Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 214-217,St. Charles, Ill., Aug. 1994.
[46] B.F. Wang,G.H. Chen,, and F.C. Lin,“Constant time sorting on a processor array with a reconfigurable bus systems,” Information Processing Letters, vol. 34, pp. 187-192, 1990.
[47] 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. 500-507, 1991.
[48] B.F. Wang, G.H. Chen, and H. Li, "Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems," Proc. Int'l Conf. Parallel Processing, pp. III. 42-49, Aug. 1991.
[49] C.A. Wang and Y.H. Tsin, "An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane," Information Processing Letters, vol. 25, pp. 55-60, Apr. 1987.
[50] C.C. Weems and J.H. Burrill, "The Image Understanding Architecture and Its Programming Environment," Parallel Architectures and Algorithms for Image Understanding, V.K. Prasanna Kumar, ed. Academic Press, 1991.

Citation:
Ju-wook Jang, Madhusudan Nigam, Viktor K. Prasanna, Sartaj Sahni, "Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 1, pp. 1-12, Jan. 1997, doi:10.1109/71.569648
Usage of this product signifies your acceptance of the Terms of Use.