Issue No. 01 - January (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.569648
<p><b>Abstract</b>—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 <it>O</it>(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 <it>N</it> planar points as input and employ an <it>N</it>×<it>N</it> reconfigurable mesh. The basic scheme employed in our implementations is to recursively find an <it>O</it>(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.</p>
M. Nigam, S. Sahni, J. Jang and V. K. Prasanna, "Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1-12, 1997.