A Delaunay triangulation based approach for cleaning rough sketches
•A Delaunay triangulation based algorithm is proposed for grouping strokes.•The proposed algorithm is capable of helping the user in masking misinterpreted regions.•A shape aware skeleton smoothing procedure is used to create final vector output.•Proposed algorithm combines the techniques in Computa...
Saved in:
Published in | Computers & graphics Vol. 74; pp. 171 - 181 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Elsevier Ltd
01.08.2018
Elsevier Science Ltd |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •A Delaunay triangulation based algorithm is proposed for grouping strokes.•The proposed algorithm is capable of helping the user in masking misinterpreted regions.•A shape aware skeleton smoothing procedure is used to create final vector output.•Proposed algorithm combines the techniques in Computational Geometry as well as Image Processing.
[Display omitted]
Given a set of rough strokes drawn by an artist (either in pen-paper medium or in digital medium) in raster format, the objective is to group them meaningfully and represent the group with simple most appropriate curves. In this paper, a Delaunay triangulation based algorithm is proposed for grouping strokes. The grouping procedure is capable of identifying open curves and reconstructing broken strokes. The proposed algorithm is capable of helping the user in masking misinterpreted regions. We also introduce a shape aware skeleton smoothing procedure which best approximates the shape by taking input raster sketch as a reference to create final vector output. The user can also control the final output. The proposed algorithm combines the techniques in computational geometry as well as in image processing to utilize the power of both. |
---|---|
ISSN: | 0097-8493 1873-7684 |
DOI: | 10.1016/j.cag.2018.05.011 |