Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications designed focusing on the requirements motor vehicles, therefore, finding paths in pedestrian sections urban areas is not sufficiently supported. In addition, often adequate sidewalk routes, as users may also be interested alternative routes that, although slightly longer, pos...

In the previous chapter, we saw algorithms to find the shortest path from a source vertex s to a target vertex t in a directed graph. As it turns out, the best algorithms for this problem actually find the shortest path from s to every possible target (or from every possible source to t) by constructing a shortest path tree. The shortest path tree specifies two pieces of information for each no...

This paper presents a fast algorithm for de-interlacing of video images using a shortest path technique. The algorithm applies dynamic programming techniques to find a shortest path in a cost matrix. The motion information obtained from this shortest path is used to re-align the fields of a video image. By using the shortest path via dynamic programming, the motion information estimated is more...

The shortest path problem is common in many different fields (transportation systems, mechanical systems, etc). Most of the telecommunication industry protocols such as PNNI, OSPF and IISP use Dijkstra’s algorithm or Bellman-Ford’s algorithm to solve the shortest path problem. Today, the majority of the shortest path computations are performed in software, which is inefficient for real-time app...

An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corol...