Time: 14h, Thursday, May 28, 2015

Location: Room 6, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: 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.