Partially walking a polygon

Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Research output: Contribution to journalArticle


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
Publication statusPublished - 1 Nov 2019

Fingerprint Dive into the research topics of 'Partially walking a polygon'. Together they form a unique fingerprint.

Cite this