Optimal packing of general ellipses in a circle

DOI10.1007/978-3-319-66616-7_2MaRDI QIDQ1695077zbMATH OpenOpenAlexFDO

Authors Frank J. Kampas, János Pinter, Ignacio Castillo

Publication date 6 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66616-7_2

zbMATH Keywords

general ellipse packings in circlesglobal-local optimizationLGO solver suitemodel development using embedded Lagrange multipliersnumerical results

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Numerical mathematical programming methods (65K05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonconvex programming, global optimization (90C26)

Recommendations

• Optimized ellipse packings in regular polygons
• Packing circles within ellipses
• Packing ellipsoids by nonlinear optimization
• Packing ellipses in an optimized convex polygon
• A nonlinear programming model with implicit variables for packing ellipsoids

Cited in

(11)

• Packing ovals in optimized regular polygons
• Packing ellipses in an optimized convex polygon
• Optimal packings for filled rings of circles.
• Optimized ellipse packings in regular polygons
• Packing convex polygons in minimum-perimeter convex hulls
• Model development and solver demonstrations using randomized test problems
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
• Algorithms of optimal packing construction in ellipse
• Packing circles within ellipses
• Algorithms of optimal ball packing into ellipsoids
• Optimal packings of two ellipses in a square

Describes a project that uses

Uses Software

• LGO
• Mathematica
• MathOptimizer

This page was built for publication: Optimal packing of general ellipses in a circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695077)