A deterministic partition tree and applications
From MaRDI portal
Cites work
- -nets and simplex range queries
- Algorithms for ray-shooting and intersection searching
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Applications of a new space-partitioning technique
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Cutting hyperplanes for divide-and-conquer
- Efficient partition trees
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- scientific article; zbMATH DE number 4062593 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Lower Bounds on the Complexity of Polytope Range Searching
- Optimal partition trees
- Partitioning Space for Range Queries
- Polygon Retrieval
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Range searching with efficient hierarchical cuttings
- Ray Shooting and Parametric Search
- Simplex Range Searching and Its Variants: A Review
- Simplex range searching revisited: how to shave logs in multi-level data structures
- Storing line segments in partition trees
- Unit-disk range searching and applications
This page was built for publication: A deterministic partition tree and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322532)
