Parallel algorithms for arrangements

DOI10.1007/BF01941684zbMath0836.68050OpenAlexW2142561263MaRDI QIDQ1907232

Erik Brisson, P. W. Beame, Richard J. Anderson

Publication date: 20 February 1996

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

incremental algorithmsarrangement problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (2)

Parallel algorithms for arrangements ⋮ Constructing arrangements optimally in parallel

Cites Work

• Unnamed Item
• Unnamed Item
• The power of geometric duality
• Parallel computational geometry
• Making data structures persistent
• Parallel algorithms for arrangements
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Cylindrical Algebraic Decomposition I: The Basic Algorithm

This page was built for publication: Parallel algorithms for arrangements