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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Identifying a route that avoids obstacles in continuous space is important for infrastructure alignment, robotic travel, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
We consider asymptotic properties of two functionals on Euclidean shortest-path trees appearing in random geometric graphs in R2… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2009
2009
We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstacles… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
This paper introduces the concept of precision-sensitive algorithms, in analogy to the well-known output-sensitive algorithms. We… (More)
Is this relevant?
1999
1999
We consider the two-point query version of the fundamental geometric shortest path problem: Given a set h of polygonal obstacles… (More)
  • figure 1
  • figure 2
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… (More)
Is this relevant?
1988
1988
The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles is… (More)
  • figure 2.1
  • figure 2.4
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?