A new Voronoi-based surface reconstruction algorithm, Proceedings of the 25th annual conference on Computer graphics and interactive techniques , SIGGRAPH '98, pp.415-412, 1998. ,
DOI : 10.1145/280814.280947
A simple algorithm for homeomorphic surface reconstruction, Proc. 16th Annu. ACM Sympos, pp.213-222, 2000. ,
Surface Reconstruction by Voronoi Filtering, Discrete & Computational Geometry, vol.22, issue.4, pp.481-504, 1999. ,
DOI : 10.1007/PL00009475
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
Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces, Discrete and Computational Geometry, vol.30, issue.3, 2001. ,
DOI : 10.1007/s00454-003-2824-x
URL : https://hal.archives-ouvertes.fr/inria-00072355
AUTOMATIC RECONSTRUCTION OF 3D CAD MODELS FROM DIGITAL SCANS, International Journal of Computational Geometry & Applications, vol.09, issue.04n05, pp.327-369, 1999. ,
DOI : 10.1142/S0218195999000236
The ball-pivoting algorithm for surface reconstruction, IEEE Transactions on Visualization and Computer Graphics, vol.5, issue.4, pp.349-359, 1999. ,
DOI : 10.1109/2945.817351
Geometric structures for three-dimensional shape representation, ACM Transactions on Graphics, vol.3, issue.4, pp.266-286, 1984. ,
DOI : 10.1145/357346.357349
Smooth surface reconstruction via natural neighbour interpolation of distance functions, Proc. 16th Annu. ACM Sympos, pp.223-232, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00072662
Natural neighbour coordinates of points on a surface, Computational Geometry -Theory and Application, vol.19, issue.2-3, pp.87-220, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00072626
Algorithmic Geometry, 1998. ,
DOI : 10.1017/CBO9781139172998
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams, Discrete & Computational Geometry, vol.18, issue.4, pp.433-454, 1997. ,
DOI : 10.1007/PL00009327
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
Delaunay triangulation programs on surface data, Proc. of 13th ACM-SIAM Symposium on Discrete Algorithms, 2002. ,
Higher-dimensional voronoi diagrams in linear expected time, Discrete & Computational Geometry, vol.43, issue.3, pp.343-367, 1991. ,
DOI : 10.1007/BF02574694
The expected number of k-faces of a Voronoi diagram, Computers & Mathematics with Applications, vol.26, issue.5, pp.13-21, 1993. ,
DOI : 10.1016/0898-1221(93)90068-7
Deformable Smooth Surface Design, Discrete & Computational Geometry, vol.21, issue.1, pp.87-115, 1999. ,
DOI : 10.1007/PL00009412
Nice point sets can have nasty Delaunay triangulations, Proc. 17th Annu. ACM Sympos, pp.96-105, 2001. ,
Dense point sets have sparse delaunay triangulations, Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002. ,
On the average complexity of 3d-voronoi diagrams of random points on convex polytopes, Proc. 12th Canad. Conf, 2000. ,
The probabilistic complexity of the voronoi diagram of points on a polyhedron, Proc. ACM Sym. on Computational Geometry, 2002. ,
Computing the medial surface of a solid from a domain Delaunay triangulation, Proceedings of the third ACM symposium on Solid modeling and applications , SMA '95, pp.201-212, 1995. ,
DOI : 10.1145/218013.218062
Deformable solid modeling using sampled medial surfaces: A multiscale approach, 2000. ,
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38330 Montbonnot-St, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex ,
BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399 ,