### Abstract

Language | English |
---|---|

Status | Published - 2018 |

Event | 34th European Workshop on Computational Geometry - 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 | Germany |

City | Berlin |

Period | 21/03/18 → 23/03/18 |

Internet address |

### Fingerprint

### Cite this

*Maximal Two-Guard Walks in Polygons*. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.

**Maximal Two-Guard Walks in Polygons.** / Aurenhammer, Franz; Steinkogler, Michael; Klein, Rolf.

Research output: Contribution to conference › Paper › Research

}

TY - CONF

T1 - Maximal Two-Guard Walks in Polygons

AU - Aurenhammer, Franz

AU - Steinkogler, Michael

AU - Klein, Rolf

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

M3 - Paper

ER -