Constructing arrangements optimally in parallel
From MaRDI portal
Publication:1802221
DOI10.1007/BF02189329zbMath0788.68142MaRDI QIDQ1802221
Publication date: 16 June 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131253
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Partitioning arrangements of lines. II: Applications
- Routing, merging, and sorting on parallel models of computation
- The power of geometric duality
- \(\epsilon\)-nets and simplex range queries
- Parallel computational geometry
- Topologically sweeping an arrangement
- On uniform circuit complexity
- Line-segment intersection reporting in parallel
- New applications of random sampling in computational geometry
- Reporting and counting segment intersections
- Parallel algorithms for arrangements
- Searching, Merging, and Sorting in Parallel Computation
- Algorithms for Reporting and Counting Geometric Intersections
- Constructing Arrangements of Lines and Hyperplanes with Applications
- 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
- Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
- An optimal algorithm for intersecting line segments in the plane
- The Parallel Evaluation of General Arithmetic Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing arrangements optimally in parallel
