Parallel algorithms for arrangements

DOI10.1007/BF01941684MaRDI QIDQ1907232zbMATH OpenOpenAlexFDO

Authors Paul Beame, Erik Brisson, 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)

Recommendations

• Constructing arrangements optimally in parallel
• Parallel algorithms for separable permutations
• Publication:3033316
• scientific article; zbMATH DE number 4039280
• Parallel algorithms
• Parallel algorithms
• scientific article; zbMATH DE number 3889284
• scientific article; zbMATH DE number 4037239
• Parallel algorithms for partitioning sorted sets and related problems

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• 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
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Making data structures persistent
• Parallel algorithms for arrangements
• Parallel computational geometry
• The power of geometric duality

Cited in

(15)

• Parallel algorithms for evaluating sequences of set-manipulation operations
• Parallel ordering using edge contraction
• scientific article; zbMATH DE number 5307920 (Why is no real title available?)
• Constructing arrangements optimally in parallel
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• Taking a walk in a planar arrangement
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• scientific article; zbMATH DE number 4060711 (Why is no real title available?)
• Parallel algorithms for separable permutations
• RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
• Reordering for parallelism
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Parallel algorithms for the segment dragging problem
• Parallel methods for solving fundamental file rearrangement problems
• Parallel algorithms for arrangements

This page was built for publication: Parallel algorithms for arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907232)