Veröffentlichung

Titel:
On Romeo and Juliet Problems: Minimizing Distance-to-Sigh
AutorInnen:
Hee-Kap Ahn
Eunjin Oh
Lena Schlipf
Fabian Stehn
Darren Strash
Kategorie:
Workshopbeiträge
erschienen in:
Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), 2018, invited to the special issue of CGTA on EuroCG'18
Abstract:

We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points s and t in a simple polygon P with no holes, we want to minimize the distance these persons travel in order to see each other in P . We solve two variants of this problem, one minimizing the longer distance the two persons travel (min-max) and one minimizing the total travel distance (min-sum), optimally in linear time.

Download:
DROPS
BibTeX-Eintrag:
@article{, author = { Hee-Kap Ahn and Eunjin Oh and Lena Schlipf and Fabian Stehn and Darren Strash.\\ }, title = { On Romeo and Juliet Problems: Minimizing Distance-to-Sigh }, journal = {Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18)}, year = {2018}, note ={invited to the special issue of CGTA on EuroCG'18}, }
Christoph Doppelbauer | 24.01.2019