A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Uniquely Represented Data Structures for Computational Geometry
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We show that there exists a constant $\omega list order as defined in the paper.