WEEKLY ACTIVITIES

Chen and Han's algorithm for computing shortest paths on a polytope
Speaker: Dong Van Viet

Time: 9h00, Wednesday, April 6, 2016
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: In this report, firstly we present an algorithm proposed by Chen and Han for finding the shortest paths from one source point to all vertices on a polyhedral surface. Secondly, we present an implementation of this algorithm by Kaneva and O'Rourke.

Back

Highlights

New Scientiffic Publications