Maximal Two-Guard Walks in Polygons

Franz Aurenhammer; Michael Steinkogler; Rolf Klein

Maximal Two-Guard Walks in Polygons

Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Institut für Grundlagen der Informationsverarbeitung (7080)

Publikation: Konferenzbeitrag › Paper

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
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	Deutschland
Ort	Berlin
Zeitraum	21/03/18 → 23/03/18
Internetadresse	https://conference.imp.fu-berlin.de/eurocg18/home

Zugriff auf Dokument

https://conference.imp.fu-berlin.de/eurocg18/download/eurocg_proc.pdf

Fingerprint Untersuchen Sie die Forschungsthemen von „Maximal Two-Guard Walks in Polygons“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren

Aurenhammer, F., Steinkogler, M., & Klein, R. (2018). Maximal Two-Guard Walks in Polygons. Beitrag in 34th European Workshop on Computational Geometry, Berlin, Deutschland.

@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, EuroCG 2018 ; 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 -