Ray Shooting and Parametric Search
DOI10.1137/0222051zbMATH Open0777.68042OpenAlexW2016400774MaRDI QIDQ3137709FDOQ3137709
Authors: Pankaj K. Agarwal, Jiří Matoušek 
Publication date: 10 October 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222051
Recommendations
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) (n)-dimensional polytopes (52B11) Parallel algorithms in computer science (68W10)
Cited In (43)
- Shortest rectilinear path queries to rectangles in a rectangular domain
- The power of parallel projection
- Linear approximation of simple objects
- Dynamic geometric data structures via shallow cuttings
- Ray shooting and stone throwing with near-linear storage
- Dynamic ham-sandwich cuts in the plane
- Selection in monotone matrices and computing k th nearest neighbors
- Approximating nearest neighbor among triangles in convex position
- Dynamic half-space range reporting and its applications
- Point location among hyperplanes and unidirectional ray-shooting
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- Approximate polytope membership queries
- LATIN 2004: Theoretical Informatics
- Efficient partition trees
- On vertical ray shooting in arrangements
- Vertical decompositions for triangles in 3-space
- On ray shooting for triangles in 3-space and related problems
- Applications of a new space-partitioning technique
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Processing an offline insertion-query sequence with applications
- On range searching with semialgebraic sets
- Nearest-neighbor searching under uncertainty. I
- Linear data structures for fast ray-shooting amidst convex polyhedra
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- Output-sensitive results on convex hulls, extreme points, and related problems
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Frame-based ray search algorithms in unconstrained optimization
- THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
- Computing the visibility map of fat objects
- Efficient hidden surface removal for objects with small union size
- Range minima queries with respect to a random permutation, and approximate range counting
- Approximating Minimization Diagrams and Generalized Proximity Search
- Processing an Offline Insertion-Query Sequence with Applications
- Maximum matchings in geometric intersection graphs
- Dynamic Ray Stabbing
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- Simplex Range Searching and Its Variants: A Review
- Monte Carlo approximation of form factors with error bounded a priori
- Obnoxious facility location: complete service with minimal harm
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Output-sensitive peeling of convex and maximal layers
- Algorithms for ray-shooting and intersection searching
This page was built for publication: Ray Shooting and Parametric Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137709)
