P. K. Agarwal and J. Pan, Near-Linear Algorithms for Geometric Hitting Sets and Set Covers, Annual Symposium on Computational Geometry, SOCG'14, p.271, 2014.
DOI : 10.1145/2582112.2582152

N. Amenta and R. K. Kolluri, Accurate and efficient unions of balls, Proceedings of the sixteenth annual symposium on Computational geometry , SCG '00, pp.119-128, 2000.
DOI : 10.1145/336154.336193
URL : http://net.cs.utexas.edu/users/amenta/pubs/unions.ps.gz

D. Attali, J. D. Boissonnat, and H. Edelsbrunner, Stability and Computation of Medial Axes - a State-of-the-Art Report, pp.109-125, 2009.
DOI : 10.1007/b106657_6
URL : https://hal.archives-ouvertes.fr/hal-00468690

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
URL : http://isg.cs.tcd.ie/cosulliv/Pubs/spheretree.pdf

H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite vc-dimension

A. Broutta, D. Coeurjolly, and I. Sivignon, Hierarchical Discrete Medial Axis for Sphere-Tree Construction, International Workshop on Combinatorial Image Analysis, pp.56-67, 2009.
DOI : 10.1007/978-3-642-10210-3_5
URL : https://hal.archives-ouvertes.fr/hal-00977518

S. Cabello, D. Berg, M. Giannopoulos, P. Knauer, C. Van-oostrum et al., MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION, International Journal of Computational Geometry & Applications, vol.1, issue.06, pp.533-556, 2009.
DOI : 10.1007/BF02574706

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.1002/prot.22052
URL : https://hal.archives-ouvertes.fr/hal-01110229

J. Chaussard, M. Couprie, and H. Talbot, Robust skeletonization using the discrete ??-medial axis, Pattern Recognition Letters, vol.32, issue.9, pp.1384-1394, 2011.
DOI : 10.1016/j.patrec.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00622523

F. Chazal and A. Lieutier, The ?????-medial axis???, Graphical Models, vol.67, issue.4, pp.304-331, 2005.
DOI : 10.1016/j.gmod.2005.01.002

V. Chvatal, A Greedy Heuristic for the Set-Covering Problem, Mathematics of Operations Research, vol.4, issue.3, pp.233-235, 1979.
DOI : 10.1287/moor.4.3.233

D. Coeurjolly and A. Montanvert, Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.3, pp.437-448, 2007.
DOI : 10.1109/TPAMI.2007.54
URL : https://hal.archives-ouvertes.fr/hal-00148621

T. Culver, J. Keyser, and D. Manocha, Accurate computation of the medial axis of a polyhedron, Proceedings of the fifth ACM symposium on Solid modeling and applications , SMA '99, pp.179-190, 1999.
DOI : 10.1145/304012.304030

T. K. Dey and W. Zhao, Approximate medial axis as a Voronoi subcomplex, Computer-Aided Design, vol.36, issue.2, pp.195-202, 2004.
DOI : 10.1016/S0010-4485(03)00061-7

H. Edelsbrunner and P. Koehl, The geometry of biomolecular solvation. Combinatorial and computational geometry 52, pp.243-275, 2005.

H. Federer, Curvature measures, Transactions of the American Mathematical Society, vol.93, issue.3, pp.418-491, 1959.
DOI : 10.1090/S0002-9947-1959-0110078-1

J. Feinauer, A. Spettl, I. Manke, S. Strege, A. Kwade et al., Structural characterization of particle systems using spherical harmonics, Materials Characterization, vol.106, pp.123-133, 2015.
DOI : 10.1016/j.matchar.2015.05.023

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

S. Har-peled, Geometric approximation algorithms, 2011.
DOI : 10.1090/surv/173
URL : http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/book.pdf

A. Hatcher, Algebraic topology, 2002.

P. M. Hubbard, Collision detection for interactive graphics applications, IEEE Transactions on Visualization and Computer Graphics, vol.1, issue.3, pp.218-230, 1995.
DOI : 10.1109/2945.466717

P. M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM Transactions on Graphics, vol.15, issue.3, pp.179-210, 1996.
DOI : 10.1145/231731.231732
URL : http://www.graphics.cornell.edu/~pmh/tog96.ps.gz

D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, vol.9, issue.3, pp.256-278, 1974.
DOI : 10.1016/S0022-0000(74)80044-9

R. Kershner, The Number of Circles Covering a Set, American Journal of Mathematics, vol.61, issue.3, pp.665-671, 1939.
DOI : 10.2307/2371320

B. Miklos, J. Giesen, and M. Pauly, Discrete scale axis representations for 3d geometry, In: ACM Transactions on Graphics (TOG), vol.29, p.101, 2010.
DOI : 10.1145/1833351.1778838
URL : http://www.cs.jhu.edu/%7Emisha/ReadingSeminar/Papers/Miklos10.pdf

T. B. Nguyen and I. Sivignon, Epsilon-covering: a greedy optimal algorithm for simple shapes, Canadian Conference on Computational Geometry, pp.187-194, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01400434

J. Pach, New Trends in Discrete and Computational Geometry. Algorithms and Combinatorics, 2012.

V. Ranjan and A. Fournier, Matching and Interpolation of Shapes using Unions of Circles, Computer Graphics Forum, vol.15, issue.3, pp.129-142, 1996.
DOI : 10.1111/1467-8659.1530129

P. J. De-rezende, F. K. Miyazawa, and A. T. Sasaki, A PTAS for the disk cover problem of geometric objects, Operations Research Letters, vol.41, issue.5, pp.552-555, 2013.
DOI : 10.1016/j.orl.2013.06.014

J. Serra, Image analysis and mathematical morphology, 1982.

G. F. Tóth, Handbook of Discrete and Computational Geometry, chap. Packing and covering, CRC, 2004.

R. Wein and B. Zukerman, Exact and efficient construction of planar arrangements of circular arcs and line segments with applications, 2006.