Time: 9h00, Friday, January 22, 2016
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: In 1990 Chen and Han proposed a notable algorithm without implementation for finding the shortest paths frome one source point to all vertices on a polyhedral surface. Ten years later, Kaneca and O'Rourke publiced a paper with a description of a C++ implementation for Chen and Han's algorithm. Our report is to go in detail the C++ code of Kaneva and O'Rourke.