Maximal Two-Guard Walks in Polygons

Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Research output: Contribution to conferencePaperResearch

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.
LanguageEnglish
StatusPublished - 2018
Event34th European Workshop on Computational Geometry - FU Berlin, Berlin, Germany
Duration: 21 Mar 201823 Mar 2018
https://conference.imp.fu-berlin.de/eurocg18/home

Conference

Conference34th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2018
CountryGermany
CityBerlin
Period21/03/1823/03/18
Internet address

Fingerprint

Walk
Polygon
Vertex of a graph

Cite this

Aurenhammer, F., Steinkogler, M., & Klein, R. (2018). 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.

2018. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.

Research output: Contribution to conferencePaperResearch

Aurenhammer, F, Steinkogler, M & Klein, R 2018, 'Maximal Two-Guard Walks in Polygons' Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany, 21/03/18 - 23/03/18, .
Aurenhammer F, Steinkogler M, Klein R. Maximal Two-Guard Walks in Polygons. 2018. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.
Aurenhammer, Franz ; Steinkogler, Michael ; Klein, Rolf. / Maximal Two-Guard Walks in Polygons. Paper presented at 34th European Workshop on Computational Geometry, Berlin, Germany.
@conference{71e83ce06a2a488f8b8b7e44d163fff4,
title = "Maximal Two-Guard Walks in Polygons",
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.",
author = "Franz Aurenhammer and Michael Steinkogler and Rolf Klein",
year = "2018",
language = "English",
note = "34th European Workshop on Computational Geometry ; Conference date: 21-03-2018 Through 23-03-2018",
url = "https://conference.imp.fu-berlin.de/eurocg18/home",

}

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 -