Pages that link to "Item:Q789727"
From MaRDI portal
The following pages link to The symmetric all-furthest-neighbor problem (Q789727):
Displaying 6 items.
- On the determination of all pairs of symmetric furthest neighbor vertices of a simple polygon (Q1063241) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)
