Optimal dynamic solutions for fixed windowing problems

Authors:
R Klein;O Nurmi;T Ottmann;D Wood
Affiliations:
Institut für Angewandte Informatik u. Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6980, D-7500 Karlsruhe, W.Germany;Institut für Angewandte Informatik u. Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6980, D-7500 Karlsruhe, W.Germany;Institut für Angewandte Informatik u. Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6980, D-7500 Karlsruhe, W.Germany;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
SCG '86 Proceedings of the second annual symposium on Computational geometry
Year:
1986

Citing 2
Cited 1

Design of Dynamic Data Structures

Design of Dynamic Data Structures
Optimal Solutions for a Class of Point Retrieval Problems

Proceedings of the 12th Colloquium on Automata, Languages and Programming

Developing a dynamic query system on location-based services

International Journal of Mobile Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a point set in plane and a fixed planar region (window) a window query consists of enumerating the points in a translate of the region. A recently presented result shows that a static data structure of optimal size enables window queries for convex regions in optimal time. We show that if the windows are (maybe non-convex) polygons another data structure of optimal size supports not only window queries in optimal time but also allows updating of the point set in optimal time.