A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
From MaRDI portal
Publication:4837542
DOI10.1006/jagm.1995.1017zbMath0828.68121OpenAlexW2609210027MaRDI QIDQ4837542
Subhash Suri, J. E. Hershberger
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (46)
Maximum-area and maximum-perimeter rectangles in polygons ⋮ Visibility queries in a polygonal region ⋮ Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ Median trajectories ⋮ Minimum weight pseudo-triangulations ⋮ AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Subquadratic algorithms for succinct stable matching ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ How to cut corners and get bounded convex curvature ⋮ Optimal partition trees ⋮ Simplex Range Searching and Its Variants: A Review ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Watchman routes for lines and line segments ⋮ Minimum-link paths revisited ⋮ A faster algorithm for computing motorcycle graphs ⋮ PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING ⋮ Cutting polygons into small pieces with chords: Laser-based localization ⋮ Query-point visibility constrained shortest paths in simple polygons ⋮ Binary plane partitions for disjoint line segments ⋮ Stabbers of line segments in the plane ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Finding the shortest boundary guard of a simple polygon ⋮ Covering a simple polygon by monotone directions ⋮ Ray shooting and stone throwing with near-linear storage ⋮ Polygons cuttable by a circular saw ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS ⋮ Diffuse reflection radius in a simple polygon ⋮ Optimal Higher Order Delaunay Triangulations of Polygons ⋮ Minimizing the stabbing number of matchings, trees, and triangulations ⋮ Light orthogonal networks with constant geometric dilation ⋮ GUARDING ART GALLERIES BY GUARDING WITNESSES ⋮ Tracing compressed curves in triangulated surfaces ⋮ Dynamic motion planning in low obstacle density environments ⋮ Dynamic motion planning in low obstacle density environments ⋮ Optimal higher order Delaunay triangulations of polygons ⋮ Quickest visibility queries in polygonal domains ⋮ Convex subdivisions with low stabbing numbers ⋮ On Romeo and Juliet problems: minimizing distance-to-sight ⋮ Altitude terrain guarding and guarding uni-monotone polygons ⋮ On Romeo and Juliet Problems: Minimizing Distance-to-Sight. ⋮ Adaptive Planar Point Location ⋮ Weak visibility queries of line segments in simple polygons
This page was built for publication: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
