Pages that link to "Item:Q1104086"
From MaRDI portal
The following pages link to Computing the link center of a simple polygon (Q1104086):
Displaying 23 items.
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- On rectilinear link distance (Q808302) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Geodesic convexity in discrete spaces (Q1338849) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← 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)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane (Q2446340) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
