The following pages link to On rectilinear link distance (Q808302):
Displaying 18 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon (Q1944045) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Computing a maxian point of a simple rectilinear polygon (Q2643818) (← links)
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS (Q2999096) (← links)
- (Q4945513) (← links)
- On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
