Optimal Filling of Shapes
From MaRDI portal
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.
This page was built for publication: Optimal Filling of Shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230949)
