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

DOI10.1016/0020-0255(87)90018-1MaRDI QIDQ1098308zbMATH OpenOpenAlexFDO

Authors 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

divide-and-conquer algorithmrectangle intersection problemVLSI design

Mathematics Subject Classification ID

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

Cites work

• A new approach to rectangle intersections
• Batched dynamic solutions to decomposable searching problems
• Finding Rectangle Intersections by Divide-and-Conquer
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• Priority Search Trees

Cited in

(1)

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

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

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