Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane

Sanjana Agrawal () and R. Inkulu ()
Additional contact information
Sanjana Agrawal: Department of Computer Science and Engineering IIT
R. Inkulu: Department of Computer Science and Engineering IIT

Journal of Combinatorial Optimization, 2022, vol. 44, issue 4, No 46, 3056-3082

Abstract: Abstract 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(\lg {|VP_{{\mathcal {P}}'}(q)|})+(\lg {n'})^{2}+h)$$ O ( k ( lg | V P P ′ ( q ) | ) + ( lg n ′ ) 2 + h ) (resp. $$O(k(\lg n')^2+(\lg |VP_{{\mathcal {P}}'}(q)|)+h)$$ O ( k ( lg n ′ ) 2 + ( lg | V P P ′ ( q ) | ) + h ) ) worst-case time to update data structures that store visibility polygon $$VP_{\mathcal P'}(q)$$ V P P ′ ( q ) of a query point q when any vertex v is inserted to (resp. deleted from) any obstacle of the current polygonal domain $${\mathcal {P}}'$$ P ′ . Here, $$n'$$ n ′ is the number of vertices of $${\mathcal {P}}'$$ P ′ , h is the number of obstacles in $${\mathcal {P}}'$$ P ′ , $$VP_{{\mathcal {P}}'}(q)$$ V P P ′ ( q ) is the visibility polygon of q in $${\mathcal {P}}'$$ P ′ ( $$|VP_{{\mathcal {P}}'}(q)|$$ | V P P ′ ( q ) | is the number of vertices of $$VP_{{\mathcal {P}}'}(q)$$ V P P ′ ( q ) ), and k is the number of combinatorial changes in $$VP_{{\mathcal {P}}'}(q)$$ V P 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(\lg {n'})^{2}+h)$$ O ( k ( lg n ′ ) 2 + h ) (resp. $$O(k(\lg {n'})^{2}+h)$$ O ( k ( lg 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 $${\mathcal {P}}'$$ P ′ . Here, $$n'$$ n ′ is the number of vertices of $${\mathcal {P}}'$$ P ′ , h is the number of obstacles in $${\mathcal {P}}'$$ P ′ , and k is the number of combinatorial changes in the visibility graph of $${\mathcal {P}}'$$ P ′ due to the insertion (resp. deletion) of v.

Keywords: Computational Geometry; Visibility; Dynamic Algorithms (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00846-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-022-00846-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00846-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().