Computational geometry: an introduction
Computational geometry: an introduction
Mesh Computer Algorithms for Computational Geometry
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
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Discrete Applied Mathematics
Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Constant-time convexity problems on reconfigurable meshes
Journal of Parallel and Distributed Computing
Efficient parallel algorithms for some graph problems
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
Fast Computer Vision Algorithms for Reconfigurable Meshes
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
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
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
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Constant time algorithms for the 3-d all nearest neighbor problem on the LARPBS
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
| Hi-index | 0.00 |
A reconfigurable mesh, R-mesh for short, is a two-dimensional array of processors connected by a grid-shaped reconfigurable bus system. Each processor has four I/O ports that can be locally connected during execution of algorithms. This paper considers the d-dimensional Euclidean Minimum Spanning Tree (EMST) and the All Nearest Neighbors (ANN) problem. Two results are reported. First, we show that a minimum spanning tree of n points in a fixed d-dimensional space can be constructed in O(1) time on a $\sqrt {n^3}\times \sqrt {n^3}$ R-mesh. Second, all nearest neighbors of n points in a fixed d-dimensional space can be constructed in O(1) time on an n脳n R-mesh. There is no previous O(1) time algorithm for the EMST problem; ours is the first such algorithm. A previous R-mesh algorithm exists for the two-dimensional ANN problem; we extend it to any d-dimensional space. Both of the proposed algorithms have a time complexity independent of n but growing with d. The time complexity is O(1) if d is a constant.