Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Parallel processing for efficient subdivision search
SCG '87 Proceedings of the third annual symposium on Computational geometry
A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Parallel construction of subdivision hierarchies
Journal of Computer and System Sciences
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Merging free trees in parallel for efficient Voronoi diagram construction
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Parallel implementation of 3D convex-hull algorithm
Computer-Aided Design
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
An efficient expected time parallel algorithm for Voronoi construction
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An NC parallel 3D convex hull algorithm
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
A simple Voronoi diagram algorithm for a reconfigurable mesh
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
The implementation of 2D FFT using multiple topology on 4 × 4 torus
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
| Hi-index | 0.00 |
In this paper, we introduce a simple and efficient algorithm for computing the Voronoi Diagram for n planar points on a reconfigurable mesh of size O(n) 脳O(n). The algorithm has a worst case running of O(log n log log n) time. The algorithm exploits the O(1) communication diameter of the reconfigurable mesh model to implement efficient load balancing.