Parallel computational geometry of rectangles
From MaRDI portal
Publication:1187198
DOI10.1007/BF01758750zbMath0764.68168MaRDI QIDQ1187198
David M. Mount, Sung Kwon Kim, Sharat Chandran
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W15: Distributed algorithms
Related Items
The equivalence of the chessboard distance transform and the medial axis transform∗, Medial axis transform on mesh-connected computers with hyperbus broadcasting, Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems, EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
Cites Work
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
- Fractional cascading. I: A data structuring technique
- Parallel computational geometry
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- The measure problem for rectangular ranges in d-space
- On the complexity of computing the measure of ∪[a i ,b i ]
- Finding the contour of a union of iso-oriented rectangies
- Unnamed Item
- Unnamed Item
- Unnamed Item