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:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!