Computational geometry: an introduction
Computational geometry: an introduction
An O(log n) time parallel algorithm for triangulating a set of points in the plane
Information Processing Letters
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Mesh Computer Algorithms for Computational Geometry
IEEE Transactions on Computers
Parallel computations on meshes with static and reconfiguarble buses
Parallel computations on meshes with static and reconfiguarble buses
IEEE Transactions on Computers
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Journal of Parallel and Distributed Computing
Fast computer vision algorithms for reconfigurable meshes
Image and Vision Computing
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Constant-time convexity problems on reconfigurable meshes
Journal of Parallel and Distributed Computing
An optimal sorting algorithm on reconfigurable mesh
Journal of Parallel and Distributed Computing
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Histogramming on a Reconfigurable Mesh Computer
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
An Efficient Convex Hull Computation on the Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Computational Geometry on a Reconflgurable Mesh
Proceedings of the 8th International Symposium on Parallel Processing
Shift switching and novel arithmetic schemes
ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Constant Time Dynamic Programming on Directed Reconfigurable Networks
IEEE Transactions on Parallel and Distributed Systems
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
Three-Dimensional Layers of Maxima
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences - Special issue on bioinformatics II
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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.