Results 11 to 20 of about 19,453 (266)
3DRSP: Matlab-based random sphere packing code in three dimensions
SoftwareX, 2022 A svert Matlabsvert -based computational procedure is proposed to fill a given volume with spheres whose radii are randomly picked from any specified probability distribution supported by svert Matlabsvert .
Travis J. Black, Alexei F. Cheviakov
doaj +1 more source
High-dimensional sphere packing and the modular bootstrap
Journal of High Energy Physics, 2020 We carry out a numerical study of the spinless modular bootstrap for conformal field theories with current algebra U(1) c × U(1) c , or equivalently the linear programming bound for sphere packing in 2c dimensions.
Nima Afkhami-Jeddi +4 more
doaj +1 more source
Discrete & Computational Geometry, 1997 60 pages. First of two older papers in the series on the proof of the Kepler conjecture. See math.MG/9811071.
openaire +3 more sources
Boyd-Maxwell ball packings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 In the recent study of infinite root systems, fractal patterns of ball packings were observed while visualizing roots in affine space. In fact, the observed fractals are exactly the ball packings described by Boyd and Maxwell.
Hao Chen, Jean-Philippe Labbé
doaj +1 more source
Discrete & Computational Geometry, 1997 18 pages. Second of two older papers in the series on the proof of the Kepler conjecture. See math.MG/9811071.
openaire +4 more sources
ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
Forum of Mathematics, Sigma, 2019 We prove a lower bound on the entropy of sphere packings of $\mathbb{R}^{d}$ of density $\unicode[STIX]{x1D6E9}(d\cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound ...
MATTHEW JENSSEN +2 more
doaj +1 more source
Finite sphere packing and sphere covering [PDF]
Discrete & Computational Geometry, 1989 By a convex body we mean a compact convex subset of Euclidean d-space with non-empty interior. Let k be a given positive integer. A central problem of finite packing and covering is to find (A) the minimum volume of all convex bodies containing a packing of k unit balls, and (B) the maximum volume of all convex bodies that can be covered by k unit ...
Wills, J.M. +2 more
openaire +1 more source
Online circle and sphere packing [PDF]
Theoretical Computer Science, 2018 In the Online Circle Packing in Squares, circles arrive one at a time and we need to pack them into the minimum number of unit square bins. We improve the previous best-known competitive ratio for the bounded space version from 2.439 to 2.3536 and we also give an unbounded space algorithm.
Carla Negri Lintzmayer +2 more
openaire +3 more sources
Virtual and Physical Prototyping, 2021 A discrete element model has been developed to simulate the packing process of fibre/polymer composite powder for powder bed fusion additive manufacturing.
Pengfei Tan +3 more
doaj +1 more source
DEM construction of binary hard sphere crystals and radical tessellation
AIP Advances, 2018 In this paper, four binary hard sphere crystals were numerically constructed by discrete element method (DEM) through different packing modes under three-dimensional (3D) mechanical vibration.
Defeng Wang +5 more
doaj +1 more source