Dynamic Algorithms for Visibility Polygons in Simple Polygons
From MaRDI portal
Publication:5149571
DOI10.1142/S021819592050003XzbMath1457.68292arXiv1704.08219OpenAlexW3082218119MaRDI QIDQ5149571
Nitish P. Thakur, Rajasekhar Inkulu, K. Sowmya
Publication date: 11 February 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08219
Related Items (3)
Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Visibility queries in a polygonal region
- 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
- Maintenance of configurations in the plane
- Visibility queries and maintenance in simple polygons
- Optimal shortest path queries in a simple polygon
- Efficient visibility queries in simple polygons
- Visibility and ray shooting queries in polygonal domains
- Weak visibility queries of line segments in simple polygons
- Incremental Algorithms to Update Visibility Polygons
- Computing the visibility polygon from an edge
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Visibility of a simple polygon
- A linear algorithm for computing the visibility polygon from a point
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An Optimal Algorithm for Computing Visibility in the Plane
- The Robot Localization Problem
- Weak visibility queries of line segments in simple polygons and polygonal domains
- The visibility diagram: A data structure for visibility problems and motion planning
- Efficient computation of query point visibility in polygons with holes
- Visibility Algorithms in the Plane
- Computing the visibility polygon from a convex set and related problems
This page was built for publication: Dynamic Algorithms for Visibility Polygons in Simple Polygons
