Pages that link to "Item:Q3933768"
From MaRDI portal
The following pages link to A Counterexample to a Diameter Algorithm for Convex Polygons (Q3933768):
Displayed 5 items.
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- On the unimodality of convex polygons (Q1113454) (← links)
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)