Packing Volumes by Spheres

Abstract : 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.
Type de document :
Article dans une revue
IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 1983, 5 (1), pp.111--116. 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4767354〉. 〈10.1109/TPAMI.1983.4767354〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00548496
Contributeur : Thoth Team <>
Soumis le : lundi 20 décembre 2010 - 08:49:46
Dernière modification le : jeudi 11 janvier 2018 - 06:23:18

Identifiants

Collections

Citation

Roger Mohr, Ruzena Bajcsy. Packing Volumes by Spheres. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 1983, 5 (1), pp.111--116. 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4767354〉. 〈10.1109/TPAMI.1983.4767354〉. 〈inria-00548496〉

Partager

Métriques

Consultations de la notice

268