Pages that link to "Item:Q2349742"
From MaRDI portal
The following pages link to Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742):
Displaying 9 items.
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q4636496) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- (Q5368689) (← links)