primitive

Reproducing images with geometric primitives.

A target image is provided as input. The algorithm tries to find the single most optimal shape that can be drawn to minimize the error between the target image and the drawn image. It repeats this process, adding one shape at a time. Around 50 to 200 shapes are needed to reach a result that is recognizable yet artistic and abstract.

Features

• Hill Climbing or Simulated Annealing for optimization (hill climbing multiple random shapes is nearly as good as annealing and faster)
• Scanline rasterization of shapes in pure Go (preferable for implementing the features below)
• Optimal color computation based on affected pixels for each shape (color is directly computed, not optimized for)
• Partial image difference for faster scoring (only pixels that change need be considered)
• Anti-aliased output rendering

https://github.com/fogleman/primitive