Parallel geometric algorithms on mesh-connected computers

Authors:
C.-S. Jeong;T. D. Lee
Affiliations:
Dept. of Computer Science, Pohang Institute of Technology, P.O. Box 125, Pohang 680, Korea;Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois
Venue:
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Year:
1987

Citing 6
Cited 0

An optimal routing algorithm for mesh-connected Parallel computers

Journal of the ACM (JACM)
Two-Dimensional Voronoi Diagrams in the Lp-Metric

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM
Intersecting is easier than sorting

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for geometric problems

Parallel algorithms for geometric problems
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a number of geometric problems can be solved on a \trn x \trn mesh connected computer(MCC) in 0(\trn) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires \gW(\trn) time. The problems studied here include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, Voronoi diagram, the largest empty circle, the smallest enclosing circle, etc. The 0(\trn) algorithms for all of the above problems are based on the classical divide-and-conquer problem solving strategy.