# Euclidean shortest path

## Papers overview

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

2016

2016

- Trans. GIS
- 2016

Identifying a route that avoids obstacles in continuous space is important for infrastructure alignment, robotic travel, andâ€¦Â (More)

Is this relevant?

2015

2015

- 2015

We consider asymptotic properties of two functionals on Euclidean shortest-path trees appearing in random geometric graphs in R2â€¦Â (More)

Is this relevant?

2011

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)

Is this relevant?

2009

2009

- SODA
- 2009

We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstaclesâ€¦Â (More)

Is this relevant?

2000

2000

- SIAM J. Comput.
- 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

- SODA
- 1999

We consider the two-point query version of the fundamental geometric shortest path problem: Given a set h of polygonal obstaclesâ€¦Â (More)

Is this relevant?

1995

1995

- Symposium on Computational Geometry
- 1995

Precision-Sensitive Euclidean Shortest Path in 3-Space *Â

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Symposium on Computational Geometry
- 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

- Symposium on Computational Geometry
- 1988

The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles isâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Networks
- 1984

In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destinationâ€¦Â (More)

Is this relevant?