Line intersection searching amid unit balls in 3-space
From MaRDI portal
Cites work
- Almost tight upper bounds for vertical decompositions in four dimensions
- Cutting hyperplanes for divide-and-conquer
- Efficient partition trees
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Lower bounds for intersection reporting among flat objects
- On range searching with semialgebraic sets
- On range searching with semialgebraic sets. II.
- On ray shooting for triangles in 3-space and related problems
- On semialgebraic range reporting
- On the union of cylinders in three dimensions
- Optimal partition trees
- Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
- Polynomial partitioning for a set of varieties
- Range searching with efficient hierarchical cuttings
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Ray shooting on triangles in 3-space
- Reporting points in halfspaces
- Semialgebraic Range Reporting and Emptiness Searching with Applications
- Space searching for intersecting objects
This page was built for publication: Line intersection searching amid unit balls in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027527)
