A dynamic fixed windowing problem
From MaRDI portal
Publication:1825634
DOI10.1007/BF01553907zbMath0684.68035MaRDI QIDQ1825634
Thomas Ottmann, Otto Nurmi, Derick Wood, Rolf Klein
Publication date: 1989
Published in: Algorithmica (Search for Journal in Brave)
computational geometry; point set; dynamic data structure; window query; multidimensional searching; priority search trees
Related Items
Using persistent data structures for adding range restrictions to searching problems, GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING, Approximation algorithms for the unit disk cover problem in 2D and 3D, Space efficient dynamic orthogonal range reporting
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