Ray Shooting and Parametric Search
From MaRDI portal
Recommendations
Cited in
(51)- Dynamic ham-sandwich cuts in the plane
- Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
- Applications of a new space-partitioning technique
- Efficient partition trees
- Efficient hidden surface removal for objects with small union size
- Worst-case versus average case complexity of ray-shooting
- On range searching with semialgebraic sets
- Point location among hyperplanes and unidirectional ray-shooting
- Monte Carlo approximation of form factors with error bounded a priori
- Frame-based ray search algorithms in unconstrained optimization
- Ray shooting and stone throwing with near-linear storage
- On vertical ray shooting in arrangements
- Output-sensitive results on convex hulls, extreme points, and related problems
- Dynamic half-space range reporting and its applications
- Vertical decompositions for triangles in 3-space
- Dynamic geometric data structures via shallow cuttings
- Computing the visibility map of fat objects
- Nearest-neighbor searching under uncertainty. I
- Obnoxious facility location: complete service with minimal harm
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- Processing an offline insertion-query sequence with applications
- Algorithms for ray-shooting and intersection searching
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
- Approximate polytope membership queries
- Simplex Range Searching and Its Variants: A Review
- Dynamic Ray Stabbing
- Selection in monotone matrices and computing k th nearest neighbors
- On ray shooting for triangles in 3-space and related problems
- Processing an Offline Insertion-Query Sequence with Applications
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Approximating Minimization Diagrams and Generalized Proximity Search
- Linear approximation of simple objects
- Shortest rectilinear path queries to rectangles in a rectangular domain
- LATIN 2004: Theoretical Informatics
- Maximum matchings in geometric intersection graphs
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Range minima queries with respect to a random permutation, and approximate range counting
- Output-sensitive peeling of convex and maximal layers
- Clustering under perturbation stability in near-linear time
- The power of parallel projection
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Intersection searching amid tetrahedra in 4-space and efficient continuous collision detection
- Intersection searching amid tetrahedra in four dimensions
- On ray shooting for triangles in 3-space and related problems
- A deterministic partition tree and applications
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Approximating nearest neighbor among triangles in convex position
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)
