label matrix coloring algorithm
Project description
ncolor
Fast remapping of intance labels 1,2,3,...,M to a smaller set of repeating, disjoint labels, 1,2,...,N. The four-color-theorem guarantees that at most four colors are required for any 2D segmentation/map, but this algorithm will opt for 5 or 6 to give an acceptable result if it fails to find a 4-color mapping quickly. Also works for 3D labels (<8 colors typically required) and perhaps higher dimensions as well.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
ncolor-1.1.0.tar.gz
(109.8 kB
view hashes)
Built Distribution
ncolor-1.1.0-py3-none-any.whl
(5.1 kB
view hashes)