Pages that link to "Item:Q1165585"
From MaRDI portal
The following pages link to On the multimodality of distances in convex polygons (Q1165585):
Displaying 11 items.
- On the modality of convex polygons (Q748888) (← links)
- Maximum-area triangle in a convex polygon, revisited (Q783698) (← links)
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- 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)
- The morphology of convex polygons (Q1205915) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- Constructing bimodal convex hexagons (Q3478004) (← links)
