P. K. Agarwal and S. Suri, Surface Approximation and Geometric Partitions, SIAM Journal on Computing, vol.27, issue.4, pp.1016-1035, 1998.
DOI : 10.1137/S0097539794269801

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7595

P. D. Alevizos, J. Boissonnat, and M. Yvinec, Non-convex contour reconstruction, Journal of Symbolic Computation, vol.10, issue.3-4, pp.225-252, 1990.
DOI : 10.1016/S0747-7171(08)80063-6

URL : http://doi.org/10.1016/s0747-7171(08)80063-6

P. Alliez, D. Cohen-steiner, M. Desbrun, P. Schröder, and M. Yvinec, Variational tetrahedral meshing, Proceedings SIGGRAPH, 2005.
DOI : 10.1145/1186822.1073238

URL : https://hal.archives-ouvertes.fr/inria-00226418

P. Alliez, D. Cohen-steiner, O. Devillers, B. Levy, and M. Desbrun, Anisotropic polygonal remeshing, Conference Proceedings, 2003.
DOI : 10.1145/1201775.882296

URL : https://hal.archives-ouvertes.fr/inria-00071778

P. Alliez, E. Colin-de-verdière, O. Devillers, and M. Isenburg, Isotropic surface remeshing, 2003 Shape Modeling International., pp.49-58, 2003.
DOI : 10.1109/SMI.2003.1199601

URL : https://hal.archives-ouvertes.fr/inria-00413144

N. Amenta and M. Bern, Surface Reconstruction by Voronoi Filtering, Discrete & Computational Geometry, vol.22, issue.4, pp.481-504, 1999.
DOI : 10.1007/PL00009475

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.71

N. Amenta, S. Choi, T. K. Dey, and N. Leekha, A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION, International Journal of Computational Geometry & Applications, vol.12, issue.01n02, pp.125-141, 2002.
DOI : 10.1142/S0218195902000773

N. Amenta, S. Choi, and R. K. Kolluri, The power crust, unions of balls, and the medial axis transform, Computational Geometry, vol.19, issue.2-3, pp.127-153, 2001.
DOI : 10.1016/S0925-7721(01)00017-7

N. Amenta, T. J. Peters, and A. C. , Computational topology: ambient isotopic approximation of 2-manifolds, Theoretical Computer Science, vol.305, issue.1-3, pp.1-33, 2003.
DOI : 10.1016/S0304-3975(02)00691-6

D. Attali and J. Boissonnat, A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces, Discrete and Comp. Geometry, pp.369-384, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00072135

D. Attali, J. Boissonnat, and H. Edelsbrunner, Stability and computation of the medial axis ? a stateof-the-art report, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, 2004.

D. Attali, J. Boissonnat, and A. Lieutier, Complexity of the delaunay triangulation of points on surfaces the smooth case, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.201-210, 2003.
DOI : 10.1145/777792.777823

A. Axelsson and A. M. Intosh, Hodge decompositions on weakly Lipschitz domains Advances in Analysis and Geometry: New Developments Using Clifford Algebras, 2004.

M. Berger and B. Costiaux, Differential Geometry: Manifolds, Curves, and Surfaces, Graduate Texts in Mathematics Series, vol.115, p.474, 1988.
DOI : 10.1007/978-1-4612-1033-7

P. Bhattacharya, Efficient neighbor finding algorithms in quadtree and octree. Master's thesis, Indian Institute of Technology, 2001.

J. Bloomenthal, Polygonization of implicit surfaces, Computer Aided Geometric Design, vol.5, issue.4, pp.341-355, 1988.
DOI : 10.1016/0167-8396(88)90013-1

J. Boissonnat and F. Cazals, Natural neighbor coordinates of points on a surface, Computational Geometry, vol.19, issue.2-3, pp.155-173, 2001.
DOI : 10.1016/S0925-7721(01)00018-9

J. Boissonnat and F. Cazals, Smooth surface reconstruction via natural neighbour interpolation of distance functions, Comp. Geometry: Theory and Applications, pp.185-203, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072662

