Optimal parallel algorithms for point-set and polygon problems
From MaRDI portal
Publication:1187196
DOI10.1007/BF01758749zbMath0764.68171MaRDI QIDQ1187196
Michael T. Goodrich, Richard John Cole
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W15: Distributed algorithms
Related Items
Finding the Convex Hull of Discs in Parallel, COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET, CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS, A sublogarithmic convex hull algorithm, A nearly parallel algorithm for the Voronoi diagram of a convex polygon, Parallel solutions to geometric problems in the scan model of computation, Recursion and parallel algorithms in geometric modeling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comments on the all nearest-neighbor problem for convex polygons
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Parallel algorithms for some functions of two convex polygons
- Finding the convex hull of a sorted point set in parallel
- Parallel computational geometry
- The all nearest-neighbor problem for convex polygons
- A note on the all nearest-neighbor problem for convex polygons
- Finding the intersection of n half-spaces in time O(n log n)
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Parallel Merge Sort
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Triangulating a polygon in parallel
