Optimal Filling of Shapes

Abstract

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In n-dimensional space, if the objects are polydisperse n-balls, we show that solutions correspond to sets of maximal n-balls. For polygons, we provide a heuristic for finding solutions of maximal discs. We consider the properties of ideal distributions of N discs as N approaches infinity. We note an analogy with energy landscapes.

5 pages

References in corpus (6)

• Why is Random Close Packing Reproducible?
• A Precise Packing Sequence for Self-Assembled Convex Structures
• Do Binary Hard Disks Exhibit an Ideal Glass Transition?
• A microscopic mean-field theory of the jamming transition
• New jamming scenario: From marginal jamming to deep jamming
• Critical scaling in standard biased random walks

Cited by in corpus (5)

• Mean-field theory of random close packings of axisymmetric particles
• Fundamental challenges in packing problems: from spherical to non-spherical particles
• Effect of Shape and Friction on the Packing and Flow of Granular Materials
• GPU Accelerated Discrete Element Method (DEM) Molecular Dynamics for Conservative, Faceted Particle Simulations
• Multi-sphere approximation of realistic particles with a combined 3D thinning and greedy algorithm