Parakkat, Amal DevMadipally, PrudhvirajGowtham, Hari HaraCani, Marie-PauleWilkie, Alexander and Banterle, Francesco2020-05-242020-05-242020978-3-03868-101-41017-4656https://doi.org/10.2312/egs.20201024https://diglib.eg.org:443/handle/10.2312/egs20201024We introduce a simple Delaunay-triangulation based algorithm for the interactive coloring of neat line-art minimalist sketches, ie. vector sketches that may include open contours. The main objective is to minimize user intervention and make interaction as natural as with the flood-fill algorithm while extending coloring to regions with open contours. In particular, we want to save the user from worrying about parameters such as stroke weight and size. Our solution works in two steps, 1) a segmentation step in which the input sketch is automatically divided into regions based on the underlying Delaunay structure and 2) the interactive grouping of neighboring regions based on user input. More precisely, a region adjacency graph is computed from the segmentation result, and is interactively partitioned based on user input to generate the final colored sketch. Results show that our method is as natural as a bucket fill tool and powerful enough to color minimalist sketches.Attribution 4.0 International LicenseTheory of computationComputational geometryComputing methodologiesImage processingShape analysisApplied computingFine arts10.2312/egs.2020102485-88