In this paper the nodes of the hexagonal grid are used as points Three types of neighbors are used on this grid, therefore neighborhood sequences contain values 1, 2 and 3 The grid is coordinatized by three coordinates in a symmetric way Digital circles are classified based on digital distances using neighborhood sequences They can be triangle, hexagon, enneagon and dodecagon The corners of the convex hulls of these polygons are computed.