Euclidean shortest path in the presence of obstacles

DOI10.1002/NET.3230210302zbMATH Open0738.90079OpenAlexW1992096258MaRDI QIDQ3971576FDOQ3971576

Authors: Yongmao Chen, Prakash V. Ramanan 

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210302

Recommendations

• Euclidean shortest paths in the presence of rectilinear barriers
• Shortest paths in the plane with polygonal obstacles
• scientific article; zbMATH DE number 3845073
• Shortest paths in the plane with convex polygonal obstacles

zbMATH Keywords

lower boundshortest pathsweep-line techniquepresence of obstacles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (7)

• Title not available (Why is that?)
• Estimation and determination of shortest path length in a road network with obstacles
• Title not available (Why is that?)
• The shortest path in a simple polygon with obstacles
• The distance function in the presence of an obstacle
• The Fastest Path Between Two Points, with a Symmetric Obstacle
• Shortest path in the presence of obstacles: An application to ocean shipping

This page was built for publication: Euclidean shortest path in the presence of obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971576)