Pages that link to "Item:Q1917052"
From MaRDI portal
The following pages link to An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052):
Displaying 13 items.
- Linear time algorithm for optimal feed-link placement (Q482338) (← 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)
- Computing the link center of a simple polygon (Q1104086) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Location of rectilinear center trajectories (Q1284595) (← links)
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon (Q1944045) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
