par Bose, Prosenjit 
;Kostitsyna, Irina ;Langerman, Stefan
Référence Leibniz international proceedings in informatics, 77, page (211-2115)
Publication Publié, 2017-06
;Kostitsyna, Irina ;Langerman, Stefan Référence Leibniz international proceedings in informatics, 77, page (211-2115)
Publication Publié, 2017-06
Article révisé par les pairs
| Résumé : | We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points a, b, and c that appear in that order along the curve, c |
