Finding Rectangle Intersections by Divide-and-Conquer
From MaRDI portal
Publication:3323293
DOI10.1109/TC.1984.5009341zbMath0537.68072MaRDI QIDQ3323293
Derick Wood, Ralf Hartmut Gueting
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
computational geometry; points; line segments; rectangles; pairwise intersections; divide-and-conquer algorithms
68R99: Discrete mathematics in relation to computer science
Related Items
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles, 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, Divide-and-conquer in planar geometry