An optimal time and minimal space algorithm for rectangle intersection problems
From MaRDI portal
Publication:3318126
DOI10.1007/BF00989481zbMath0534.68048MaRDI QIDQ3318126
No author found.
Publication date: 1984
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
analysis of algorithms; computational geometry; divide-and-conquer; disjoint set union-find; rectangle intersection
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
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