Optimal partition trees
From MaRDI portal
Publication:420575
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 49092 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A Randomized Algorithm for Closest-Point Queries
- A deterministic view of random sampling and its use in geometry
- Almost optimal set covers in finite VC-dimension
- Applications of a new space-partitioning technique
- Applications of random sampling in computational geometry. II
- CUTTINGS AND APPLICATIONS
- Cutting hyperplanes for divide-and-conquer
- Decomposable searching problems I. Static-to-dynamic transformation
- Efficient partition trees
- Efficient searching with linear constraints
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Implicitly representing arrangements of lines or segments
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear Optimization Queries
- Linear programming queries revisited
- Lower Bounds on the Complexity of Polytope Range Searching
- On range searching with semialgebraic sets
- On ray shooting in convex polytopes
- Optimal halfspace range reporting in three dimensions
- Output-sensitive results on convex hulls, extreme points, and related problems
- Partitioning Space for Range Queries
- Polygon Retrieval
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- Probability Inequalities for Sums of Bounded Random Variables
- Quasi-optimal range searching in spaces of finite VC-dimension
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Range searching with efficient hierarchical cuttings
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- Reporting points in halfspaces
- Simplex range reporting on a pointer machine
- Spanning trees with low crossing number
- The multiplicative weights update method: a meta-algorithm and applications
- Tight lower bounds for halfspace range searching
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- \(\epsilon\)-nets and simplex range queries
Cited in
(33)- Near optimal seperation of tree-like and general resolution
- Window queries for intersecting objects, maximal points and approximations using coresets
- Range searching with efficient hierarchical cuttings
- On reverse shortest paths in geometric proximity graphs
- Efficient partition trees
- Multilevel polynomial partitions and simplified range searching
- Simplex Range Searching and Its Variants: A Review
- Reprint of: Approximating majority depth
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Partitioning technique for transforming perfect binary trees into single-row networks
- Optimal partition trees
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
- Approximating majority depth
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- Decision trees with optimal joint partitioning
- A note on optimal multiway split trees
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Dynamic geometric data structures via shallow cuttings
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Efficient independent set approximation in unit disk graphs
- Optimal factorizations of families of trees
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Succinct and Implicit Data Structures for Computational Geometry
- On the power of the semi-separated pair decomposition
- Linear-space data structures for range mode query in arrays
- scientific article; zbMATH DE number 7559380 (Why is no real title available?)
- scientific article; zbMATH DE number 7559257 (Why is no real title available?)
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- scientific article; zbMATH DE number 1670652 (Why is no real title available?)
- Space-Time Tradeoffs for Emptiness Queries
- Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Semi-group range sum revisited: query-space lower bound tightened
- Partial enclosure range searching
This page was built for publication: Optimal partition trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420575)
