Maximal two-guard walks in polygons

F. Aurenhammer, M. Steinkogler, R. Klein

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

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.
Original languageEnglish
Title of host publicationProc. 34th European Workshop on Computational Geometry (EuroCG'18)
Place of PublicationBerlin, Germany
Pages#1
Publication 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
Country/TerritoryGermany
CityBerlin
Period21/03/1823/03/18
Internet address

Fingerprint

Dive into the research topics of 'Maximal two-guard walks in polygons'. Together they form a unique fingerprint.

Cite this