This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Packing Volumes by Spheres
January 1983 (vol. 5 no. 1)
pp. 111-116
Roger Mohr, Unite d'Enseignement et de Recherche Sciences Mathematiques, Université de Nancy, Nancy, France.
Ruzena Bajcsy, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104.
In this note we present an algorithm for packing spheres in an arbitrary shaped volume. This algorithm is similar to Blum's transform in that it fits spheres into a volume, but it is different in that it fits only tangential spheres, and thereby the data reduction is larger than by Blum's transform. The spheres are of variable radii, which enables us to achieve a hierarchy of intrinsic volume properties, i.e., from gross to more detailed. The result of this algorithm is a graph where the nodes are the centers of spheres and the arcs are the connections between two tangent spheres. Analysis of computational complexity and the time and error considerations are provided.
Citation:
Roger Mohr, Ruzena Bajcsy, "Packing Volumes by Spheres," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 5, no. 1, pp. 111-116, Jan. 1983, doi:10.1109/TPAMI.1983.4767354
Usage of this product signifies your acceptance of the Terms of Use.