A general approach for cache-oblivious range reporting and approximate range counting
From MaRDI portal
Publication:991183
DOI10.1016/J.COMGEO.2010.04.003zbMATH Open1206.65068OpenAlexW2207300025MaRDI QIDQ991183FDOQ991183
Authors: Peyman Afshani, Norbert Zeh, Chris H. Hamilton 
Publication date: 2 September 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.04.003
Recommendations
- A general approach for cache-oblivious range reporting and approximate range counting
- Improved space bounds for cache-oblivious range reporting
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Approximate range counting revisited
- Approximate range counting revisited
- Towards tight lower bounds for range reporting on the RAM
- Cache-oblivious planar orthogonal range searching and counting
- scientific article; zbMATH DE number 2081109
- Cache-oblivious data structures for orthogonal range searching
data structuresrange searchingrange countingrange reportingcache-obliviousnessmemory hierarchiesoptimal query boundworst-case query time
Cites Work
- Introduction to algorithms
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Cache-oblivious algorithms
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Computational geometry. Algorithms and applications.
- Optimal Search in Planar Subdivisions
- Priority Search Trees
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Optimal halfspace range reporting in three dimensions
- Organization and maintenance of large ordered indexes
- Efficient searching with linear constraints
- Reporting points in halfspaces
- Range searching with efficient hierarchical cuttings
- Low-Dimensional Linear Programming with Violations
- On approximating the depth and related problems
- Title not available (Why is that?)
- Cache-Oblivious B-Trees
- Fractional cascading. II: Applications
- Cache-oblivious data structures for orthogonal range searching
- Efficient splitting and merging algorithms for order decomposable problems.
- Algorithms for three-dimensional dominance searching in linear space.
- On Dominance Reporting in 3D
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cache-oblivious planar orthogonal range searching and counting
- Cache-oblivious R-trees
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
- Range minima queries with respect to a random permutation, and approximate range counting
- The overlay of minimization diagrams in a randomized incremental construction
- Title not available (Why is that?)
- On approximate range counting and depth
- Title not available (Why is that?)
- Cache-oblivious range reporting with optimal queries requires superlinear space
Cited In (10)
- Independent range sampling, revisited
- Cache-oblivious planar orthogonal range searching and counting
- Cache-oblivious range reporting with optimal queries requires superlinear space
- A general approach for cache-oblivious range reporting and approximate range counting
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- Improved space bounds for cache-oblivious range reporting
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Title not available (Why is that?)
- Simplex Range Searching and Its Variants: A Review
- Approximating the k-Level in Three-Dimensional Plane Arrangements
This page was built for publication: A general approach for cache-oblivious range reporting and approximate range counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991183)
