WEEKLY ACTIVITIES

The funnel algorithm for finding the shortest paths between two specified points in an simple polygon (cont.)
Speaker: Dang Ngoc Anh

Time: 14h, Friday, August 7, 2015

Location: Room 6, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: The problem of finding the shortest paths between two specified points (source, destination) in the plane has been solved by many O(n^2) time algorithms. In this report, we will present Lee & Preparata's paper, an O(nlogn) time algorithm can be developed which solves the problem by constructing the shortest-path tree with the edges belonging the inward-convex chains of the boundary of the funnels. The inward-convex chains were the shortest paths from the source to all the vertices of the obstacles and to the destination. The funnel is the region delimited by these chains and obstacles respectively.

Back