Packing ellipses in an optimized convex polygon

DOI10.1007/S10898-019-00777-YMaRDI QIDQ2274890zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 1 October 2019

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-019-00777-y

zbMATH Keywords

nonlinear optimizationconvex polygonpackingellipsescontinuous rotationsphi-function technique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30)

Recommendations

• Optimized ellipse packings in regular polygons
• Quasi-phi-functions and optimal packing of ellipses
• Packing ellipsoids in an optimized cylinder
• Optimal packing of general ellipses in a circle
• Optimized object packings using quasi-phi-functions

Cites work

• A nonlinear programming model with implicit variables for packing ellipsoids
• Approximate packing: integer programming models, valid inequalities and nesting
• Cutting ellipses from area-minimizing rectangles
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimized ellipse packings in regular polygons
• Optimized object packings using quasi-phi-functions
• Packing circular-like objects in a rectangular container
• Packing ellipsoids by nonlinear optimization
• Packing ellipsoids into volume-minimizing rectangular boxes
• Phi-functions for 2D objects formed by line segments and circular arcs
• Quasi-phi-functions and optimal packing of ellipses
• The complexity of cutting complexes

Cited in

(17)

• Lattice coverage of cuboid with minimum number of hemispheres
• Optimized ellipse packings in regular polygons
• scientific article; zbMATH DE number 3995477 (Why is no real title available?)
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
• Quasi-phi-functions and optimal packing of ellipses
• The concept of modeling packing and covering problems using modern computational geometry software
• Packing ellipsoids in an optimized cylinder
• Optimized packing clusters of objects in a rectangular container
• Decomposition algorithm for irregular placement problems
• Packing convex polygons in minimum-perimeter convex hulls
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Parallel computing technologies for solving optimization problems of geometric design
• Packing ovals in optimized regular polygons
• Cutting ellipses from area-minimizing rectangles
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
• Optimal packing of general ellipses in a circle
• Algorithms of optimal ball packing into ellipsoids

Describes a project that uses

Uses Software

• Ipopt
• Couenne

This page was built for publication: Packing ellipses in an optimized convex polygon

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