Sphere Packing Reference

Rene Weller, Hermann Meissenhalter, Gabriel Zachmann, Sven Oesau

The Sphere Packing provides a method to densely fill a closed triangular mesh with preferably large non-overlapping spheres. The algorithm proceeds by locating potential positions for large spheres based on a grid in parallel on GPU. In each iteration the largest spheres are inserted and the method terminates when a target number or coverage is attained or spheres above a certain radius can no longer be inserted.

Introduced in: CGAL 6.3
Depends on: Polygon Mesh Processing
BibTeX: cgal:w-sp-26b
License: GPL

Classified Reference Pages

Algorithms

• CGAL::pack_spheres()

Topics
	Algorithms