Algorithm: Exact solution using Held-Karp (Dynamic Programming).
Rendering: Quadtree recursion.
Each pixel is assigned to the node that is part of the optimal tour for that pixel combined with all other nodes. Large uniform areas are filled instantly; boundaries are calculated recursively.
Click to add nodes. Drag to move.
Higher depth = sharper boundaries but significantly more calculations.