A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
From MaRDI portal
Publication:4837542
DOI10.1006/JAGM.1995.1017zbMATH Open0828.68121OpenAlexW2609210027MaRDI QIDQ4837542FDOQ4837542
Authors: John Hershberger, Subhash Suri 
Publication date: 3 July 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1017
Recommendations
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (49)
- PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
- Maximum-area and maximum-perimeter rectangles in polygons
- Visibility queries in a polygonal region
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- Ray shooting and stone throwing with near-linear storage
- Altitude terrain guarding and guarding uni-monotone polygons
- On Romeo and Juliet problems: minimizing distance-to-sight
- On Romeo and Juliet problems: minimizing distance-to-sight
- Minimum-link paths revisited
- Binary plane partitions for disjoint line segments
- Stabbers of line segments in the plane
- Tracing compressed curves in triangulated surfaces
- Light orthogonal networks with constant geometric dilation
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Dynamic motion planning in low obstacle density environments
- Visibility and ray shooting queries in polygonal domains
- How to cut corners and get bounded convex curvature
- Lower bounds for intersection searching and fractional cascading in higher dimension
- Cutting polygons into small pieces with chords: Laser-based localization
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Title not available (Why is that?)
- Quickest visibility queries in polygonal domains
- Fast Fréchet distance between curves with long edges
- Approximation algorithms for the two-watchman route in a simple polygon
- Watchman routes for lines and line segments
- Covering a simple polygon by monotone directions
- Adaptive planar point location
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Minimum weight pseudo-triangulations
- Shooting permanent rays among disjoint polygons in the plane
- Dynamic motion planning in low obstacle density environments
- Minimizing the stabbing number of matchings, trees, and triangulations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- An optimal algorithm for the boundary of a cell in a union of rays
- Convex subdivisions with low stabbing numbers
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- The stochastic walk algorithms for point location in pseudo-triangulations
- Optimal Higher Order Delaunay Triangulations of Polygons
- Simplex Range Searching and Its Variants: A Review
- Optimal partition trees
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- Polygons cuttable by a circular saw
- Finding the shortest boundary guard of a simple polygon
- Title not available (Why is that?)
- Optimal higher order Delaunay triangulations of polygons
- Query-point visibility constrained shortest paths in simple polygons
- Shooting permanent rays among disjoint polygons in the plane
- Median trajectories
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)
