Parallel solutions to geometric problems in the scan model of computation
DOI10.1016/S0022-0000(05)80023-6zbMath0802.68059OpenAlexW2019403731MaRDI QIDQ1318471
Guy E. Blelloch, James J. Little
Publication date: 11 December 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80023-6
parallel algorithmsconnection machinegeometric problemsdivide-and-conquer algorithmsCREWCole's merge sortscan modelsegment abstractionvector model of computation
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel computational geometry
- Maintenance of configurations in the plane
- Optimal parallel algorithms for point-set and polygon problems
- A characterization of the power of vector machines
- Two remarks on a convex hull algorithm
- On the identification of the convex hull of a finite set of points in the plane
- A taxonomy of problems with fast parallel algorithms
- Parallel Merge Sort
- Efficient parallel convex hull algorithms
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Ultracomputers
- A universal interconnection pattern for parallel computers
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Universal circuits (Preliminary Report)
- On Relating Time and Space to Size and Depth
- The Parallel Evaluation of General Arithmetic Expressions
- Parallelism in random access machines
This page was built for publication: Parallel solutions to geometric problems in the scan model of computation
