From 089a3a26dcde9c2f9f8046f3fb303e1d7259a3f3 Mon Sep 17 00:00:00 2001 From: Kevin Cutler <39454982+kevinjohncutler@users.noreply.github.com> Date: Mon, 3 Jan 2022 02:59:54 -0800 Subject: [PATCH] Update readme. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a206b5a..a54ee1c 100644 --- a/README.md +++ b/README.md @@ -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.