Recommendations
Cites work
- scientific article; zbMATH DE number 437529 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A Randomized Algorithm for Closest-Point Queries
- A deterministic view of random sampling and its use in geometry
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Almost tight bounds for -nets
- Analytical geometry of three dimensions
- Applications of a new space-partitioning technique
- Applications of random sampling in computational geometry. II
- Cutting hyperplane arrangements
- Cutting hyperplanes for divide-and-conquer
- Diameter, width, closest line pair, and parametric searching
- Efficient partition trees
- Efficient ray shooting and hidden surface removal
- Intersection Queries in Curved Objects
- Lines in space: Combinatorics and algorithms
- Lower Bounds on the Complexity of Polytope Range Searching
- On the zone of a surface in a hyperplane arrangement
- Polygon Retrieval
- Quasi-optimal range searching in spaces of finite VC-dimension
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- Ray Shooting and Parametric Search
- Ray shooting on triangles in 3-space
- Reporting points in halfspaces
- Some special Vapnik-Chervonenkis classes
- Space searching for intersecting objects
- Visibility and intersection problems in plane geometry
- -nets and simplex range queries
Cited in
(46)- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- All Farthest Neighbors in the Presence of Highways and Obstacles
- scientific article; zbMATH DE number 7559226 (Why is no real title available?)
- Some techniques for geometric searching with implicit set representations
- Ray shooting and stone throwing with near-linear storage
- Dynamic geometric data structures via shallow cuttings
- On range searching with semialgebraic sets
- Dynamic connectivity in disk graphs
- The power of nonmonotonicity in geometric searching
- Line arrangements and range search
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Polynomial data structure lower bounds in the group model
- The power of nonmonotonicity in geometric searching
- Vertical decompositions for triangles in 3-space
- Computing depth orders for fat objects and related problems
- Halfspace range search: An algorithmic application of k-sets
- Efficient \(c\)-oriented range searching with DOP-trees
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- On ray shooting for triangles in 3-space and related problems
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- General methods for adding range restrictions to decomposable searching problems
- On range searching with semialgebraic sets. II.
- On Euclidean vehicle routing with allocation
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Algorithms – ESA 2005
- scientific article; zbMATH DE number 3978403 (Why is no real title available?)
- Crossing patterns of semi-algebraic sets
- Separating bichromatic point sets by L-shapes
- Topology and combinatorics of partitions of masses by hyperplanes
- How to get close to the median shape
- Extremal point queries with lines and line segments and related problems
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- On reverse shortest paths in geometric proximity graphs
- Approximate range searching in higher dimension
- Optimal partition trees
- Simplex Range Searching and Its Variants: A Review
- Counting and representing intersections among triangles in three dimensions
- Semialgebraic Range Reporting and Emptiness Searching with Applications
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- ON ENUMERATING AND SELECTING DISTANCES
This page was built for publication: On range searching with semialgebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329188)
