Time: 14h00, Wednesday, January 6, 2016
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: In this report, we present Chen and Han's algorithm introduced in 1990 for determining the shortest path between two arbitrary points on the surface of a convex polyhedron or a non-convex polyhedron. The algorithm uses a "Continuous Dijkstra" technique based on the key observation “one angle one split” with O(n2) complexity. In addition, Kavena and O'Rourke's implementation in 2000 is presented.