Pages that link to "Item:Q1058966"
From MaRDI portal
The following pages link to Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) (Q1058966):
Displaying 15 items.
- \(L_{1}\) cheapest paths in ``Fjord scenery'' (Q706968) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- Was Euclid an unnecessarily sophisticated psychologist? (Q1205750) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- Pasting gauges. I: Shortest paths across a hyperplane (Q1728102) (← links)
- Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Computation of arc length in the presence of barriers in networks (Q2369184) (← links)
- Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region. (Q2477119) (← links)
- Euclidean shortest paths in the presence of rectilinear barriers (Q3337244) (← links)
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
- A reduction result for location problems with polyhedral barriers (Q5937710) (← links)
