EG 2020 - Short Papers
Permanent URI for this collection
Browse
Browsing EG 2020 - Short Papers by Subject "Computational geometry"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Interactive Flat Coloring of Minimalist Neat Sketches(The Eurographics Association, 2020) Parakkat, Amal Dev; Madipally, Prudhviraj; Gowtham, Hari Hara; Cani, Marie-Paule; Wilkie, Alexander and Banterle, FrancescoWe 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.