A. O. Aak-*-09-]-aichholzer, P. S. Korn-berger-b, and R. G. Sturm-a, VEGTER c 2013 The Author(s) c 2013 The Eurographics Association and

A. , A. N. Choi-s, . K. Dey-t, and . Leekha-n, A simple algorithm for homeomorphic surface reconstruction, In SoCG, issue.2, pp.213-222, 2000.

. [. Cohen-steiner-d, . Tong-y, and . Des-brun-m, Voronoi-based variational reconstruction of unoriented point sets, In SGP, issue.2, pp.39-48, 2007.

S. [. Saboret-l, Point set processing, 2013.

B. Y. Kolmogorov-v, An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, PAMI, vol.26, issue.9 8, pp.1124-1137, 2004.

]. Boi84, Geometric structures for threedimensional shape representation, ACM Trans. Graph, vol.3, issue.4, pp.266-286, 1984.

C. J. Beatson-r, C. J. , M. T. , F. W. Mccallum-b, and . R. Evans-t, Reconstruction and representation of 3D objects with radial basis functions, SIGGRAPH, pp.67-76, 2001.

[. Labatut-p and P. , Robust piecewise-planar 3D reconstruction and completion from largescale unstructured point data, CVPR, pp.1261-1268, 2010.

]. Din70 and . A. Dinic-e, Algorithm for solution of a problem of maximum flow in networks with power estimation, Soviet Mathematics Doklady, vol.11, issue.8, pp.1277-1280, 1970.

. [. Kirkpatrick-d and . Seidel-r, On the shape of a set of points in the plane, In IEEE Trans. Inf. Th, vol.29, issue.2, pp.551-559, 1983.

. [. Tarjan-r, A new approach to the maximum-flow problem, J. ACM, vol.35, issue.4 8, pp.921-940, 1988.

P. [. Keriven-r, Robust and efficient surface reconstruction from range data, Comp. Graph. Forum, vol.28, issue.10, pp.2275-2290, 2009.

. Mullen-p, . F. De, . Desbrun-m, and A. P. Cohen-steiner-d, Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets, Computer Graphics Forum, vol.2005, issue.5, pp.1733-1741, 2010.
DOI : 10.1111/j.1467-8659.2010.01782.x

T. L. Miller-g, T. N. Walk-ington, and W. H. , Control volume meshes using sphere packing, IMR, pp.47-61, 1996.
DOI : 10.1007/BFb0018533

S. , S. R. Degener-p, and . Klein-r, Completion and reconstruction with primitive shapes, Comp. Graph. Forum, vol.28, issue.2, pp.503-512, 2009.

S. H. Gärtner-k, Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations, IMR (2005), pp.147-163

]. She98 and . J. Shewchuk, A condition guaranteeing the existence of higher-dimensional constrained delaunay triangulations, SoCG, pp.76-85, 1998.

]. She02 and . J. Shewchuk, Constrained Delaunay tetrahedralizations and provably good boundary recovery, IMR, pp.193-204, 2002.

]. She03 and . J. Shewchuk, Updating and constructing constrained Delaunay and constrained regular triangulations by flips, SoCG, pp.181-190, 2003.

[. Shen-c and S. F. O-'brien-j, Interpolating and approximating implicit surfaces from polygon soup

S. S. Shamir-a, . Zhang-h, and . D. Cohen-or, Cone carving for surface reconstruction, ACM Trans. Graph, vol.29, issue.150 2, pp.1-15010, 2010.

. [. Wahl-r and . Klein-r, Efficient RANSAC for point-cloud shape detection, Comp. Graph. Forum, vol.26, issue.2 2, pp.214-226, 2007.

[. Grussenmeyer-p, Houghtransform and extended RANSAC algorithms for automatic detection of 3D building roof planes from lidar data, In IAPRS, vol.36, issue.2, 2007.

[. Tang-k.-p and C. , Surface reconstruction from LiDAR data with extended snake theory, EMMCVPR '07, pp.479-492, 2007.

. Van-kreveld-m, . Van-lankveld-t, . C. Veltkamp-r, . Van-kreveld-m, . Van-lankveld-t et al., On the shape of a set of points and lines in the plane, Watertight Scenes from Urban LiDAR and Planar Surfaces. Tech. Rep. UU-CS-2013-007, pp.1553-1562, 2011.
DOI : 10.1111/j.1467-8659.2011.02029.x