Time: 9h00, Wednesday, May 23, 2018
Location: Room 302, Building A5, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: An algorithm  for finding shortest path from a point to a segment in a simple polygon is presented. This algorithm is based on the paper of Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Gunter Rote, Lena Schlipf, and Topi Talvitie "Shortest path to a segment and quickest visibility queries, Journal of Computational Geometry, Vol. 7(2), pp. 77-100, 2016".