# Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane

We devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures that store the visibility polygon of the query point. After preprocessing the initial input polygonal domain to build a few data structures, our algorithm takes O(k(|VP_P'(q)|)+(n')^2+h) (resp. O(k(n')^2+(|VP_P'(q)|)+h)) worst-case time to update data structures that store visibility polygon VP_P'(q) of a query point q when any vertex v is inserted to (resp. deleted from) any obstacle of the current polygonal domain P'. Here, n' is the number of vertices in P', h is the number of obstacles in P', VP_P'(q) is the visibility polygon of q in P' (|VP_P'(q)| is the number of vertices of VP_P'(q)), and k is the number of combinatorial changes in VP_P'(q) due to the insertion (resp. deletion) of v. As an application of the above algorithm, we also devise an algorithm for maintaining the visibility graph of a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update data structures that store the visibility graph of the polygonal domain. After preprocessing the initial input polygonal domain, our dynamic algorithm takes O(k(n')^2+h) (resp. O(k(n')^2+h)) worst-case time to update data structures that store the visibility graph when any vertex v is inserted to (resp. deleted from) any obstacle of the current polygonal domain P'. Here, n' is the number of vertices in P', h is the number of obstacles in P', and k is the number of combinatorial changes in the visibility graph of P' due to the insertion (resp. deletion) of v.

• 1 publication
• 6 publications
research
06/30/2020

### Vertex guarding for dynamic orthogonal art galleries

Given an orthogonal polygon with orthogonal holes, we devise a dynamic a...
research
01/19/2021

### Local Complexity of Polygons

Many problems in Discrete and Computational Geometry deal with simple po...
research
08/13/2018

### Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

We are interested in the problem of finding k nearest neighbours in the ...
research
01/15/2010

### Planar Visibility: Testing and Counting

In this paper we consider query versions of visibility testing and visib...
research
10/18/2021

### FAR Planner: Fast, Attemptable Route Planner using Dynamic Visibility Update

We present our work on a fast route planner based on visibility graph. T...
research
03/20/2019

### Dynamic Geometric Data Structures via Shallow Cuttings

We present new results on a number of fundamental problems about dynamic...
research
09/15/2020

### Bounded-Degree Spanners in the Presence of Polygonal Obstacles

Let V be a finite set of vertices in the plane and S be a finite set of ...