The Grid Placement Problem

Authors:
Prosenjit Bose;Anil Maheshwari;Pat Morin;Jason Morrison
Affiliations:
-;-;-;-
Venue:
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Year:
2001

Citing 3
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Output-Sensitive Algorithms for Uniform Partitions of Points

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

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.