Parallel computational geometry

We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries.

[1]  David P. Dobkin,et al.  Finding Extremal Polygons , 1985, SIAM J. Comput..

[2]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[3]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[4]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[5]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[6]  David G. Kirkpatrick,et al.  Parallel processing for efficient subdivision search , 1987, SCG '87.

[7]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[8]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[9]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[12]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[14]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[15]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[16]  Bernard Chazelle,et al.  Triangulation and shape-complexity , 1984, TOGS.

[17]  Victor Klee,et al.  Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.

[18]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[19]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[20]  Anita Liu Chow.  Parallel algorithms for geometric problems , 1980 .

[21]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Geometric Problems , 1985, ICPP.

[22]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[23]  Bernard Chazelle.  Reporting and Counting Segment Intersections , 1986, J. Comput. Syst. Sci..

[24]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[25]  Chee-Keng Yap,et al.  Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[26]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[27]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[28]  Mikhail J. Atallah,et al.  Efficient plane sweeping in parallel , 1986, SCG '86.

[29]  Stephen A. Cook,et al.  Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.

[30]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[31]  Chee-Keng Yap.  What Can be Parallelized in Computational Geometry? , 1987, Parallel Algorithms and Architectures.

[32]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[33]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[34]  S. N. Maheshwari,et al.  Parallel algorithms for the convex hull problem in two dimensions , 1981, CONPAR.

[35]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..

[36]  Bernard Chazelle.  Computational Geometry on a Systolic Chip , 1984, IEEE Transactions on Computers.

[37]  Franco P. Preparata,et al.  Segments, Rectangles, Contours , 1981, J. Algorithms.

[38]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[39]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[40]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[41]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[42]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[43]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[44]  Peter W. Shor,et al.  On the pagenumber of planar graphs , 1984, STOC '84.

[45]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[46]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

[47]  Alok Aggarwal,et al.  An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[48]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.