Pages that link to "Item:Q3219150"
From MaRDI portal
The following pages link to Complexity, convexity, and unimodality (Q3219150):
Displaying 7 items.
- On the modality of convex polygons (Q748888) (← 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)
- 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)
- Algorithms for optimal area triangulations of a convex polygon (Q2432732) (← links)
