A practical divide-and-conquer algorithm for the rectangle intersection problem

DOI10.1016/0020-0255(87)90018-1zbMath0636.68081OpenAlexW2088537148MaRDI QIDQ1098308

W. Schilling, Ralf Hartmut Gueting

Publication date: 1987

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(87)90018-1

zbMATH Keywords

VLSI designdivide-and-conquer algorithmrectangle intersection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

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

Cites Work

• Unnamed Item
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• Finding Rectangle Intersections by Divide-and-Conquer
• A new approach to rectangle intersections
• Priority Search Trees
• Batched dynamic solutions to decomposable searching problems

This page was built for publication: A practical divide-and-conquer algorithm for the rectangle intersection problem