Finding shortest gentle paths on a land surface
Speaker: Nguyen Thi Le

Time: 9h00, Wednesday, June 7, 2017
Location:
Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract:
Finding shortest gentle paths on a terrain is a variant of the shortest path problem in which a path is constrained with a given slope. In this seminar, we present the method given by Lian Liu and Raymond Wong (SIGMOD, 2011) to compute such paths on land surfaces. The surface simplification used in the method to reduce the computational complexity is presented. Some notes on their implementation of proposed algorithm also are discussed.

Back