Euclidean shortest path

The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We consider the problem of computing a Euclidean shortest path in the presence of removable obstacles in the plane. In particular…

2015

Given a set \mathcal{P} of non-intersecting polygonal obstacles in \mathbb{R}^2 defined with n vertices, we compute a sketch…

2011

One version of the Euclidean shortest path problem (ESP) is to find the shortest path such that it starts at p and ends at q and…

2010

We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of…

2005

We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube…

1993

This paper presents new heuristic algorithms using the guided A* search method : Guided Minimum Detour (GMD) algorithm and Line…

1991

We consider the problem of finding the (Euclidean) shortest path SP(s, t) between two points s and t in the plane, in the…

1989

In this paper, the problems of computing the Euclidean shortest path between two points on the surface of a convex polyhedron and…

1987

We present the rst lower bounds for shortest path problems (including euclidean shortest path) in three dimensions, and for some…

1986

We describe an efficient parallel solution for the problem of finding the shortest Euclidean path between two points in three…