Pages that link to "Item:Q728492"
From MaRDI portal
The following pages link to A linear-time algorithm for the geodesic center of a simple polygon (Q728492):
Displayed 16 items.
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- The polygon burning problem (Q2154090) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- (Q5088939) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- (Q5116471) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon (Q6179409) (← links)
- Maximal distortion of geodesic diameters in polygonal domains (Q6182904) (← links)