Finding shortest path in the presence of barriers: an alternate approach
DOI10.1016/j.amc.2006.06.128zbMath1107.65321OpenAlexW1994605914MaRDI QIDQ870173
Rakesh K. Sharma, S. K. Peer, Dinesh Kumar Sharma
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.128
shortest pathnumerical examplesnetworksarc lengthbarriersEuclidean distancerectilinear distanceanalytical approachcurvilinear pathgraphical approachurban transportation system
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Preserving order in a forest in less than logarithmic time and linear space
- Computation of arc length in the presence of barriers in networks
- On a routing problem
- Finding minimum rectilinear distance paths in the presence of barriers
- Design and implementation of an efficient priority queue
- Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
- On bends and distances of paths among obstacles in two-layer interconnection model
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- An Appraisal of Some Shortest-Path Algorithms
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
This page was built for publication: Finding shortest path in the presence of barriers: an alternate approach
