Euclidean shortest paths on a sequence of triangles in 3D
Speaker: Phong Thi Thu Huyen

Time: 14h00, Friday, March 4, 2016
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Abstract: We consider the problem of finding the Euclidean shortest path between two points along a sequence of triangles in 3D. The concept of  a geodesically convex hull along a sequence of triangles is introduced. A new algorithm based on incremental geodesically convex hulls is presented

Back