Line-segment intersection reporting in parallel
From MaRDI portal
Publication:1193518
DOI10.1007/BF01758839zbMath0753.68095MaRDI QIDQ1193518
Publication date: 27 September 1992
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01758839
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W15: Distributed algorithms
Related Items
Parallel methods for visibility and shortest-path problems in simple polygons, Constructing arrangements optimally in parallel
Cites Work
- Unnamed Item
- Fractional cascading. I: A data structuring technique
- Parallel computational geometry
- Reporting and counting segment intersections
- Searching, Merging, and Sorting in Parallel Computation
- Algorithms for Reporting and Counting Geometric Intersections
- Parallel Merge Sort
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Parallel Prefix Computation
- An optimal algorithm for intersecting line segments in the plane