A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
From MaRDI portal
Recommendations
Cited in
(56)- Minimizing the stabbing number of matchings, trees, and triangulations
- Light orthogonal networks with constant geometric dilation
- Optimal higher order Delaunay triangulations of polygons
- Convex subdivisions with low stabbing numbers
- Dynamic motion planning in low obstacle density environments
- Ray shooting in polygons using geodesic triangulations
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Ray shooting and stone throwing with near-linear storage
- Lower bounds for intersection searching and fractional cascading in higher dimension
- Visibility and ray shooting queries in polygonal domains
- Covering a simple polygon by monotone directions
- Quickest visibility queries in polygonal domains
- On Romeo and Juliet problems: minimizing distance-to-sight
- Altitude terrain guarding and guarding uni-monotone polygons
- Median trajectories
- Minimum weight pseudo-triangulations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Watchman routes for lines and line segments
- Minimum-link paths revisited
- Query-point visibility constrained shortest paths in simple polygons
- scientific article; zbMATH DE number 437529 (Why is no real title available?)
- Shooting permanent rays among disjoint polygons in the plane
- scientific article; zbMATH DE number 176772 (Why is no real title available?)
- Optimal partition trees
- Simplex Range Searching and Its Variants: A Review
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- Adaptive planar point location
- Dynamic motion planning in low obstacle density environments
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- On Romeo and Juliet problems: minimizing distance-to-sight
- Fast Fréchet distance between curves with long edges
- Shooting permanent rays among disjoint polygons in the plane
- PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
- Binary plane partitions for disjoint line segments
- Stabbers of line segments in the plane
- Optimal Higher Order Delaunay Triangulations of Polygons
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Cutting polygons into small pieces with chords: Laser-based localization
- Tracing compressed curves in triangulated surfaces
- Finding the shortest boundary guard of a simple polygon
- Polygons cuttable by a circular saw
- How to cut corners and get bounded convex curvature
- The stochastic walk algorithms for point location in pseudo-triangulations
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Approximation algorithms for the two-watchman route in a simple polygon
- Computing conforming partitions with low stabbing number for rectilinear polygons
- Algorithms for halfplane coverage and related problems
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Computing conforming partitions with low stabbing number for rectilinear polygons
- Computing instance-optimal kernels in two dimensions
- Algorithms for halfplane coverage and related problems
- Maximum-area and maximum-perimeter rectangles in polygons
- Visibility queries in a polygonal region
- An optimal algorithm for the boundary of a cell in a union of rays
This page was built for publication: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837542)
