Reporting points in halfspaces
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213496 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A deterministic view of random sampling and its use in geometry
- Cutting hyperplane arrangements
- Dynamic half-space range reporting and its applications
- Filtering Search: A New Approach to Query-Answering
- Halfspace range search: An algorithmic application of k-sets
- Lower Bounds on the Complexity of Polytope Range Searching
- Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
- Polygon Retrieval
- Quasi-optimal range searching in spaces of finite VC-dimension
- The power of geometric duality
- \(\epsilon\)-nets and simplex range queries
Cited in
(64)- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Optimal algorithms for geometric centers and depth
- Approximate polytope membership queries
- Dynamic ham-sandwich cuts in the plane
- Range minima queries with respect to a random permutation, and approximate range counting
- Nearest-neighbor searching under uncertainty. I
- Optimal encodings for range top-\(k\), selection, and min-max
- Approximate range searching: The absolute model
- Polytope approximation and the Mahler volume
- Relative \((p,\varepsilon )\)-approximations in geometry
- How hard is half-space range searching?
- Algorithms for polytope covering and approximation
- Efficient searching with linear constraints
- A non-linear lower bound for planar epsilon-nets
- ON ENUMERATING AND SELECTING DISTANCES
- scientific article; zbMATH DE number 7561469 (Why is no real title available?)
- Extremal point queries with lines and line segments and related problems
- Halfway Points
- Smallest \(k\)-enclosing rectangle revisited
- Topology B-trees and their applications
- Point location in zones of \(k\)-flats in arrangements
- Optimal halfspace range reporting in three dimensions
- Simplex Range Searching and Its Variants: A Review
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Near-linear algorithms for geometric hitting sets and set covers
- On nearest-neighbor graphs
- On range searching with semialgebraic sets
- On ray shooting in convex polytopes
- scientific article; zbMATH DE number 7561580 (Why is no real title available?)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- On lines missing polyhedral sets in 3-space
- Dynamic half-space range reporting and its applications
- A (slightly) faster algorithm for Klee's measure problem
- Kinetic sorting and kinetic convex hulls
- Two proofs for shallow packings
- Dynamic geometric data structures via shallow cuttings
- Ray shooting and stone throwing with near-linear storage
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Dynamic data structures for \(k\)-nearest neighbor queries
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Succinct and Implicit Data Structures for Computational Geometry
- Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- On approximate range counting and depth
- Economical Delone sets for approximating convex bodies
- Almost optimal set covers in finite VC-dimension
- Independent range sampling, revisited
- Halfspace range search: An algorithmic application of k-sets
- Tight lower bounds for the size of epsilon-nets
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Optimal partition trees
- Faster DBScan and HDBscan in low-dimensional Euclidean spaces
- On Dominance Reporting in 3D
- Approximation algorithms for maximum independent set of pseudo-disks
- Geometric pattern matching in d-dimensional space
- Smallest k-enclosing rectangle revisited
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- A general approach for cache-oblivious range reporting and approximate range counting
- scientific article; zbMATH DE number 1554935 (Why is no real title available?)
- Computing coverage kernels under restricted settings
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Near-linear approximation algorithms for geometric hitting sets
This page was built for publication: Reporting points in halfspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196295)
