Digital Circlism as Algorithmic Art

Abstract

We present here an algorithmic solution to digital circlism, which is a contemporary rendition style in the media of digital art. The algorithmic artwork is processed within a few minutes by our algorithm, which makes it computationally attractive in comparison with its manual counterpart that requires tremendous diligence and apt craftsmanship throughout its hour-long processing. We show how the problem is mapped to circle packing in discrete space, once the segmentation is done. A greedy technique similar to the dynamic programming approach for solving the coin denomination problem is used to achieve the packing result. To aid the greedy technique, progressive Euclidean distance transform is resorted to. Variability of the denomination set and color rendition based on mapping the original color range to Macbeth color chart add to its further appeal. Results on different kinds of images speak about further possibilities of this new style of algorithmic art.