The grid placement problem (2001) [2 citations — 0 self]
Download:
|
|
by P. Bose, A. Maheshwari, P. Morin, J. Morrison
Proceedings of the 7th Annual Workshop on Algorithms and Data Structures
http://www.scs.carleton.ca/~morin/publications/gis/grid-submitted.ps
Add To MetaCart
Abstract:
We consider the problem of placing a regular grid over a set of points in order to minimize (or maximize) the number of grid cells not containing any points. We give an O(n log n) time and O(n) space algorithm for this problem. As part of this algorithm we develop a new data structure for solving a problem on intervals that is interesting in its own right and may have other applications. 1
Citations
| 428 | Computational Geometry – Shamos - 1978 |
| 12 | The measure problem for rectangular ranges in d-space – Leeuwen, Wood - 1981 |
| 4 | Algorithms for Klee's rectangle problems. Canegie-Mellon – Bentley - 1977 |
| 1 | On the maxima of a set of vectors. JACM – Kung, Luccio, et al. - 1975 |
