Line-segment intersection reporting in parallel

DOI10.1007/BF01758839zbMath0753.68095OpenAlexW2028060421MaRDI QIDQ1193518

Christine Rüb

Publication date: 27 September 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758839

zbMATH Keywords

CREW PRAMsegment tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (2)

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

This page was built for publication: Line-segment intersection reporting in parallel