Approximating extent measures of points, Journal of the ACM, vol.51, issue.4, pp.606-635, 2004. ,
DOI : 10.1145/1008731.1008736
Automatic subspace clustering of high dimensional data for data mining applications, Proceeding SIGMOD '98 international conference on Management of data, pp.94-105, 1998. ,
The discrete analytical hyperspheres, IEEE Transactions on Visualization and Computer Graphics, vol.3, issue.1, pp.75-86, 1997. ,
DOI : 10.1109/2945.582354
Optimal consensus set and preimage of 4-connected circles in a noisy environment, 21st International Conference on Pattern Recognition, pp.3774-3777, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00790706
Computing constrained minimum-width annuli of point sets, Lecture Notes in Computer Science, vol.1272, pp.392-401, 1997. ,
DOI : 10.1007/3-540-63307-3_77
The largest empty annulus problem, Proceedings of the International Conference on Computational Science-Part III, pp.46-54, 2002. ,
Optimal outlier removal in high-dimensional spaces, Journal of Computer and System Sciences, vol.68, issue.2, pp.335-373, 2004. ,
DOI : 10.1016/j.jcss.2003.07.013
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. ,
DOI : 10.1145/358669.358692
Shape Fitting with Outliers, SIAM Journal on Computing, vol.33, issue.2, pp.269-285, 2004. ,
DOI : 10.1137/S0097539703427963
Finding circles by an array of accumulators, Communications of the ACM, vol.18, issue.2, 1975. ,
DOI : 10.1145/360666.360677
O(n 3 log n) time complexity for the optimal consensus set computation for 4-connected digital circles, 17-th International Conference on Discrete Geometry for Computer Imagery (DGCI13), pp.241-252, 2013. ,
On enclosing k points by a circle, Information Processing Letters, vol.53, issue.4, pp.217-221, 1995. ,
DOI : 10.1016/0020-0190(94)00190-A
Computing circular separability, Discrete & Computational Geometry, vol.12, issue.2, pp.105-113, 1986. ,
DOI : 10.1007/BF02187688
Efficient Robust Digital Annulus Fitting with Bounded Error, 17-th International Conference on Discrete Geometry for Computer Imagery (DGCI13), pp.253-264, 2013. ,
DOI : 10.1007/978-3-642-37067-0_22
URL : https://hal.archives-ouvertes.fr/hal-00827196
Fitting spheres by the method of least squares, Commun. ACM, vol.4, issue.11, p.491, 1961. ,
On Three Constrained Versions of the Digital Circular Arc Recognition Problem, 15-th International Conference on Discrete Geometry for Computer Imagery (DGCI09), pp.34-45, 2009. ,
DOI : 10.1016/0925-7721(93)90025-2
URL : https://hal.archives-ouvertes.fr/hal-00962589
ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE, International Journal of Computational Geometry & Applications, vol.09, issue.01, pp.97-108, 1999. ,
DOI : 10.1142/S021819599900008X
Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties, Discrete Applied Mathematics, vol.161, issue.16-17, pp.16-172662, 2013. ,
DOI : 10.1016/j.dam.2013.06.001
URL : https://hal.archives-ouvertes.fr/hal-00857691
Optimal consensus set for digital line and plane fitting, International Journal of Imaging Systems and Technology, vol.21, issue.1, pp.45-57, 2011. ,
DOI : 10.1002/ima.20269
URL : https://hal.archives-ouvertes.fr/hal-00493415
Optimal Consensus Set for Annulus Fitting, 16th International Conference on Discrete Geometry for Computer Imagery (DGCI11), pp.358-368, 2011. ,
DOI : 10.1007/978-3-642-19867-0_30
URL : https://hal.archives-ouvertes.fr/hal-00713674