Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Abstract This paper considers the optimal feedback planning problem of a point robot among polygonal obstacles in . In this… Expand
Is this relevant?
2000
2000
This paper introduces the concept of precision-sensitive algorithms, analogous to the well-known output-sensitive algorithms. We… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract. We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of n vertices. The… Expand
Is this relevant?
1995
1995
Precision-Sensitive Euclidean Shortest Path in 3-Space * 
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is… Expand
Is this relevant?
1993
1993
This paper presents new heuristic algorithms using the guided A* search method : Guided Minimum Detour (GMD) algorithm and Line… Expand
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles is… Expand
  • figure 2.1
  • figure 2.4
Is this relevant?
1987
1987
We present the rst lower bounds for shortest path problems (including euclidean shortest path) in three dimensions, and for some… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1986
1986
  • C. Bajaj
  • Proceedings. IEEE International Conference on…
  • 1986
  • Corpus ID: 20520767
We describe an efficient parallel solution for the problem of finding the shortest Euclidean path between two points in three… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destination… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?