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

numerical resultsglobal-local optimizationLGO solver suitegeneral ellipse packings in circlesmodel development using embedded Lagrange multipliers

Mathematics Subject Classification ID

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

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)

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

Describes a project that uses

Uses Software

• MathOptimizer
• Mathematica
• LGO

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)