TSP Territory Map

How it works: Each pixel is assigned to the node that is part of the optimal TSP tour for that pixel combined with all other nodes.

Use a Quadtree to efficiently calculate regions. If 4 corners of a region share the same tour, the region is filled.

Actions

Canvas Settings Quadtree Depth (Detail): 5

Higher depth = sharper boundaries but slower performance.

Statistics:
Nodes: 0
TSP Calculations: 0
Recursion Depth: 5

Note: The Held-Karp algorithm is used for the exact solution. Since TSP is NP-hard, this implementation is optimized for up to 9-10 nodes. Beyond that, calculations become exponentially expensive.