Parallel algorithms for arrangements
From MaRDI portal
Publication:1907232
DOI10.1007/BF01941684zbMATH Open0836.68050OpenAlexW2142561263MaRDI QIDQ1907232FDOQ1907232
Erik Brisson, Paul 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
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The power of geometric duality
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Making data structures persistent
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel computational geometry
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Parallel algorithms for arrangements
Cited In (15)
- Parallel algorithms for evaluating sequences of set-manipulation operations
- Parallel ordering using edge contraction
- Title not available (Why is that?)
- Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
- Constructing arrangements optimally in parallel
- Taking a walk in a planar arrangement
- Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
- Title not available (Why is that?)
- 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)
