D. Aiger, Y. Kenmochi, H. Talbot, and L. Buzer, Efficient robust digital hyperplane fitting with bounded error, Proceedings of DGCI, vol.6607, pp.223-234, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790712

N. Amenta, D. Attali, and O. Devillers, A tight bound for the delaunay triangulation of points on a polyhedron, Discrete & Computational Geometry, vol.48, pp.19-38, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00784900

N. Amenta, S. Choi, T. K. Dey, and N. Leekha, A simple algorithm for homeomorphic surface reconstruction, International Journal of Computational Geometry and Applications, pp.213-222, 2000.

S. L. Arlinghaus, Practical Handbook of Curve Fitting, 1994.

C. B. Barber, D. P. Dobkin, D. P. Dobkin, and H. Huhdanpaa, The quickhull algorithm for convex hulls, ACM Trans. Math. Softw, vol.22, issue.4, pp.469-483, 1996.

M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Lecture Notes Series on Computing, Computing in Euclidean Geometry, pp.47-123, 1995.

J. D. Boissonnat, O. Devillers, and S. Hornus, Incremental construction of the delaunay graph in medium dimension, Annual Symposium on Computational Geometry, pp.208-216, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00412437

J. D. Boissonnat and M. Yvinec, Algorithmic geometry, 1998.

H. Cevikalp, Best fitting hyperplanes for classification, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.39, issue.6, pp.1076-1088, 2016.

. Cgal-team, Cgal: The computational geometry algorithms library, 2019.

N. Chernov, Circular and linear regression: Fitting circles and lines by least squares, CRC Pres, 2010.

O. Chum, Two-view geometry estimation by random sample and consensus, 2005.

B. Delaunay, Sur la sphère vide (1934), bulletin de l'Acadmie des Sciences de l'URSS, Classe des Sciences Mathmatiques et Naturelles

T. K. Dey, Curve and surface reconstruction : Algorithms with mathematical analysis, 2006.

R. Duda and P. Hart, Use of the hough transformation to detect lines and curves in pictures, Communications of the ACM, vol.15, pp.11-15, 1972.

M. Fischler and R. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM, vol.24, issue.6, pp.381-395, 1981.

Z. Gajic, , 2003.

P. V. Hough, Machine analysis of bubble chamber pictures, International. Conference on High Energy Accelerators and Instrumentation, pp.554-556, 1959.

Y. Kenmochi, L. Buzer, A. Sugimoto, and I. Shimizu, Discrete plane segmentation and estimation from a point cloud using local geometric patterns, Journal of Automation and Computing, vol.5, issue.3, pp.246-256, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00622344

Y. Kenmochi, H. Talbot, and L. Buzer, Efficiently computing optimal consensus of digital line fitting, Proceedings of ICPR, pp.1064-1067, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00790826

K. Köster and M. Spann, An approach to robust clustering -application to range image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.2, pp.430-444, 2000.

O. R. Musin, Properties of the delaunay triangulation, Proceedings of the thirteenth annual symposium on Computational geometry, 1997.

P. Ngo, H. Nasser, and I. Debled-rennesson, A discrete approach for decomposing noisy digital contours into arcs and segments, Proceedings of RRPR, in workshop of ACCV, vol.10117, pp.493-505, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01375089

, NIST/SEMATECH: e-Handbook of Statistical Methods, 2012.

M. S. Phan, Y. Kenmochi, A. Sugimoto, H. Talbot, E. Andres et al., Efficient robust digital annulus fitting with bounded error, Proceedings of DGCI, vol.7749, pp.253-264, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00827196

S. Raimund, The upper bound theorem for polytopes: an easy proof of its asymptotic version, Computational Geometry, vol.5, pp.115-116, 1995.

V. T. Rajan, Optimality of the delaunay triangulation in r d, Discrete and Computational Geometry, vol.12, issue.1, pp.189-202, 1994.

J. P. Reveillès, Géométrie discrète, calculs en nombre entiers et algorithmique (1991), thèse d'état

P. J. Rousseeuw, Least median of squares regression, Journal of the American statistical association, vol.79, issue.388, pp.871-880, 1984.

S. R. Searle and M. H. Gruber, Linear Models, 2016.

H. Shum, K. Ikeuchi, and R. Reddy, Principal component analysis with missing data and its application to polyhedral object modeling, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.17, issue.9, pp.854-867, 1995.

I. Sivignon, F. Dupont, and J. M. Chassery, Decomposition of a three-dimensional discrete object surface into discrete plane pieces, Algorithmica, vol.38, issue.1, pp.25-43, 2004.

B. Zitová and J. Flusser, Image registration methods: a survey, Image and Vision Computing, vol.21, issue.11, pp.977-1000, 2003.

R. Zrour, Y. Kenmochi, H. Talbot, L. Buzer, Y. Hamam et al., Optimal consensus set for digital line and plane fitting, International Journal of Imaging Systems and Technology, vol.21, issue.1, pp.45-57, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00493415