eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-12-06
59:1
59:12
10.4230/LIPIcs.ISAAC.2018.59
article
Minimizing Distance-to-Sight in Polygonal Domains
Oh, Eunjin
1
Max Planck Institute for Informatics Saarbrücken, Germany
In this paper, we consider the quickest pair-visibility problem in polygonal domains. Given two points in a polygonal domain with h holes of total complexity n, we want to minimize the maximum distance that the two points travel in order to see each other in the polygonal domain. We present an O(n log^2 n+h^2 log^4 h)-time algorithm for this problem. We show that this running time is almost optimal unless the 3sum problem can be solved in O(n^{2-epsilon}) time for some epsilon>0.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol123-isaac2018/LIPIcs.ISAAC.2018.59/LIPIcs.ISAAC.2018.59.pdf
Visibility in polygonal domains
shortest path in polygonal domains