Speaker: Phong Thi Thu Huyen
Time: 14h00, Wednesday, June 8, 2016
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: An efficient algorithm for determining the shortest path between two points in a simple polygon is presented (based on "P. T. An and T. V.Hoai, Incremental Convex Hull as an Orientation to Solving the Shortest Path Problem, International Journal of Information and Electronics Engineering, Vol. 2, No. 5, 2012"). |
