Divide-and-conquer in planar geometry

DOI10.1080/00207168608803493zbMath0655.68048OpenAlexW1969431600MaRDI QIDQ3802611

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)

Related Items (1)

Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra

Cites Work

• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• 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
• A new approach to rectangle intersections part I
• Counting and Reporting Intersections of d-Ranges
• The measure problem for rectangular ranges in d-space
• An improved algorithm for the rectangle enclosure problem

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