Minimal surface convex hulls of spheres

DOI10.1007/s10013-018-0317-8zbMath1405.52017OpenAlexW2899790001WikidataQ128912994 ScholiaQ128912994MaRDI QIDQ1633782

Josef Kallrath, Markus M. Frey

Publication date: 20 December 2018

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-018-0317-8

zbMATH Keywords

global optimizationisoperimetric inequalitypacking problemcomputational geometrynon-convex nonlinear programmingconvex hull minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimal surfaces in differential geometry, surfaces with prescribed mean curvature (53A10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (3)

Packing convex polygons in minimum-perimeter convex hulls ⋮ Near optimal minimal convex hulls of disks ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing

Uses Software

• GAMS
• MinPerim

Cites Work

• Unnamed Item
• MinPerim
• Algebraic modeling for IP and MIP (GAMS)
• A literature review on circle and sphere packing problems: models and methodologies
• Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
• Polylithic modeling and solution approaches using algebraic modeling systems
• Maximum packing densities of basic 3D objects
• Interval methods for verifying structural optimality of circle packing configurations in the unit square
• Dense binary sphere packings
• Cutting circles and polygons from area-minimizing rectangles
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Sphere packings. (Edited by John Talbot)
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
• Strange phenomena in convex and discrete geometry. Ed. by James J. Dudziak
• Die isoperimetrische Ungleichung im Raum
• The Packing of Equal Spheres
• The Three-Dimensional Bin Packing Problem
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

This page was built for publication: Minimal surface convex hulls of spheres