Sweep methods for parallel computational geometry
From MaRDI portal
Publication:1907233
DOI10.1007/BF01941685zbMath0840.68057MaRDI QIDQ1907233
Publication date: 7 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The contour problem for rectilinear polygons
- Hidden line elimination for isooriented rectangles
- Routing, merging, and sorting on parallel models of computation
- Fractional cascading. I: A data structuring technique
- Time-and space-optimal contour computation for a set of rectangles
- Parallel computational geometry
- Making data structures persistent
- Stabbing line segments
- Finding the intersection of two convex polyhedra
- Searching, Merging, and Sorting in Parallel Computation
- Optimal algorithms to compute the closure of a set of iso-rectangles
- An optimal contour algorithm for iso-oriented rectangles
- Computation of the axial view of a set of isothetic parallelepipeds
- An Efficient Parallel Biconnectivity Algorithm
- Parallel Merge Sort
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Parallel Prefix Computation
- An O(logn) parallel connectivity algorithm
- Parallelism in Comparison Problems
- An optimal algorithm for intersecting line segments in the plane
- The Parallel Evaluation of General Arithmetic Expressions
- A simple parallel tree contraction algorithm
- Finding the contour of a union of iso-oriented rectangies
This page was built for publication: Sweep methods for parallel computational geometry
