The Grid Placement Problem

The Grid Placement Problem

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(nlog n) time and O(n) space algorithm for this problem. As part of this algorithm we develop a new data structure for solving a p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bose, Prosenjit, Maheshwari, Anil, Morin, Pat, Morrison, Jason
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Grid Cell
Grid Position
Leftmost Column
Maximum Clique Problem
Operational research and scientific management
Operational research. Management science
Standard Position
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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(nlog 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.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-44634-6_17