Abstract
Deciding two-guard walkability of an n-sided polygon is a well-solved problem. We study the relatedquestion of how far two guards can reach from a given source vertex, in the (more realistic) case that the polygon is not entirely walkable. There can be O(n) such maximal walks, and we show how to find all of them in O(n log n) time.
| Originalsprache | englisch |
|---|---|
| Titel | Proc. 34th European Workshop on Computational Geometry (EuroCG'18) |
| Erscheinungsort | Berlin, Germany |
| Seiten | #1 |
| Publikationsstatus | Veröffentlicht - 2018 |
| Veranstaltung | 34th European Workshop on Computational Geometry - FU Berlin, Berlin, Deutschland Dauer: 21 Mär 2018 → 23 Mär 2018 https://conference.imp.fu-berlin.de/eurocg18/home |
Konferenz
| Konferenz | 34th European Workshop on Computational Geometry |
|---|---|
| Kurztitel | EuroCG 2018 |
| Land/Gebiet | Deutschland |
| Ort | Berlin |
| Zeitraum | 21/03/18 → 23/03/18 |
| Internetadresse |