Người báo cáo: Đồng Văn Việt
Thời gian: 14h00, Thứ 5, ngày 25/8/2016
Địa điểm: Phòng 212, Nhà A5, Viện Toán học, 18 Hoàng Quốc Việt Cầu Giấy, Hà Nội
Tóm tắt: In this report, we present an O(n^2) algorithm for finding the exact shortest paths from a fixed source point to all other points on a triangulated convex polyhedral surface in three-dimensional space using the concept of funnels.ÂÂÂ Because of special shape of the funnels, the algorithm does not use planar unfolding technique that almost known exact algorithms rely on.
(joint work with Phan Thành An, Trần Văn Hoài and Konrad Polthier). |
