Pages that link to "Item:Q5056105"
From MaRDI portal
The following pages link to Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105):
Displaying 7 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Estimation and determination of shortest path length in a road network with obstacles (Q1388932) (← links)
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488) (← links)
- A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric (Q1792086) (← links)
- Computing a maxian point of a simple rectilinear polygon (Q2643818) (← links)
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones (Q5370995) (← links)
