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.
| Original language | English |
|---|---|
| Title of host publication | Proc. 34th European Workshop on Computational Geometry (EuroCG'18) |
| Place of Publication | Berlin, Germany |
| Pages | #1 |
| Publication status | Published - 2018 |
| Event | 34th European Workshop on Computational Geometry: EuroCG 2018 - FU Berlin, Berlin, Germany Duration: 21 Mar 2018 → 23 Mar 2018 https://conference.imp.fu-berlin.de/eurocg18/home |
Conference
| Conference | 34th European Workshop on Computational Geometry |
|---|---|
| Abbreviated title | EuroCG 2018 |
| Country/Territory | Germany |
| City | Berlin |
| Period | 21/03/18 → 23/03/18 |
| Internet address |