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.

Additional Metadata
Persistent URL dx.doi.org/10.1007/3-540-44634-6_17
Citation
Bose, P, Maheshwari, A, Morin, P, & Morrison, J. (Jason). (2001). The grid placement problem. doi:10.1007/3-540-44634-6_17