Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors

DOI10.1137/0220047zbMath0736.68034OpenAlexW2043380199MaRDI QIDQ3978177

Michael T. Goodrich

Publication date: 25 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220047

zbMATH Keywords

CREW PRAMline-segment intersectionparallel data structures

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

Planar stage graphs: Characterizations and applications ⋮ Optimal shooting: Characterizations and applications ⋮ Edge intersection on the hypercube computer ⋮ EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* ⋮ Constructing arrangements optimally in parallel