Toolbox for particulate microstructure modelling

A high volume fraction sphere packing library

benchmark solutions for selected packing problems: circle, rectangle, cube, cuboid, polygon packings

Monte Carlo simulation of hard sphere packing using MATLAB

Fast Python, C++ & MATLAB code to generate random close packings (or jammed, overlapping or dense packing as well), such as dense 2d disk packings, dense 3d sphere packings with generalization to hypersphere N dimensional packings.

These scripts can be used to draw spheres and points on a sphere.

Finding the dense packing structure of hard spheres in cylindrical pores by sequential linear programming (SLP) mthod.

Collection of personal Unity projects

Hard drives make up a system of many particles, so we can approach the dynamics from a statistical point of view. The following model is based on the game of stones.

First independent byte-exact reproduction of the Zinoviev-Ericson (1999) K(13) = 1154 kissing configuration in R^13, with full optimization pipeline, 13 paper-grade structural findings on dim-13 saturation, rare-paths doctrine, and dual Constructor/Auditor methodology with both-hats discipline.

This repository contains the code to reproduce the results presented in the paper following paper: *N. Diaz, A. Alvarado, P. Meza, F. Guzman and E. Vera, "Multispectral Filter Array Design by Optimal Sphere Packing," in Transactions on Image Processing, 2023.

Byte-exact theorems on the Fermat quartic fourfold lattice — from a run at the unbeaten dimension-128 sphere-packing record. Keystone: the Bridge Theorem (Hodge norm = geometric intersection form).