No article text was recorded for this version.
geometric data structure efficiency
Version 1 of 119 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: An Optimal Lower Bound for Simplex Range Reporting
- Blog: Visibility Queries and Maintenance in Simple Polygons
- Blog: Line Intersection Searching Amid Unit Balls in 3-Space
- Blog: Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
- Blog: Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
- Blog: Orthogonal range searching on the RAM, revisited
- Blog: Implicitly representing arrangements of lines or segments
- Blog: Optimal Planar Orthogonal Skyline Counting Queries
- Blog: Fast Stabbing of Boxes in High Dimensions
- Blog: Improved Space Bounds for Cache-Oblivious Range Reporting
- Blog: Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
- Blog: Selection in Monotone Matrices and Computing kth Nearest Neighbors
- Blog: A Deterministic Partition Tree and Applications
- Blog: Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures
- Blog: Segment Intersection Searching Problems in General Settings
- Blog: Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- Blog: Aggregate-Max Nearest Neighbor Searching in the Plane
- Blog: Weak Visibility Queries of Line Segments in Simple Polygons
- Blog: On Range Summary Queries
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_geometric_data_structure_efficiency_9a41afa4,
title = {geometric data structure efficiency},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geometric-data-structure-efficiency/rdr_9a41afa4b2734884adf75d79f310d0cc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_geometric_data_structure_efficiency_9a41afa4_v1,
title = {geometric data structure efficiency},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geometric-data-structure-efficiency/rdr_9a41afa4b2734884adf75d79f310d0cc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}