Time: 13h -15h, Wednesday, January 21, 2015

Location: Room 109, Building A5, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: Given two points s and t and  the beta-complex of a set of disks in the plane, we present an algorithm for computing the shortest path from s to t such that this path has a distance of at least \beta to the boundary of the beta-complex.