Name
Abstract | ||
|---|---|---|
We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points s and t in a simple polygon P with no holes, we want to minimize the distance they travel in order to see each other in P. We solve two variants of this problem, one minimizing the longer distance the two persons travel (min-max) and one minimizing the total travel distance (min-sum), optimally in linear time. We also consider a query version of this problem for the min-max variant. We can preprocess a simple n-gon in linear time so that the minimum of the longer distance the two persons travel can be computed in O(log2n) time for any two query positions s,t where the two persons start. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.comgeo.2019.07.003 | Computational Geometry |
Keywords | Field | DocType |
Visibility polygon,Shortest path,Watchman problems | Discrete mathematics,Combinatorics,Sight,Watchman route problem,Simple polygon,Time complexity,Mathematics | Conference |
Volume | ISSN | Citations |
84 | 0925-7721 | 1 |
PageRank | References | Authors |
0.38 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hee-kap Ahn | 1 | 219 | 42.92 |
| Eunjin Oh | 2 | 14 | 9.34 |
| Lena Schlipf | 3 | 18 | 5.79 |
| Fabian Stehn | 4 | 19 | 4.73 |
| Darren Strash | 5 | 238 | 17.72 |