A dynamic fixed windowing problem

DOI10.1007/BF01553907zbMath0684.68035MaRDI QIDQ1825634

Thomas Ottmann, Otto Nurmi, Derick Wood, Rolf Klein

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometrypoint setdynamic data structurewindow querymultidimensional searchingpriority search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Data structures (68P05)

Related Items (4)

GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING ⋮ Using persistent data structures for adding range restrictions to searching problems ⋮ Space efficient dynamic orthogonal range reporting ⋮ Approximation algorithms for the unit disk cover problem in 2D and 3D

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Updating a balanced search tree in 0(1) rotations
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Priority Search Trees
• Dynamic C-oriented polygonal intersection searching
• Min-max heaps and generalized priority queues
• Decomposable searching problems I. Static-to-dynamic transformation

This page was built for publication: A dynamic fixed windowing problem