Hoạt động trong tuần

Thời gian: 9h00, Thứ 4 ngày 7/11/2018
Địa điểm: Phòng 302 Nhà A5, Viện Toán học
Tóm tắt: We present an efficient algorithm for determining the convex hull of a finite set of discs in the plane, applying the idea of a powerful algorithm for a finite set of points, namely Quickhull algorithm, which was discovered independently in 1977 by Eddy and in 1978 by Bykat. Some experiments show that our algorithm is feasible.