Skip to content

Commit

Permalink
Update readme.
Browse files Browse the repository at this point in the history
  • Loading branch information
kevinjohncutler committed Jan 3, 2022
1 parent 0cd4e1c commit 089a3a2
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
# ncolor
Fast remapping of intance labels 1,2,3,...,M to N repeating, disjoint labels, 1,2,3,...,N. The four-color-theorem guarantees that at most four colors is required for any 2D segmentation/map, but this algorithm will opt for 5 or 6 to give an acceptable result quickly. Also works for 3D labels (<8 colors typically required) and perhaps higher dimensions as well.
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 quickly. Also works for 3D labels (<8 colors typically required) and perhaps higher dimensions as well.

0 comments on commit 089a3a2

Please sign in to comment.