J. Boissonnat, D. Cohen-steiner, and G. Vegter, Isotopic implicit surface meshing, Proc. 36th Annu. Sympos. on Theory of Computing, pp.301-309, 2004.
DOI : 10.1007/978-0-387-87363-3_9

URL : https://hal.archives-ouvertes.fr/hal-00488819

J. Boissonnat, L. J. Guibas, and S. Oudot, Learning smooth objects by probing, Proc. 21st Annu, pp.198-207, 2005.

J. Boissonnat, L. J. Guibas, and S. Oudot, Learning smooth objects by probing, Proc. 21st Annu, pp.364-365, 2005.

J. Boissonnat and S. Oudot, Provably good sampling and meshing of surfaces, Graphical Models, vol.67, issue.5, pp.405-451, 2005.
DOI : 10.1016/j.gmod.2005.01.004

URL : https://hal.archives-ouvertes.fr/hal-00488829

J. Boissonnat and M. Yvinec, Probing a scene of non convex polyhedra, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.321-342, 1992.
DOI : 10.1145/73833.73860

URL : https://hal.archives-ouvertes.fr/inria-00075449

C. Boivin and C. Ollivier-gooch, Guaranteed-quality triangular mesh generation for domains with curved boundaries, International Journal for Numerical Methods in Engineering, vol.24, issue.10, pp.1185-1213, 2002.
DOI : 10.1002/nme.542

H. Borouchaki, Geometric surface mesh, Int. Conf. on Integrated and Manufacturing in Mechanical Engineering, pp.343-350, 1998.

H. Borouchaki, P. L. George, F. Hecht, P. Laug, and E. Saltel, Delaunay mesh generation governed by metric specifications. Part I. Algorithms, Finite Elements in Analysis and Design, vol.25, issue.1-2, pp.61-83, 1997.
DOI : 10.1016/S0168-874X(96)00057-1

E. Brieskorn and H. Knörrer, Plane Algebraic Curves, Birkhaüser, 1986.
DOI : 10.1007/978-3-0348-0493-6

M. D. Carmo, Differential Geometry of Curves and Surfaces, 1976.

F. Cazals and J. Giesen, Delaunay Triangulation Based Surface Reconstruction, Research Report, vol.5393, 2004.
DOI : 10.1007/978-3-540-33259-6_6

URL : https://hal.archives-ouvertes.fr/inria-00070609

F. Cazals, J. Giesen, and M. Yvinec, Delaunay Triangulation Based Surface Reconstruction, Research Report, vol.5394, 2004.
DOI : 10.1007/978-3-540-33259-6_6

URL : https://hal.archives-ouvertes.fr/inria-00070609

F. Cazals and M. Pouget, Estimating differential quantities using polynomial fitting of osculating jets, Proc. 1st Symp. on Geometry Processing, pp.177-187, 2003.
DOI : 10.1016/j.cagd.2004.09.004

URL : https://hal.archives-ouvertes.fr/hal-00103047

F. Chazal and A. Lieutier, Weak feature size and persistent homology, Proceedings of the twenty-first annual symposium on Computational geometry , SCG '05, 2004.
DOI : 10.1145/1064092.1064132

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

F. Chazal and A. Lieutier, Weak feature size and persistent homology, Proceedings of the twenty-first annual symposium on Computational geometry , SCG '05, pp.255-262, 2005.
DOI : 10.1145/1064092.1064132

Y. Chen and W. Hsu, PARALLEL THINNING ALGORITHM FOR BINARY DIGITAL PATTERNS, Handbook of Pattern Recognition and Computer Vision, pp.458-461, 1993.
DOI : 10.1142/9789814343138_0016

H. Cheng, T. K. Dey, H. Edelsbrunner, and J. M. Sullivan, Dynamic Skin Triangulation, Discrete & Computational Geometry, vol.25, issue.4, pp.525-568, 2001.
DOI : 10.1007/s00454-001-0007-1

H. Cheng and X. Shi, Guaranteed quality triangulation of molecular skin surfaces, VIS '04: Proceedings of the conference on Visualization '04, pp.481-488, 2004.

