Pages that link to "Item:Q1193703"
From MaRDI portal
The following pages link to An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703):
Displaying 20 items.
- Diffuse reflection radius in a simple polygon (Q727965) (← 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)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← 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)
- 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)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications. (Q2704992) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Visibility with multiple reflections (Q5054820) (← 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)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
