Partially walking a polygon

Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (n) such maximal walks, and we show how to find all of them in O (n log⁡ n) time.
Original languageEnglish
Pages (from-to)3-11
Number of pages9
JournalComputational geometry
Volume84
DOIs
Publication statusPublished - 1 Nov 2019

Fingerprint

Polygon
Walk
Vertex of a graph

Cite this

Partially walking a polygon. / Aurenhammer, Franz; Steinkogler, Michael; Klein, Rolf.

In: Computational geometry, Vol. 84, 01.11.2019, p. 3-11.

Research output: Contribution to journalArticleResearchpeer-review

Aurenhammer, Franz ; Steinkogler, Michael ; Klein, Rolf. / Partially walking a polygon. In: Computational geometry. 2019 ; Vol. 84. pp. 3-11.
@article{9f406d4d5e4d47c4aa92d395a68357c4,
title = "Partially walking a polygon",
abstract = "Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (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 = "2019",
month = "11",
day = "1",
doi = "10.1016/j.comgeo.2019.07.002",
language = "English",
volume = "84",
pages = "3--11",
journal = "Computational geometry",
issn = "0925-7721",
publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Partially walking a polygon

AU - Aurenhammer, Franz

AU - Steinkogler, Michael

AU - Klein, Rolf

PY - 2019/11/1

Y1 - 2019/11/1

N2 - Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (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-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that the polygon is not entirely walkable? There can be Θ (n) such maximal walks, and we show how to find all of them in O (n log⁡ n) time.

U2 - 10.1016/j.comgeo.2019.07.002

DO - 10.1016/j.comgeo.2019.07.002

M3 - Article

VL - 84

SP - 3

EP - 11

JO - Computational geometry

JF - Computational geometry

SN - 0925-7721

ER -