Halfspace range search: An algorithmic application of k-sets
From MaRDI portal
(Redirected from Publication:1077166)
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3407703 (Why is no real title available?)
- A note on Euclidean near neighbor searching in the plane
- Constructing Arrangements of Lines and Hyperplanes with Applications
- New upper bounds for neighbor searching
- On k-Hulls and Related Problems
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
Cited in
(19)- Applications of random sampling in computational geometry. II
- New applications of random sampling in computational geometry
- Efficient partition trees
- On k-d Range Search with Patricia Tries
- Efficient searching with linear constraints
- Tight lower bounds for halfspace range searching
- Simplex Range Searching and Its Variants: A Review
- Dynamic half-space range reporting and its applications
- Edge-skeletons in arrangements with applications
- On levels in arrangements and Voronoi diagrams
- Cutting dense point sets in half
- Reporting points in halfspaces
- Robust shape fitting via peeling and grating coresets
- Line arrangements and range search
- Efficient algorithms for maximum regression depth
- An upper bound on the number of planar \(K\)-sets
- On \(k\)-sets in arrangements of curves and surfaces
- On bounded leg shortest paths problems
- scientific article; zbMATH DE number 1554935 (Why is no real title available?)
This page was built for publication: Halfspace range search: An algorithmic application of k-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077166)
