# Euclidean shortest paths in the presence of rectilinear barriers

@article{Lee1984EuclideanSP, title={Euclidean shortest paths in the presence of rectilinear barriers}, author={D. Lee and F. Preparata}, journal={Networks}, year={1984}, volume={14}, pages={393-410} }

In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destination) in the plane, which avoids a given set of barriers. This problem had been solved earlier for polygonal obstacles with the aid of the visibility graph. This approach however, has an Ω(n2) time lower bound, if n is the total number of vertices of the obstacles. Our goal is to find interesting cases for which the solution can be obtained without the explicit… CONTINUE READING

#### Figures and Topics from this paper

398 Citations

A new algorithm for shortest paths among obstacles in the plane

- Mathematics, Computer Science
- Annals of Mathematics and Artificial Intelligence
- 2005

52- PDF

Rectilinear shortest paths in the presence of rectangular barriers

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1989

79- PDF

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

- Mathematics, Computer Science
- SIAM J. Comput.
- 1999

328- PDF

Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles

- Mathematics, Computer Science
- SCG '88
- 1988

80

L1 shortest paths among polygonal obstacles in the plane

- Mathematics, Computer Science
- Algorithmica
- 2005

107

Shortest Paths in the Plane with Obstacle Violations

- Mathematics, Computer Science
- Algorithmica
- 2020

- PDF

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1987

117

#### References

SHOWING 1-10 OF 15 REFERENCES

Finding minimum rectilinear distance paths in the presence of barriers

- Mathematics, Computer Science
- Networks
- 1981

128

Plane-sweep algorithms for intersecting geometric figures

- Mathematics, Computer Science
- CACM
- 1982

270- PDF

An algorithm for planning collision-free paths among polyhedral obstacles

- Computer Science
- CACM
- 1979

2,283- PDF

A note on two problems in connexion with graphs

- Mathematics, Computer Science
- Numerische Mathematik
- 1959

19,619- PDF

An Optimal Solution to a Wire-Routing Problem

- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1981

64

Complexity of the mover's problem and generalizations

- Computer Science
- 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979

882- PDF