S. Cheng and T. K. Dey, Quality Meshing with Weighted Delaunay Refinement, SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, pp.137-146, 2002.
DOI : 10.1137/S0097539703418808

S. Cheng, T. K. Dey, E. A. Ramos, and T. Ray, Sampling and meshing a surface with guaranteed topology and geometry, Proc. 20th Annu, pp.280-289, 2004.

S. Cheng, T. K. Dey, E. A. Ramos, and T. Ray, QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES, International Journal of Computational Geometry & Applications, vol.15, issue.04, pp.421-461, 2005.
DOI : 10.1142/S0218195905001774

E. Chernyaev, Marching cubes 33: Construction of topologically correct isosurfaces, 1995.

L. P. Chew, Guaranteed-quality mesh generation for curved surfaces, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, pp.274-280, 1993.
DOI : 10.1145/160985.161150

F. H. Clarke, Generalized gradients and applications, Transactions of the American Mathematical Society, vol.205, pp.247-262, 1975.
DOI : 10.1090/S0002-9947-1975-0367131-6

F. H. Clarke, Optimization and Nonsmooth Analysis, Classics in applied mathematics. SIAM, 1990.
DOI : 10.1137/1.9781611971309

D. Cohen-steiner, E. Colin-de-verdière, and M. Yvinec, Conforming Delaunay triangulations in 3D, Computational Geometry: Theory and Applications, pp.217-233, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00072243

D. Cohen-steiner and J. Morvan, Restricted delaunay triangulations and normal cycle, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.237-246, 2003.
DOI : 10.1145/777792.777839

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.5140

R. Cole and C. K. Yap, Shape from probing, Journal of Algorithms, vol.8, issue.1, pp.19-38, 1987.
DOI : 10.1016/0196-6774(87)90025-3

H. L. De-cougny and M. S. Shephard, Surface meshing using vertex insertion, Proc. 5th International Meshing Roundtable, pp.243-256, 1996.

S. Dey, R. O. Bara, and M. S. Shephard, Curvilinear mesh generation in 3d, Proc. 8th Internat. Meshing Roundtable, pp.407-417, 1999.

T. K. Dey, S. Funke, and E. A. Ramos, Surface reconstruction in almost linear time under locally uniform sampling, Abstracts 17th European Workshop Comput. Geom, pp.129-132, 2001.

T. K. Dey and J. Giesen, Detecting undersampling in surface reconstruction, Proc. 17th Annu. ACM Sympos, pp.257-263, 2001.

T. K. Dey and S. Goswami, Tight cocone, Proceedings of the eighth ACM symposium on Solid modeling and applications , SM '03, pp.302-307, 2003.
DOI : 10.1145/781606.781627

T. K. Dey and S. Goswami, Provable surface reconstruction from noisy samples, Proc. 20th Annu. ACM Sympos, pp.330-339, 2004.

T. K. Dey, G. Li, and T. Ray, Polygonal surface remeshing with Delaunay refinement, Proc. 14th Internat. Meshing Roundtable, 2005.

T. K. Dey and J. Sun, An adaptive MLS surface for reconstruction with guarantees, Proc. 3rd Symposium on Geometry Processing, pp.43-52, 2005.

T. K. Dey and W. Zhao, Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee, Algorithmica, vol.38, issue.1, pp.179-200, 2004.
DOI : 10.1007/s00453-003-1049-y

H. Edelsbrunner, Geometry and Topology for Mesh Generation, 2001.

H. Edelsbrunner and D. Guoy, An experimental study of sliver exudation Engineering With Computers, Special Issue on 'Mesh Generation, pp.229-240, 2002.

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological Persistence and Simplification, Discrete & Computational Geometry, vol.28, issue.4, pp.511-533, 2002.
DOI : 10.1007/s00454-002-2885-2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8802

H. Edelsbrunner and N. R. Shah, Triangulating Topological Spaces, International Journal of Computational Geometry & Applications, vol.07, issue.04, pp.365-378, 1997.
DOI : 10.1142/S0218195997000223

