HOẠT ĐỘNG TRONG TUẦN

The quickhull algorithm for determining the convex hull of a finite set of discs in plane
Báo cáo viên: Nguyễn Kiều Linh

Thời gian: 9h00, Thứ 4 ngày 14/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.

Trở lại

Tin tức nổi bật

20/12/24, Bài giảng viện:
New matrix perturbation bounds via “skewness”: theory and applications.
06/01/25, Hội nghị, hội thảo:
Geometry and Dynamics in Low Dimensions
06/01/25, Hội nghị, hội thảo:
The 3rd Vietnam - Korea joint workshop on selected topics in mathematics
21/07/25, Hội nghị, hội thảo:
International conference on commutative algebra to the memory of Jürgen Herzog

Công bố khoa học mới