Partially walking a polygon

F. Aurenhammer; M. Steinkogler; R. Klein

doi:10.1016/j.comgeo.2019.07.002

Partially walking a polygon

F. Aurenhammer, M. Steinkogler, R. Klein

Institut für Grundlagen der Informationsverarbeitung (7080)

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

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.

Originalsprache	englisch
Seiten (von - bis)	3-11
Fachzeitschrift	Computational Geometry: Theory and Applications
Ausgabenummer	84
DOIs	https://doi.org/10.1016/j.comgeo.2019.07.002
Publikationsstatus	Veröffentlicht - 2019

Zugriff auf Dokument

10.1016/j.comgeo.2019.07.002

https://www.sciencedirect.com/science/article/pii/S0925772119301014

Dieses zitieren

@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 = "F. Aurenhammer and M. Steinkogler and R. Klein",

year = "2019",

doi = "10.1016/j.comgeo.2019.07.002",

language = "English",

pages = "3--11",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier B.V.",

number = "84",

}

TY - JOUR

T1 - Partially walking a polygon

AU - Aurenhammer, F.

AU - Steinkogler, M.

AU - Klein, R.

PY - 2019

Y1 - 2019

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

SN - 0925-7721

SP - 3

EP - 11

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 84

ER -