On Romeo and Juliet Problems: Minimizing Distance-to-Sight

Autor: Ahn, Hee-Kap, Oh, Eunjin, Schlipf, Lena, Stehn, Fabian, Strash, Darren

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 they travel in order to

Externí odkaz: http://arxiv.org/abs/1906.01114

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees

Autor: Große, Ulrike, Gudmundsson, Joachim, Knauer, Christian, Smid, Michiel, Stehn, Fabian

We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a pat

Externí odkaz: http://arxiv.org/abs/1607.05547

Placing your coins on a shelf

Autor: Alt, Helmut, Buchin, Kevin, Chaplick, Steven, Cheong, Otfried, Kindermann, Philipp, Knauer, Christian, Stehn, Fabian, Okamoto, Yoshio, Tokuyama, Takeshi

Publikováno v: BASE-Bielefeld Academic Search Engine
Maastricht University
Journal of Computational Geometry, 9(1), 312-327. Macodrum library, Carleton University
arXiv. Cornell University Library
ISSUE=1707.01239;TITLE=arXiv
28th International Symposium on Algorithms and Computation (ISAAC 2017), 92, 4:1-4:12
Journal of Computational Geometry, 9(1), 312-327. Carleton University

We consider the problem of packing a family of disks ``on a shelf,'' that is, such that each disk touches the x-axis from above and such that no two disks overlap. We study the problem of minimizing the distance between the leftmost point and the rig

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c404db084dc5b5f9b6619ce1fb7ebc1
https://doi.org/10.20382/jocg.v9i1a10

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.