
Vertex guarding for dynamic orthogonal art galleries
Given an orthogonal polygon with orthogonal holes, we devise a dynamic a...
read it

Local Complexity of Polygons
Many problems in Discrete and Computational Geometry deal with simple po...
read it

Planar Visibility: Testing and Counting
In this paper we consider query versions of visibility testing and visib...
read it

Faster and More Robust Meshbased Algorithms for Obstacle kNearest Neighbour
We are interested in the problem of finding k nearest neighbours in the ...
read it

On Visibility Graphs of Convex Fans and Terrains
For two points in the closure of a simple polygon P, we say that they se...
read it

BoundedDegree 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 ...
read it

Local Interactions for Cohesive Flexible Swarms
Distributed gathering algorithms aim to achieve complete visibility grap...
read it
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)) worstcase 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)) worstcase 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.
READ FULL TEXT
Comments
There are no comments yet.