Pages that link to "Item:Q582099"
From MaRDI portal
The following pages link to Computing the geodesic center of a simple polygon (Q582099):
Displayed 12 items.
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- Centers of sets of pixels (Q1570843) (← links)
- Multiple-guard kernels of simple polygons (Q1818909) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)