Visibility and ray shooting queries in polygonal domains
From MaRDI portal
Publication:2261573
DOI10.1016/j.comgeo.2014.08.003zbMath1311.65022OpenAlexW2011353791MaRDI QIDQ2261573
Publication date: 6 March 2015
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.08.003
algorithmalgorithmscomputational geometrypolygonal domainsvisibility queriesvisibility polygonsray-shootings
Related Items
Maximum-area and maximum-perimeter rectangles in polygons ⋮ Routing among convex polygonal obstacles in the plane ⋮ How to cut corners and get bounded convex curvature ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Computing the visibility polygon of an island in a polygonal domain ⋮ Quickest visibility queries in polygonal domains ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
Cites Work
- Visibility queries in a polygonal region
- Planar rectilinear shortest path computation using corridors
- Visibility and intersection problems in plane geometry
- Visibility of disjoint polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Corrections to Lee's visibility polygon algorithm
- Ray shooting in polygons using geodesic triangulations
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Visibility queries and maintenance in simple polygons
- Topologically sweeping visibility complexes via pseudotriangulations
- Efficient visibility queries in simple polygons
- Space/query-time tradeoff for computing the visibility polygon
- Query point visibility computation in polygons with holes
- Computing the Visibility Polygon of an Island in a Polygonal Domain
- A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
- Visibility of a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Ray Shooting Amidst Convex Polygons in 2D
- A linear algorithm for computing the visibility polygon from a point
- Optimal Search in Planar Subdivisions
- On the correctness of a linear-time visibility polygon algorithm∗
- An Optimal Algorithm for Computing Visibility in the Plane
- TRIANGULATING DISJOINT JORDAN CHAINS
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Graphics in flatland revisited
- Computing shortest paths among curved obstacles in the plane
- THE VISIBILITY COMPLEX
