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.
|Publication status||Published - 2018|
|Event||34th European Workshop on Computational Geometry - FU Berlin, Berlin, Germany|
Duration: 21 Mar 2018 → 23 Mar 2018
|Conference||34th European Workshop on Computational Geometry|
|Abbreviated title||EuroCG 2018|
|Period||21/03/18 → 23/03/18|