Finding shortest gentle paths on a land surface
Người báo cáo: Nguyễn Thị Lê

Thời gian: 9h, Thứ 4, ngày 31/5/2017
Địa điểm: Phòng 4, nhà A14, Viện Toán học, 18 Hoàng Quốc Việt, Hà Nội
Tóm tắt: 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.

Trở lại

Công bố khoa học mới