Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
DOI10.1137/0221035zbMATH Open0756.68091OpenAlexW2057537033MaRDI QIDQ4016913FDOQ4016913
Authors: Pankaj K. Agarwal 
Publication date: 16 January 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221035
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Other problems of combinatorial convexity (52A37)
Cited In (13)
- Ray shooting and stone throwing with near-linear storage
- Good splitters for counting points in triangles
- 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
- Applications of a new space-partitioning technique
- On range searching with semialgebraic sets
- Connecting colored point sets
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- Connected component and simple polygon intersection searching
- Minimizing the stabbing number of matchings, trees, and triangulations
- Optimal partition trees
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)
