Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
From MaRDI portal
Recommendations
Cited in
(16)- Minimizing the stabbing number of matchings, trees, and triangulations
- Applications of a new space-partitioning technique
- On range searching with semialgebraic sets
- Ray shooting and stone throwing with near-linear storage
- Connected component and simple polygon intersection searching
- Good splitters for counting points in triangles
- Optimal partition trees
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- Connected component and simple polygon intersection searching
- Dynamic data structures for fat objects and their applications
- LATIN 2004: Theoretical Informatics
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Parameterized spanning tree congestion
- Connecting colored point sets
This page was built for publication: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016913)