Pages that link to "Item:Q2460117"
From MaRDI portal
The following pages link to Extremal problems for convex polygons (Q2460117):
Displaying 18 items.
- Asymmetric polygons with maximum area (Q320859) (← links)
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Enumerating isodiametric and isoperimetric polygons (Q543911) (← links)
- A note on diameters of point sets (Q601983) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- The small hexagon and heptagon with maximum sum of distances between vertices (Q628747) (← links)
- Isoperimetric polygons of maximum width (Q1006404) (← links)
- The small octagons of maximal width (Q1953053) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Global exact optimization for covering a rectangle with 6 circles (Q2131145) (← links)
- Extremal problems for spherical convex polygons (Q2131246) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- Characterization of extremal antipodal polygons (Q2345506) (← links)
- Open sets avoiding integral distances (Q2391837) (← links)
- Finding largest small polygons with gloptipoly (Q2392118) (← links)
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons (Q2392128) (← links)
- Small polygons with large area (Q6123561) (← links)
