Người báo cáo: Đồng Văn Việt
Thời gian: 14h00, Thứ 6, ngày 22/7/2016
Địa điểm: Phòng 4, Nhà A14, Viện Toán học, 18 Hoàng Quốc Việt, Cầu Giấy, Hà Nội
Tóm tắt: In this report, we present a technique in C for finding the point of intersection of two segments in two dimensional space. After that, we extend this technique into three dimensional space. This is a module we will use in our algorithm which uses funnels for finding shortest paths on a polyhedral surface from a fixed source to all other vertices of the polyhedron. |
