Constructing arrangements optimally in parallel
type: Item
instance of: scholarly article
title: Constructing arrangements optimally in parallel
zbMATH Open document ID: 0788.68142
DOI: 10.1007/BF02189329
author: Michael T. Goodrich
published in: Discrete \& Computational Geometry
publication date: 1993-06-16T00:00:00Z
full work available at URL: https://eudml.org/doc/131253
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 203062
zbMATH Keywords: parallel algorithms
zbMATH Keywords: arrangement
zbMATH Keywords: parallel computational geometry
zbMATH Keywords: CREW PRAM
MaRDI profile type: Publication
cites work: Partitioning arrangements of lines. II: Applications
cites work: Q3359790
cites work: Parallel computational geometry
cites work: Parallel algorithms for arrangements
cites work: Q3798228
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
cites work: Routing, merging, and sorting on parallel models of computation
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Reporting and counting segment intersections
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: The power of geometric duality
cites work: New applications of random sampling in computational geometry
cites work: RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
cites work: Parallel Merge Sort
cites work: Q3772828
cites work: Topologically sweeping an arrangement
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Q4023519
cites work: Q4385522
cites work: Searching, Merging, and Sorting in Parallel Computation
cites work: Parallel Prefix Computation
cites work: Q3992847
cites work: Line-segment intersection reporting in parallel
cites work: On uniform circuit complexity
cites work: Finding the maximum, merging, and sorting in a parallel computation model
description: scientific article; zbMATH DE number 203062