A dynamic fixed windowing problem
From MaRDI portal
Recommendations
- Window queries for problems on intersecting objects and maximal points
- Dynamic planar point location with optimal query time
- Towards an optimal method for dynamic planar point location
- Dynamic planar point location with optimal query time (extended abstract)
- Dynamic Point Location in General Subdivisions
Cites work
- scientific article; zbMATH DE number 3911763 (Why is no real title available?)
- scientific article; zbMATH DE number 3770965 (Why is no real title available?)
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic C-oriented polygonal intersection searching
- Min-max heaps and generalized priority queues
- Priority Search Trees
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The design of dynamic data structures
- Updating a balanced search tree in 0(1) rotations
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(6)- Approximation algorithms for the unit disk cover problem in 2D and 3D
- Space efficient dynamic orthogonal range reporting
- Using persistent data structures for adding range restrictions to searching problems
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Two approaches to building time-windowed geometric data structures
- Window queries for problems on intersecting objects and maximal points
This page was built for publication: A dynamic fixed windowing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825634)
