Convex Hull Algorithms in Plane
Speaker: Phong Thi Thu Huyen

Time: 9h00, Wednesday, May 6, 2015

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

Abstract: The convex hull problem was one of the first problems in the field of computational geometry to have been studied from the point of view of computational complexity. Some algorithms are presented from the book "Computaional Geometry in C" by R. Orourke.

Back