Parallel computational geometry of rectangles

DOI10.1007/BF01758750zbMath0764.68168MaRDI QIDQ1187198

David M. Mount, Sharat Chandran, Sung Kwon Kim

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computer visionmedial axis transformpicture processingorthogonal plane-sweep

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (4)

Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems ⋮ Medial axis transform on mesh-connected computers with hyperbus broadcasting ⋮ The equivalence of the chessboard distance transform and the medial axis transform^∗ ⋮ EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Parallel computational geometry of rectangles