N. Amenta, S. Choi, and R. K. Kolluri, The power crust, Proceedings of the sixth ACM symposium on Solid modeling and applications , SMA '01, pp.249-266, 2001.
DOI : 10.1145/376957.376986

S. Beucher and C. Gratin, Micromorph reference manual, applications and solutions, 1989.

Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.11, pp.1222-1239, 2001.
DOI : 10.1109/34.969114

I. Braude, J. Marker, K. Museth, J. Nissanov, and D. Breen, Contour-based surface reconstruction using MPU implicit models, Graphical Models, vol.69, issue.2, 2007.
DOI : 10.1016/j.gmod.2006.09.007

E. Breen and R. Jones, Attribute Openings, Thinnings, and Granulometries, Computer Vision and Image Understanding, vol.64, issue.3, pp.377-389, 1996.
DOI : 10.1006/cviu.1996.0066

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the ACM, vol.47, issue.6, pp.1028-1047, 2000.
DOI : 10.1145/355541.355562

C. Couprie, L. Grady, L. Najman, and H. Talbot, Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest, 2009 IEEE 12th International Conference on Computer Vision, pp.731-738, 2009.
DOI : 10.1109/ICCV.2009.5459284

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

C. Couprie, L. Grady, L. Najman, and H. Talbot, Anisotropic diffusion using power watersheds, 2010 IEEE International Conference on Image Processing, pp.4153-4156, 2010.
DOI : 10.1109/ICIP.2010.5653896

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

C. Couprie, L. Grady, L. Najman, and H. Talbot, Power Watershed: A Unifying Graph-Based Optimization Framework, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.7, 2011.
DOI : 10.1109/TPAMI.2010.200

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.8, pp.1362-1374, 2009.
DOI : 10.1109/TPAMI.2008.173

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

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

R. Glowinski and P. Tallec, Augmented Lagrangian and operator-splitting methods in nonlinear mechanics, SIAM, 1989.
DOI : 10.1137/1.9781611970838

T. Goldstein and S. Osher, The Split Bregman Method for L1-Regularized Problems, SIAM Journal on Imaging Sciences, vol.2, issue.2, pp.323-343, 2009.
DOI : 10.1137/080725891

T. Goldstein, X. Bresson, and S. Osher, Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction, Journal of Scientific Computing, vol.80, issue.3, 2009.
DOI : 10.1007/s10915-009-9331-z

L. Grady, Random Walks for Image Segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.11, pp.1768-1783, 2006.
DOI : 10.1109/TPAMI.2006.233

T. Hirata, A unified linear-time algorithm for computing distance maps, Information Processing Letters, vol.58, issue.3, pp.129-133, 1996.
DOI : 10.1016/0020-0190(96)00049-X

H. Hoppe, T. Derose, T. Duchamp, J. Mcdonald, and W. Stuetzle, Surface reconstruction from unorganized points, ACM SIGGRAPH Computer Graphics, vol.26, issue.2, pp.71-78, 1992.
DOI : 10.1145/142920.134011

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

A. C. Jalba and J. B. Roerdink, Efficient Surface Reconstruction using Generalized Coulomb Potentials, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.6, pp.1512-1519, 2007.
DOI : 10.1109/TVCG.2007.70553

M. Kazhdan, M. Bolitho, and H. Hoppe, Poisson surface reconstruction, Proceedings of the fourth Eurographics symposium on Geometry processing, pp.61-70

M. M. Kazhdan, Reconstruction of solid models from oriented point sets, Symposium on Geometry Processing, pp.73-82, 2005.

V. Lempitsky, Surface extraction from binary volumes with higher-order smoothness, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010.
DOI : 10.1109/CVPR.2010.5539832

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

V. Lempitsky and Y. Boykov, Global Optimization for Shape Fitting, 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007.
DOI : 10.1109/CVPR.2007.383293

L. Najman and M. Couprie, Building the Component Tree in Quasi-Linear Time, IEEE Transactions on Image Processing, vol.15, issue.11, pp.3531-3539, 2006.
DOI : 10.1109/TIP.2006.877518

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

I. Ragnemalm, The Euclidean distance transform in arbitrary dimensions, Pattern Recognition Letters, vol.14, issue.11, pp.883-888, 1993.
DOI : 10.1016/0167-8655(93)90152-4

S. Setzer, Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage, International Conference on Scale Space and Variational Methods in Computer Vision. pp. 464?476. SSVM '09, 2009.
DOI : 10.1137/080724265

G. Strang, Maximum flows through a domain, Math. Prog, issue.26, pp.123-143, 1983.

J. Ye, X. Bresson, T. Goldstein, and S. Osher, A fast variational method for surface reconstruction from sets of scattered points, 2010.

H. K. Zhao, S. Osher, B. Merriman, and M. Kang, Implicit and Nonparametric Shape Reconstruction from Unorganized Data Using a Variational Level Set Method, Computer Vision and Image Understanding, vol.80, issue.3, pp.295-319, 1998.
DOI : 10.1006/cviu.2000.0875