Visibility and ray shooting queries in polygonal domains
From MaRDI portal
Publication:2261573
Recommendations
Cites work
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A linear algorithm for computing the visibility polygon from a point
- A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
- An Optimal Algorithm for Computing Visibility in the Plane
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Computing the visibility polygon of an island in a polygonal domain
- Corrections to Lee's visibility polygon algorithm
- Efficient visibility queries in simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- Graphics in flatland revisited
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the correctness of a linear-time visibility polygon algorithm∗
- Optimal Search in Planar Subdivisions
- Planar rectilinear shortest path computation using corridors
- Query point visibility computation in polygons with holes
- Ray Shooting Amidst Convex Polygons in 2D
- Ray shooting in polygons using geodesic triangulations
- Space/query-time tradeoff for computing the visibility polygon
- THE VISIBILITY COMPLEX
- TRIANGULATING DISJOINT JORDAN CHAINS
- Topologically sweeping visibility complexes via pseudotriangulations
- Visibility and intersection problems in plane geometry
- Visibility of a simple polygon
- Visibility of disjoint polygons
- Visibility queries and maintenance in simple polygons
- Visibility queries in a polygonal region
Cited in
(16)- Routing among convex polygonal obstacles in the plane
- Efficient computation of query point visibility in polygons with holes
- Query point visibility computation in polygons with holes
- Maximum-area and maximum-perimeter rectangles in polygons
- How to cut corners and get bounded convex curvature
- Visibility queries in a polygonal region
- scientific article; zbMATH DE number 1424307 (Why is no real title available?)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Algorithms for ray-shooting and intersection searching
- Routing among convex polygonal obstacles in the plane
- Incremental algorithms to update visibility polygons
- Quickest visibility queries in polygonal domains
- Hierarchical decompositions and circular ray shooting in simple polygons
- Visibility and Ray Shooting Queries in Polygonal Domains
- Dynamic algorithms for visibility polygons in simple polygons
- Computing the visibility polygon of an island in a polygonal domain
This page was built for publication: Visibility and ray shooting queries in polygonal domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2261573)
