Thời gian: 14h, Thứ 3, ngày 2/6/2015

Địa điểm: Phòng 4, Nhà A14, Viện Toán học, 18 Hoàng Quốc Việt, Cầu Giấy, Hà Nội

Tóm tắt: Finding the convex hull of a finite set of points is one of the most well-known and widely investigated problems in computational geometry because of its theoretical significance as well as its practical applications. In this talk, we present Chand and Kapur’s gift-wrapping algorithm proposed in 1970 for finite sets of points in R^d.