J. Erickson, Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?, SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.125-134, 2002.
DOI : 10.1007/s00454-004-1089-3

URL : http://arxiv.org/pdf/cs/0110030v1.pdf

J. Erickson, Nice Point Sets Can Have Nasty Delaunay Triangulations, Discrete and Computational Geometry, vol.30, issue.1, pp.109-132, 2003.
DOI : 10.1007/s00454-003-2927-4

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

H. Federer, Geometric Measure Theory, Classics in Mathematics, 1996.
DOI : 10.1007/978-3-642-62010-2

P. Frey, About surface remeshing, Proc. 9th Internat. meshing roundtable, pp.123-136, 2000.

J. H. Fu, Tubular neighborhoods in Euclidean spaces, Duke Mathematical Journal, vol.52, issue.4, pp.1025-1046, 1985.
DOI : 10.1215/S0012-7094-85-05254-8

P. George, F. Hecht, and E. Saltel, Fully automatic mesh generator for 3D domains of any shape, IMPACT of Computing in Science and Engineering, vol.2, issue.3, pp.187-218, 1990.
DOI : 10.1016/0899-8248(90)90012-Y

P. George, F. Hecht, and E. Saltel, Automatic mesh generator with specified boundary, Computer Methods in Applied Mechanics and Engineering, vol.92, issue.3, pp.269-288, 1991.
DOI : 10.1016/0045-7825(91)90017-Z

J. Giesen and U. Wagner, Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. Discrete and Computational Geometry, pp.245-267, 2004.

M. Gopi, Theory and practice of sampling and reconstruction for manifolds with boundaries, 2001.

K. Grove, Critical point theory for distance functions, Proc. of Symposia in Pure Mathematics, 1993.
DOI : 10.1090/pspum/054.3/1216630

P. M. Gruber, Approximation of convex bodies, Convexity and its Applications, pp.131-162, 1983.
DOI : 10.1007/978-3-0348-5858-8_7

J. C. Hart and B. T. Stander, Guaranteeing the topology of an implicit surface polygonization for interactive modeling, Proc. SIGGRAPH, pp.279-286, 1997.

M. W. Hirsch, Differential Topology, 1976.
DOI : 10.1007/978-1-4684-9449-5

H. Hoppe, T. Derose, T. Duchamp, J. Mcdonald, and W. Stuetzle, Surface reconstruction from unorganized points, Proc. SIGGRAPH '92, pp.71-78, 1992.
DOI : 10.1145/142920.134011

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.4735

R. Kolluri, Provably good moving least squares, Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pp.1008-1017, 2005.

N. Kruithof and G. Vegter, Meshing Skin Surfaces with Certified Topology, Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05), 2004.
DOI : 10.1109/CAD-CG.2005.57

P. Laug and H. Borouchaki, Molecular Surface Modeling and Meshing, Proc. 10th International Meshing Roundtable, pp.31-41, 2001.
DOI : 10.1007/s003660200018

P. Laug, H. Bourouchaki, and P. George, Maillage de courbes gouverné par une carte de métriques, 1996.

D. Levin, Mesh-Independent Surface Interpolation, Geometric Modeling for Scientific Visualization, 2003.
DOI : 10.1007/978-3-662-07443-5_3

X. Li and S. Teng, Generating well-shaped delaunay meshed in 3d, SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.28-37, 2001.

A. Lieutier, Any open bounded subset of has the same homotopy type as its medial axis, Computer-Aided Design, vol.36, issue.11, pp.1029-1046, 2004.
DOI : 10.1016/j.cad.2004.01.011

M. Lindenbaum and A. M. Bruckstein, Blind approximation of planar convex sets, IEEE Transactions on Robotics and Automation, vol.10, issue.4, pp.517-529, 1994.
DOI : 10.1109/70.313101

W. Lorensen and H. Cline, Marching cubes: A high resolution 3D surface construction algorithm, ACM SIGGRAPH Computer Graphics, vol.21, issue.4, pp.163-170, 1987.
DOI : 10.1145/37402.37422

