The Contact Number Problem in Two and Three Dimensions
Abstract
Given a packing of balls in two or three dimensions we want to maximize the number of contacts in the packing. This is referred to as the contact number problem. A packing of balls is totally separable if every two balls can be separated by a hyperplane that is disjoint from the interior of each ball. In this thesis we study the contact number problem for packings of congruent and incongruent balls in two and three dimensions, and we consider the totally separable version of each problem.
Description
Keywords
Mathematics
Citation
Foerster, M. (2016). The Contact Number Problem in Two and Three Dimensions (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/28036