Motion planning is one of the most important areas of robotics research. The complexity of
the motion-planning problem has hindered the development of practical algorithms. This …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …

A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

Abstract As the Internet of Things (IoT) becomes more and more intelligent, a new computing
paradigm, predictive intelligence is incorporated into many IoT applications. The devices of …

The current status of VLSI layout and directions for future research are addressed, with
emphasis on the authors' own work. Necessary terminology and definitions and, whenever …

In this paper, we show that the universal covering space of a surface can be used to unify
previous results on computing paths in a simple polygon. We optimize a given path among …

Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a
shortest path that starts at s, visits in order each of the polygons, and ends at t. If the …

We present an algorithm for computing L 1 shortest paths among polygonal obstacles in the
plane. Our algorithm employs the “continuous Dijkstra” technique of propagating a …

Recent advances in the field of computational geometry have provided efficient algorithms
for a variety of shortest path problems. Many problems in the field of terrain navigation can …