Báo cáo viên: Nguyễn Kiều Linh
Thời gian 9h, thứ 3 ngày 10/12/2019
Địa điểm: Phòng 212 Nhà A5, Viện Toán học
Tóm tắt: In this paper, we present a restricted technique for computing the lower convex hull in a class of finding Delaunay triangulation of a finite set of planar points. We propose a projection on planes parallel to the coordinate planes, thereby eliminating a large number of points to be calculated in order to speed up for our algorithm. The numerical experiments show that our algorithm reduce the computation time of the newest version which introduced in Applied Mathematics and Applications - ICCSAMA, France, textbf{358} (2015), pp. 15-26 by a factor of nearly two in average. |
