Ngừi báo cáo: Nguyễn Thị Mỹ Hạnh
Thời gian: 14:00 thứ 5, ngày 24/12/2015
Địa điểm: Phòng 4, nhà A14, Viện Toán học, 18 HoàngQuốc Việt, Cầu Giấy, Hà Nội
Tóm tắt: In this report, we present Chen and Han's algorithm introduced in 1990 for determining the shortest path between two arbitrary points on the surface of a convex polyhedron or a non-convex polyhedron. The algorithm uses a "Continuous Dijkstra" technique based on the key observation “one angle one split” with O(n2) complexity. In addition, Kavena and O'Rourke's implementation in 2000 is presented (cont.). |
