An optimal time and minimal space algorithm for rectangle intersection problems

DOI10.1007/BF00989481zbMath0534.68048OpenAlexW1971436459MaRDI QIDQ3318126

No author found.

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00989481

zbMATH Keywords

analysis of algorithmscomputational geometrydivide-and-conquerdisjoint set union-findrectangle intersection

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Decomposable searching problems
• A data structure for dynamic range queries
• Algorithms for Reporting and Counting Geometric Intersections
• Comments on “algorithms for reporting and counting geometric intersections”
• An improved algorithm for the rectangle enclosure problem

This page was built for publication: An optimal time and minimal space algorithm for rectangle intersection problems