Discrete circles: analytical definition and generation in the hexagonal grid

Abstract

We propose an analytical definition of discrete circles in the hexagonal grid. Our approach is based on a non-constant thickness function. We determine the thickness using the (edge and vertex) flake model. Both types of circles are connected. We prove that edge flake circles are without simple points for integer radii. Incremental generation algorithms are deduced from the analytical characterization of both edge and vertex flake circles. We compare our approach with existing algorithms for the circle generation on the hexagonal grid. Our approach offers simpler algorithm and an analytical characterization that the other algorithms do not offer. The benefit of an analytical characterization is that it makes the question of the membership of a point to a primitive trivial.