On range searching with semialgebraic sets
From MaRDI portal
Recommendations
Cites work
- -nets and simplex range queries
- A deterministic view of random sampling and its use in geometry
- A Randomized Algorithm for Closest-Point Queries
- 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
- 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?)
- 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
Cited in
(58)- Efficient \(c\)-oriented range searching with DOP-trees
- Halfspace range search: An algorithmic application of k-sets
- Some techniques for geometric searching with implicit set representations
- Line arrangements and range search
- General methods for adding range restrictions to decomposable searching problems
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- The power of nonmonotonicity in geometric searching
- Ray shooting and stone throwing with near-linear storage
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Vertical decompositions for triangles in 3-space
- Computing depth orders for fat objects and related problems
- Dynamic geometric data structures via shallow cuttings
- On Euclidean vehicle routing with allocation
- Approximate range searching in higher dimension
- Crossing patterns of semi-algebraic sets
- Counting and representing intersections among triangles in three dimensions
- Extremal point queries with lines and line segments and related problems
- Semialgebraic Range Reporting and Emptiness Searching with Applications
- All Farthest Neighbors in the Presence of Highways and Obstacles
- scientific article; zbMATH DE number 3978403 (Why is no real title available?)
- Optimal partition trees
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- The power of nonmonotonicity in geometric searching
- Simplex Range Searching and Its Variants: A Review
- ON ENUMERATING AND SELECTING DISTANCES
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Polynomial data structure lower bounds in the group model
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Maintaining the union of unit discs under insertions with near-optimal overhead
- On ray shooting for triangles in 3-space and related problems
- On range searching with semialgebraic sets
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- On range searching with semialgebraic sets. II.
- Algorithms – ESA 2005
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- On reverse shortest paths in geometric proximity graphs
- Dynamic connectivity in disk graphs
- An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Towards space efficient two-point shortest path queries in a polygonal domain
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Combinatorial characterizations and algorithms for trajectory planning of an articulated robotic probe in three dimensions
- Line intersection searching amid unit balls in 3-space
- Lower bounds for semialgebraic range searching and stabbing problems
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Lower bounds for semialgebraic range searching and stabbing problems
- Escaping the curse of spatial partitioning: matchings with low crossing numbers and their applications
- Sparse bounded hop-spanners for geometric intersection graphs
- Computing oriented spanners and their dilation
- Towards space efficient two-point shortest path queries in a polygonal domain
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Topology and combinatorics of partitions of masses by hyperplanes
- How to get close to the median shape
- Separating bichromatic point sets by L-shapes
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
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)
