]. K. Bro79 and . Brown, Voronoi Diagrams from Convex Hulls, Buz03] L. Buzer. A Linear Incremental Algorithm for Naive and Standard Digital Lines and Planes Recognition. Graphical Model, pp.223-22861, 1979.

D. Coeurjolly, Y. Gérard, J. Reveilì, L. Tougne, M. Overmars et al., An Elementary Algorithm for Digital Arc Segmentation The Linear Time Recognition of Digital Arcs Computation geometry, algorithms and applications Subpixel Image Registration Using Circular Fiducials On the Shape of a Set of Points in the Plane Separating Points Sets by Circles, and the Recognition of Digital Disks An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set Digital Disks and a Digital Compactness Measure New Definition and Fast Recognition of Digital Straight Segments and Arcs Computational geometry : an introduction, Annual ACM Symposium on Theory of Computing Internation Conference on Pattern Analysis and Machine IntelligenceOKM86] J. O'Rourke, S. R. Kosaraju, and N. Meggido. Computing Circular Separability . Discrete and Computational GeometryPha92] S. Pham. Digital Circles With Non-Lattice Point Centers. The Visual ComputerPS85] F. P. Preparata and M. I. Shamos, pp.31-50543, 1972.

T. Roussillon, I. Sivignon, L. Tougnesau93-]-p, A. W. Sauer, and . Smeulders, Test of Circularity and Measure of Circularity for Digital Curves On the Recognition of Digital Circles in Linear Time Digitized Circular Arcs: Characterization and Parameter Estimation, International Conference on Image Processing, Computer Vision and Pattern Recognition, pp.518-524287, 1993.