Computational geometry: an introduction
Computational geometry: an introduction
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
On communication latency in PRAM computations
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient routing and message bounds for optimal parallel algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Convex Hull Algorithm on Coarse-Grained Multiprocessors
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Efficient computation of continuous skeletons
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Parallel algorithms for higher-dimensional convex hulls
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
| Hi-index | 0.01 |
We present a randomized parallel algorithm for the Voronoi diagram of line segments on coarse grained parallel machines, which, for any input of n line segments on P processors (n= O (P3 +), for any 0) requires (with high probability) O([n log n/P]) local operations, O(n/P) global-operations (or messages) per processor, O(1) levels of global data dependency (or O(1) communication phases). This generic parallel algorithm can be transformed to the CRCW PRAM model in O(log n) time with O(n) processors and thus provides a different solution from, and conceptually much simpler than, that of [RR].