Divide-and-conquer in planar geometry

DOI10.1080/00207168608803493MaRDI QIDQ3802611zbMATH OpenOpenAlexFDO

Authors Ralf Hartmut Gueting

Publication date 1986

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168608803493

zbMATH Keywords

computational geometrydivide-and-conquergeometric algorithmplanar geometrycontour problemmeasure problemline segment intersection problemline-sweep

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Recommendations

• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• scientific article; zbMATH DE number 3846893
• Finding Rectangle Intersections by Divide-and-Conquer
• Topologically sweeping an arrangement
• A fast planar partition algorithm. I

Cites work

• A new approach to rectangle intersections part I
• Algorithms for Reporting and Counting Geometric Intersections
• An improved algorithm for the rectangle enclosure problem
• An optimal contour algorithm for iso-oriented rectangles
• Counting and Reporting Intersections of d-Ranges
• Finding Rectangle Intersections by Divide-and-Conquer
• Optimal algorithms to compute the closure of a set of iso-rectangles
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• The measure problem for rectangular ranges in d-space

Cited in

(6)

• Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
• Finding Rectangle Intersections by Divide-and-Conquer
• Division of a set of segments into nonintersecting parts on a discrete plane
• Space-efficient geometric divide-and-conquer algorithms
• scientific article; zbMATH DE number 3846893 (Why is no real title available?)
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles

This page was built for publication: Divide-and-conquer in planar geometry

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