A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
From MaRDI portal
Publication:1894952
DOI10.1016/0898-1221(95)00029-XzbMath0939.68504OpenAlexW2043832401MaRDI QIDQ1894952
Publication date: 6 July 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(95)00029-x
Related Items (6)
Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Unnamed Item ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Read Mapping on Genome Variation Graphs ⋮ Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for the largest empty rectangle problem
- On the maximum empty rectangle problem
- On a circle placement problem
- Optimal solutions for a class of point retrieval problems
- Efficient worst-case data structures for range searching
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- New upper bounds for neighbor searching
- Computing the Largest Empty Rectangle
- Filtering Search: A New Approach to Query-Answering
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- An improved algorithm for the rectangle enclosure problem
- Multidimensional binary search trees used for associative searching
This page was built for publication: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
