Packing convex polygons in minimum-perimeter convex hulls
From MaRDI portal
Publication:2679237
DOI10.1007/S10898-022-01194-4OpenAlexW4297909578MaRDI QIDQ2679237FDOQ2679237
Authors: Josef Kallrath, A. Pankratov, Luis Infante, T. Romanova, I. Litvinchev 
Publication date: 19 January 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01194-4
Recommendations
- scientific article; zbMATH DE number 1786500
- Two approaches to modeling and solving the packing problem for convex polytopes
- Packing circles into perimeter-minimizing convex hulls
- Near optimal minimal convex hulls of disks
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
global optimizationcomputational geometryconvex hullnon-convex nonlinear programmingnon-overlap constraintsperimeter minimizationpolygon packing problem
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Packing circles into perimeter-minimizing convex hulls
- Introduction to algorithms
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- A polyhedral branch-and-cut approach to global optimization
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Cutting circles and polygons from area-minimizing rectangles
- Optimal clustering of a pair of irregular objects
- Quasi-phi-functions and optimal packing of ellipses
- Modeling and optimization in space engineering. State of the art and new challenges
- A hybrid LP/NLP paradigm for global optimization relaxations
- A tutorial in irregular shape packing problems
- Combinatorial configurations in balance layout optimization problems
- Aligning two convex figures to minimize area or perimeter
- How good are convex hull algorithms?
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- Lagrangian heuristic for a class of the generalized assignment problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Localization of the optimal solution and a posteriori bounds for aggregation
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Bundling three convex polygons to minimize area or perimeter
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Minimal surface convex hulls of spheres
- A fully general, exact algorithm for nesting irregular shapes
- Optimal packing of general ellipses in a circle
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Packing ellipsoids in an optimized cylinder
- Irregular packing problems: a review of mathematical models
- Packing ellipses in an optimized convex polygon
- Optimized ellipse packings in regular polygons
- Packing ovals in optimized regular polygons
Cited In (10)
- Near optimal minimal convex hulls of disks
- Polytopes, permutation shapes and bin packing
- Packing circles into perimeter-minimizing convex hulls
- Title not available (Why is that?)
- Title not available (Why is that?)
- Packing of convex polytopes into a parallelepiped
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- Title not available (Why is that?)
- Packing ovals in optimized regular polygons
- Title not available (Why is that?)
Uses Software
This page was built for publication: Packing convex polygons in minimum-perimeter convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679237)
