1. Amato NM, Goodrich MT, Ramos EA (2000) Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, pp 705–706
2. Baur C, Fekete SP (2001) Approximation of geometric dispersion problems. Algorithmica 30(3):451–470
3. Bourland JD, Wu QR (1996) Use of shape for automated, optimized 3D radiosurgical treatment planning. In: Proceedings of the SPIE international symposium on medical imaging, pp 553–558
4. Chen DZ, Hu X, Huang Y, Li Y, Xu J (2001) Algorithms for congruent sphere packing and applications. In: Proceedings of the 17th annual ACM symposium on computational geometry, pp 212–221
5. Conway JH, Sloane NJA (1988) Sphere packings, lattices and groups. Springer, New York