Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
type: Item
instance of: scholarly article
title: Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
author: Sanjana Agrawal
author: Rajasekhar Inkulu
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
full work available at URL: https://arxiv.org/abs/2011.09925
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7603306
zbMATH Keywords: computational geometry
zbMATH Keywords: visibility
zbMATH Keywords: dynamic algorithms
MaRDI profile type: Publication
OpenAlex ID: W4221082391
cites work: Visibility polygon queries among dynamic polygonal obstacles in plane
cites work: Visibility queries and maintenance in simple polygons
cites work: Visibility of disjoint polygons
cites work: TRIANGULATING DISJOINT JORDAN CHAINS
cites work: Space/query-time tradeoff for computing the visibility polygon
cites work: Efficient visibility queries in simple polygons
cites work: Triangulating a simple polygon in linear time
cites work: Maintaining visibility of a polygon with a moving point of view
cites work: Two-point L1 shortest path queries in the plane
cites work: A new algorithm for computing visibility graphs of polygonal obstacles in the plane
cites work: Visibility and ray shooting queries in polygonal domains
cites work: Maintaining the visibility graph of a dynamic simple polygon
cites work: Q3651735
cites work: A linear algorithm for computing the visibility polygon from a point
cites work: Computing the visibility polygon from a convex set and related problems
cites work: Visibility Algorithms in the Plane
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
cites work: An Optimal Algorithm for Computing Visibility in the Plane
cites work: An optimal visibility graph algorithm for triangulated simple polygons
cites work: Visibility queries in a polygonal region
cites work: Incremental Algorithms to Update Visibility Polygons
cites work: Dynamic Algorithms for Visibility Polygons in Simple Polygons
cites work: Corrections to Lee's visibility polygon algorithm
cites work: Efficient computation of geodesic shortest paths
cites work: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
cites work: Visibility of a simple polygon
cites work: Q3799261
cites work: Maintenance of configurations in the plane
cites work: Topologically sweeping visibility complexes via pseudotriangulations
cites work: Q3992847
cites work: On Shortest Paths in Polyhedral Spaces
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
cites work: Efficient computation of query point visibility in polygons with holes
DOI: 10.1007/S10878-022-00846-1
Recommended article: Visibility polygon queries among dynamic polygonal obstacles in plane
Recommended article: A new algorithm for computing visibility graphs of polygonal obstacles in the plane
Recommended article: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
Recommended article: Dynamic Algorithms for Visibility Polygons in Simple Polygons
Recommended article: Maintaining the visibility graph of a dynamic simple polygon
Recommended article: Visibility graphs and obstacle-avoiding shortest paths
Recommended article: Q3139724
Recommended article: Q3814827
Recommended article: On recognizing and characterizing visibility graphs of simple polygons
Recommended article: An optimal visibility graph algorithm for triangulated simple polygons
description: scientific article; zbMATH DE number 7603306