Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The main contents of this lecture include all of the following: Analysis: a harder example, 2-dimension maxima revisited, plane-sweep algorithm, analysis of plane-sweep algorithm, comparison of brute-force and plane sweep algorithms. |