Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles

DOI10.1007/BF00264251zbMath0534.68031OpenAlexW2294023352MaRDI QIDQ790614

Ralf Hartmut Gueting

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264251

zbMATH Keywords

computational geometryrectanglesdivide-and-conquer algorithmcontour problemmeasure problemorthogonal planer objectsseparational representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

A practical divide-and-conquer algorithm for the rectangle intersection problem ⋮ Time-and space-optimal contour computation for a set of rectangles ⋮ Divide-and-conquer in planar geometry ⋮ Parallel computational geometry of rectangles ⋮ On the parallel-decomposability of geometric problems ⋮ Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra ⋮ The contour problem for rectilinear polygons

Cites Work

• Unnamed Item
• Algorithms for Reporting and Counting Geometric Intersections
• Finding Rectangle Intersections by Divide-and-Conquer
• Optimal algorithms to compute the closure of a set of iso-rectangles
• An optimal contour algorithm for iso-oriented rectangles
• Finding the contour of a union of iso-oriented rectangies

This page was built for publication: Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles