G. Bradshaw and C. O. Sullivan, Adaptive medial-axis approximation for sphere-tree construction, ACM Transactions on Graphics, vol.23, issue.1, pp.1-26, 2004.
DOI : 10.1145/966131.966132

T. Calamoneri and R. Petreschi, An efficient orthogonal grid drawing algorithm for cubic graphs, Comp. and Combinatorics, pp.31-40, 1995.
DOI : 10.1007/BFb0030817

F. Cazals, T. Dreyfus, S. Sachdeva, and N. Shah, Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse-Graining, Computer Graphics Forum, vol.73, issue.1, pp.1-17, 2014.
DOI : 10.1111/cgf.12270
URL : https://hal.archives-ouvertes.fr/hal-01110229

F. Cazals and S. Loriot, Computing the arrangement of circles on a sphere, with applications in structural biology, Computational Geometry, vol.42, issue.6-7, pp.551-565, 2009.
DOI : 10.1016/j.comgeo.2008.10.004
URL : https://hal.archives-ouvertes.fr/inria-00118781

H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel et al., Arrangements of curves in the plane???topology, combinatorics, and algorithms, Theoretical Computer Science, vol.92, issue.2, pp.319-336, 1992.
DOI : 10.1016/0304-3975(92)90319-B

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.
DOI : 10.1137/0132071

B. Miklos, J. Giesen, and M. Pauly, Discrete scale axis representations for 3d geometry, In ACM Transactions on Graphics, vol.29, p.101, 2010.

C. Yap, Towards exact geometric computation, Computational Geometry, vol.7, issue.1-2, pp.3-23, 1997.
DOI : 10.1016/0925-7721(95)00040-2