### Abstract

Original language | English |
---|---|

Pages (from-to) | 3-11 |

Number of pages | 9 |

Journal | Computational geometry |

Volume | 84 |

DOIs | |

Publication status | Published - 1 Nov 2019 |

### Fingerprint

### Cite this

*Computational geometry*,

*84*, 3-11. https://doi.org/10.1016/j.comgeo.2019.07.002

**Partially walking a polygon.** / Aurenhammer, Franz; Steinkogler, Michael; Klein, Rolf.

Research output: Contribution to journal › Article › Research › peer-review

*Computational geometry*, vol. 84, pp. 3-11. https://doi.org/10.1016/j.comgeo.2019.07.002

}

TY - JOUR

T1 - Partially walking a polygon

AU - Aurenhammer, Franz

AU - Steinkogler, Michael

AU - Klein, Rolf

PY - 2019/11/1

Y1 - 2019/11/1

N2 - Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (n) such maximal walks, and we show how to find all of them in O (n log n) time.

AB - Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (n) such maximal walks, and we show how to find all of them in O (n log n) time.

U2 - 10.1016/j.comgeo.2019.07.002

DO - 10.1016/j.comgeo.2019.07.002

M3 - Article

VL - 84

SP - 3

EP - 11

JO - Computational geometry

JF - Computational geometry

SN - 0925-7721

ER -