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.
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 details)
Built Distribution
File details
Details for the file ncolor-1.1.0.tar.gz.
File metadata
- Download URL: ncolor-1.1.0.tar.gz
- Upload date:
- Size: 109.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.7.1 importlib_metadata/4.10.0 pkginfo/1.8.2 requests/2.27.0 requests-toolbelt/0.9.1 tqdm/4.62.3 CPython/3.10.1
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c9265b368d1aa80764e2ead2d57a4af7794a88ef69f08ab50384bc19f023a4a8 |
|
| MD5 | a4b0ec5d190852d1e83eecb5f22bcad9 |
|
| BLAKE2b-256 | 1dde2acbb1f3ffc1e6e595e5205d6c95e897703554610af5f913b3d5fefbd854 |
File details
Details for the file ncolor-1.1.0-py3-none-any.whl.
File metadata
- Download URL: ncolor-1.1.0-py3-none-any.whl
- Upload date:
- Size: 5.1 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.7.1 importlib_metadata/4.10.0 pkginfo/1.8.2 requests/2.27.0 requests-toolbelt/0.9.1 tqdm/4.62.3 CPython/3.10.1
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 0dbd26d86058210c40af9f5124dddbbc28e8a025207a1a0028aa91cadb4137dd |
|
| MD5 | 09f665499e4da423cc5faf5a07f2dc86 |
|
| BLAKE2b-256 | 84d5bba3d9991921d95907bc6ca8c878c709e2b78a111eaf2510731b6cb0003b |
