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

DOI10.1007/BF00264251MaRDI QIDQ790614zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3846893
• Divide-and-conquer in planar geometry
• An optimal contour algorithm for iso-oriented rectangles
• The contour problem for rectilinear polygons
• Time-and space-optimal contour computation for a set of rectangles

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Algorithms for Reporting and Counting Geometric Intersections
• An optimal contour algorithm for iso-oriented rectangles
• Finding Rectangle Intersections by Divide-and-Conquer
• Finding the contour of a union of iso-oriented rectangies
• Optimal algorithms to compute the closure of a set of iso-rectangles

Cited in

(10)

• Time-and space-optimal contour computation for a set of rectangles
• Parallel computational geometry of rectangles
• A practical divide-and-conquer algorithm for the rectangle intersection problem
• Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
• On the parallel-decomposability of geometric problems
• An optimal contour algorithm for iso-oriented rectangles
• Finding Rectangle Intersections by Divide-and-Conquer
• Divide-and-conquer in planar geometry
• scientific article; zbMATH DE number 3846893 (Why is no real title available?)
• The contour problem for rectilinear polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790614)