Finding Rectangle Intersections by Divide-and-Conquer

DOI10.1109/TC.1984.5009341MaRDI QIDQ3323293zbMATH OpenFDO

Authors Ralf Hartmut Gueting, D. Wood

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

computational geometryline segmentspointsrectanglespairwise intersectionsdivide-and-conquer algorithms

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• An optimal time and minimal space algorithm for rectangle intersection problems
• Divide-and-conquer in planar geometry
• scientific article; zbMATH DE number 3846893
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• Reporting Intersections of Polygons

Cited in

(7)

• A modified DIviding RECTangles algorithm for a problem in astrophysics
• 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
• Finding Interferences Between Rectangular Paths
• An optimal time and minimal space algorithm for rectangle intersection problems
• Divide-and-conquer in planar geometry
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles

This page was built for publication: Finding Rectangle Intersections by Divide-and-Conquer

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