Optimal dynamic solutions for fixed windowing problems
Rolf Klein, Otto Nurmi, Thomas Ottmann, D. Wood · 1986
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.