Thời gian: 13h, Thứ 4, ngày 4/2/2015

Địa điểm: Phòng 109, 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: The purpose of this paper is to determine the geometric shortest paths between two points on three dimensional surfaces. Valerie Pham Trong et al. present an algorithm which works on the pseudo-geodesic meshes for the given surfaces. This algorithm is constructed, based on unfolding a sequence of edge-adjacent faces which connects these points. And so, the geometric shortest path problems in three-dimensional surfaces are transposed to the problems in two-dimensional surfaces..