D. Mavriplis, Cfd in aerospace in the new millenium, Canadian Aeronautics and Space Journal, vol.46, issue.4, pp.167-176, 2000.

G. L. Miller, D. Talmor, and S. Teng, DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS, International Journal of Computational Geometry & Applications, vol.09, issue.06, pp.577-599, 1999.
DOI : 10.1142/S0218195999000339

F. Morgan, Geometric Measure Theory: a Beginner's Guide, 1988.

J. Morvan and B. Thibert, Approximation of the Area of Surfaces, 2002.
DOI : 10.1007/978-3-540-73792-6_15

F. Murat and J. Simon, Sur le contrôle par un domaine géométrique. Pré-publication du Laboratoire d'Analyse Numérique 74015, 1976.

J. Ne?as, Les méthodes directes en théorie des équations elliptiques, 1967.

P. P. Pebay and T. J. Baker, Comparison of triangle quality measures, Proc. 10th Internat. Meshing Roundtable, pp.327-340, 2001.

S. Plantinga and G. Vegter, Isotopic approximation of implicit curves and surfaces, Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing , SGP '04, pp.251-260, 2004.
DOI : 10.1145/1057432.1057465

T. J. Richardson, Approximation of Planar Convex Sets from Hyperplane Probes, Discrete & Computational Geometry, vol.18, issue.2, pp.151-177, 1997.
DOI : 10.1007/PL00009313

G. Rote, Die Konvergenzrate des Sandwich-Algorithmus zur Approximation konvexer Funktionen, Computing, vol.10, issue.3-4, pp.337-361, 1992.
DOI : 10.1007/BF02238642

J. Ruppert, A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation, Journal of Algorithms, vol.18, issue.3, pp.548-585, 1995.
DOI : 10.1006/jagm.1995.1021

V. V. Savchenko, A. A. Pasko, O. G. Okunev, and T. L. Kunii, Function Representation of Solids Reconstructed from Scattered Surface Points and Contours, Computer Graphics Forum, vol.14, issue.4, pp.181-188, 1995.
DOI : 10.1111/1467-8659.1440181

A. Scheffer and A. Ungor, Efficient adaptive meshing of parametric models, Proc. 6th ACM Sympos. Solid Modeling and Applications, pp.59-70, 2001.

J. R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.86-95, 1998.
DOI : 10.1145/276884.276894

J. R. Shewchuk, What is a good linear element? Interpolation, conditioning, and quality measures, Proc. 11th Internat. Meshing Roundtable, pp.115-126, 2002.

K. Shimada and D. C. Gossard, Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis, Computer Aided Geometric Design, vol.15, issue.3, 1998.
DOI : 10.1016/S0167-8396(97)00037-X

R. Sibson, A brief description of natural neighbour interpolation, Interpreting Multivariate Data, pp.21-36, 1981.

S. S. Skiena, Geometric Reconstruction Problems, Handbook of Discrete and Computational Geometry, pp.481-490, 1997.
DOI : 10.1201/9781420035315.ch29

S. Teng and C. W. Wong, UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES, International Journal of Computational Geometry & Applications, vol.10, issue.03, pp.227-266, 2000.
DOI : 10.1142/S0218195900000152

J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski, Information-based Complexity, 1988.

J. F. Traub and A. G. Werschulz, Complexity and Information, 1998.

P. Trébuchet, Vers une résolution stable et rapide des équations algébriques, 2002.

J. R. Tristano, S. J. Owen, and S. A. Canann, Advancing front surface mesh generation in parametric space using a Riemannian surface definition, Proc. 7th international meshing reoundtable, pp.429-445, 1998.

L. Velho, Simple and Efficient Polygonization of Implicit Surfaces, Journal of Graphics Tools, vol.2, issue.4, pp.5-24, 1996.
DOI : 10.1016/0146-664X(82)90169-1

L. Velho, J. Gomes, and L. H. De-figueiredo, Implicit objects in Computer Graphics, 2002.
DOI : 10.1007/b97350