English
Related papers

Related papers: Evolving Design Rules for the Inverse Granular Pac…

200 papers

The question of how stiff polymers are able to pack into small containers is particularly relevant to the study of DNA packaging in viruses. A reduced version of the problem based on coarse-grained representations of the main components of…

Biomolecules · Quantitative Biology 2016-10-12 D. C. Rapaport

Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…

Soft Condensed Matter · Physics 2007-05-23 Amos Maritan , Cristian Micheletti , Antonio Trovato , Jayanth R. Banavar

Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…

Computational Geometry · Computer Science 2023-08-17 Adam Kurpisz , Silvan Suter

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Computational Geometry · Computer Science 2015-03-30 Milos Tatarevic

We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…

Computational Geometry · Computer Science 2025-12-24 Josef Grus , Zdeněk Hanzálek , Christian Artigues , Cyrille Briand , Emmanuel Hebrard

We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…

Data Structures and Algorithms · Computer Science 2023-07-21 Michal Pilipczuk , Mathieu Mari , Timothe Picavet

Inverse design problems are common in engineering and materials science. The forward direction, i.e., computing output quantities from design parameters, typically requires running a numerical simulation, such as a FEM, as an intermediate…

Machine Learning · Computer Science 2026-02-18 Jens U. Kreber , Christian Weißenfels , Joerg Stueckler

Finite element simulations are run by package design engineers to model design structures. The process is irreversible meaning every minute structural adjustment requires a fresh input parameter run. In this paper, the problem of modeling…

Computational Engineering, Finance, and Science · Computer Science 2026-02-26 Kart-Leong Lim , Rahul Dutta , Mihai Rotaru

We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…

Computational Geometry · Computer Science 2025-01-03 Vítor Gomes Chagas , Elisa Dell'Arriva , Flávio Keidi Miyazawa

Discovering new physical products and processes often demands enormous experimentation and expensive simulation. To design a new product with certain target characteristics, an extensive search is performed in the design space by trying out…

Machine Learning · Statistics 2018-11-16 Phuoc Nguyen , Truyen Tran , Sunil Gupta , Santu Rana , Svetha Venkatesh

Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…

Soft Condensed Matter · Physics 2023-08-25 Anna Movsheva , Thomas A. Witten

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…

Metric Geometry · Mathematics 2016-08-14 András Bezdek , Włodzimierz Kuperberg

Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…

Disordered Systems and Neural Networks · Physics 2015-03-13 Giorgio Parisi , Francesco Zamponi

We consider three-dimensional clusters of identical bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for…

Soft Condensed Matter · Physics 2016-08-31 Simon Cox , Francois Graner

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

Optimization and Control · Mathematics 2012-08-29 Carolyn L. Phillips , Joshua A. Anderson , Elizabeth R. Chen , Sharon C. Glotzer

Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…

Statistical Mechanics · Physics 2018-08-01 Salvatore Torquato

Self-assembly of granular particles is of great interest in both applied and basic research. It is commonly observed that when randomly packed into a container, granular particles form disordered structures like glass. As the particles are…

Soft Condensed Matter · Physics 2025-01-20 Reza Amirifar , Kejun Dong , Aibing Yu

Intuition tells us that a rolling or spinning sphere will eventually stop due to the presence of friction and other dissipative interactions. The resistance to rolling and spinning/twisting torque that stops a sphere also changes the…

This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…

Differential Geometry · Mathematics 2022-08-23 Harish Chandra Rajpoot

We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…

Disordered Systems and Neural Networks · Physics 2015-05-19 Maximilien Danisch , Yuliang Jin , Hernan A. Makse