Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
From MaRDI portal
Publication:2084662
DOI10.1007/s10878-022-00846-1OpenAlexW4221082391MaRDI QIDQ2084662
Sanjana Agrawal, Rajasekhar Inkulu
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09925
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining visibility of a polygon with a moving point of view
- Visibility queries in a polygonal region
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Visibility of disjoint polygons
- Corrections to Lee's visibility polygon algorithm
- An optimal visibility graph algorithm for triangulated simple polygons
- Maintenance of configurations in the plane
- Triangulating a simple polygon in linear time
- 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
- Visibility polygon queries among dynamic polygonal obstacles in plane
- Visibility and ray shooting queries in polygonal domains
- Maintaining the visibility graph of a dynamic simple polygon
- Efficient computation of geodesic shortest paths
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane
- Two-point L1 shortest path queries in the plane
- Incremental Algorithms to Update Visibility Polygons
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Visibility of a simple polygon
- On Shortest Paths in Polyhedral Spaces
- 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
- TRIANGULATING DISJOINT JORDAN CHAINS
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- Dynamic Algorithms for Visibility Polygons in Simple Polygons
- 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
