Formone helps you to create generative art from any kind of photo or image using the following effects: Voronoi stippling, Dithering... It also can be used as a custom vectorization software each artwork could be exporting to vector format and used for hi-quality printing, engraving, and for CNC machines.

Effects

This effect applies a weighted variant of Lloyd’s algorithm to implement stippling. Points are initially positioned randomly using rejection sampling, then at each iteration, the Voronoi cell centroids are weighted by the lightness of the contained pixels. This effect applies a weighted variant of Lloyd’s algorithm to implement stippling.

Points are initially positioned randomly using rejection sampling, then at each iteration, the Voronoi cell centroids are weighted by the lightness of the contained pixels.

Dithering is used in computer graphics to create the illusion of color depth in images on systems with a limited color palette. In a dithered image, colors that are not available in the palette are approximated by a diffusion of colored pixels from within the available palette. The human eye perceives the diffusion as a mixture of the colors within it (see color vision). Dithered images, particularly those using palettes with relatively few colors, can often be distinguished by a characteristic graininess or speckled appearance.

The original theory, a reaction–diffusion theory of morphogenesis, has served as an important model in theoretical biology. Reaction–diffusion systems have attracted much interest as a prototype model for pattern formation. Patterns such as fronts, hexagons, spirals, stripes and dissipative solitons are found as solutions of Turing-like reaction–diffusion equations.

Turing proposed a model wherein two homogeneously distributed substances (P and S) interact to produce stable patterns during morphogenesis. These patterns would represent regional differences in the concentrations of the two substances. Their interactions would produce an ordered structure out of random chaos.

In mathematics and computational geometry, a Delaunay triangulation (also known as a Delone triangulation) for a given set P of discrete points in a plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation; they tend to avoid sliver triangles. The triangulation is named after Boris Delaunay for his work on this topic from 1934.

For a set of points on the same line there is no Delaunay triangulation (the notion of triangulation is degenerate for this case). For four or more points on the same circle (e.g., the vertices of a rectangle) the Delaunay triangulation is not unique: each of the two possible triangulations that split the quadrangle into two triangles satisfies the "Delaunay condition", i.e., the requirement that the circumcircles of all triangles have empty interiors.

By considering circumscribed spheres, the notion of Delaunay triangulation extends to three and higher dimensions. Generalizations are possible to metrics other than Euclidean distance. However, in these cases a Delaunay triangulation is not guaranteed to exist or be unique.