Halfspace range search: An algorithmic application of k-sets
From MaRDI portal
Publication:1077166
DOI10.1007/BF02187685zbMATH Open0594.68055OpenAlexW1996570135MaRDI QIDQ1077166FDOQ1077166
Bernard Chazelle, F. P. Preparata
Publication date: 1986
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130983
Recommendations
Information storage and retrieval of data (68P20) Searching and sorting (68P10) Other problems of combinatorial convexity (52A37)
Cites Work
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On k-Hulls and Related Problems
- A note on Euclidean near neighbor searching in the plane
- New upper bounds for neighbor searching
Cited In (19)
- An upper bound on the number of planar \(K\)-sets
- Efficient searching with linear constraints
- Line arrangements and range search
- Tight lower bounds for halfspace range searching
- Dynamic half-space range reporting and its applications
- Robust shape fitting via peeling and grating coresets
- Efficient partition trees
- Reporting points in halfspaces
- Applications of random sampling in computational geometry. II
- New applications of random sampling in computational geometry
- Efficient algorithms for maximum regression depth
- Cutting dense point sets in half
- On k-d Range Search with Patricia Tries
- On bounded leg shortest paths problems
- On \(k\)-sets in arrangements of curves and surfaces
- Title not available (Why is that?)
- Simplex Range Searching and Its Variants: A Review
- On levels in arrangements and Voronoi diagrams
- Edge-skeletons in arrangements with applications
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)
