scientific article; zbMATH DE number 910894
From MaRDI portal
Publication:4886069
Recommendations
Cited in
(18)- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Optimal external memory planar point enclosure
- scientific article; zbMATH DE number 4060691 (Why is no real title available?)
- Efficient range searching for categorical and plain data
- Efficient searching with linear constraints
- scientific article; zbMATH DE number 4051018 (Why is no real title available?)
- Maintaining range trees is secondary memory. Part II: Lower bounds
- Data replication in static tree structures
- Maintaining range trees in secondary memory. Part I: Partitions
- New Data Structures for Orthogonal Range Queries
- Space Efficient Multi-dimensional Range Reporting
- Finding pairwise intersections inside a query range
- The buffer tree: A new technique for optimal I/O-algorithms
- On Dominance Reporting in 3D
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
- Finding pairwise intersections of rectangles in a query rectangle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886069)
