Time: 14h00, Thursday, July 14, 2016
Location: Room 6, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: 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.