Line drawing simplification by stroke translation and combination

In this paper, we propose a new algorithm for simplifying line drawing sketches. First, we segment the strokes at the points of large curvature if desired. Then, we perform a low-pass filter and use the result to assign a weight to every stroke. The strokes are moved to the position of the higher weight. After that, we find the stroke pairs and combine them to reduce the total number of the strokes, resulting in a cleaner line drawing art. This system also cuts down the disordered and confusing small strokes and combines them to form long strokes.

[1]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

[2]  Levent Burak Kara,et al.  Beautification of Design Sketches Using Trainable Stroke Clustering and Curve Fitting , 2011, IEEE Transactions on Visualization and Computer Graphics.

[3]  Adam Finkelstein,et al.  Real-time hatching , 2001, SIGGRAPH.

[4]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[5]  A. Ardeshir Goshtasby,et al.  Grouping and parameterizing irregularly spaced points for curve fitting , 2000, TOGS.

[6]  Eric Saund.  Labeling of curvilinear structure across scales by token grouping , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Pascal Barla,et al.  Geometric clustering for line drawing simplification , 2005, SIGGRAPH '05.

[8]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[9]  A. Ardeshir Goshtasby,et al.  Geometric modelling using rational Gaussian curves and surfaces , 1995, Comput. Aided Des..

[10]  Ligang Liu,et al.  Animated construction of line drawings , 2011, ACM Trans. Graph..

[11]  Dennis Reil.  Forum. , 1996, Environmental health perspectives.

[12]  Jürgen Döllner,et al.  Image and Video Abstraction by Anisotropic Kuwahara Filtering , 2009, Comput. Graph. Forum.

[13]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[14]  Bernhard Preim,et al.  Tuning rendered line-drawings , 1995 .

[15]  Aaron Hertzmann,et al.  A survey of stroke-based rendering , 2003, IEEE Computer Graphics and Applications.

[16]  Brian Wyvill,et al.  Improving the sketch-based interface , 2007, The Visual Computer.

[17]  Frédo Durand,et al.  Density measure for line-drawing simplification , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[18]  Thomas Baudel,et al.  A mark-based interaction paradigm for free-hand drawing , 1994, UIST '94.

[19]  Levent Burak Kara,et al.  Pen-based styling design of 3D geometry using concept sketches and template models , 2006, SPM '06.

[20]  Adam Finkelstein,et al.  Directing gaze in 3D models with stylized focus , 2006, EGSR '06.

[21]  Baoquan Chen,et al.  Efficient and Dynamic Simplification of Line Drawings , 2008, Comput. Graph. Forum.

[22]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[23]  Oliver Deussen,et al.  Computer-generated pen-and-ink illustration of trees , 2000, SIGGRAPH.

[24]  Paul L. Rosin.  Grouping Curved Lines , 1994, BMVC.

[25]  Kwan-Liu Ma,et al.  Rendering complexity in computer-generated pen-and-ink illustrations , 2004, NPAR '04.

[26]  Jun Yu,et al.  Stroke Correspondence Construction Using Manifold Learning , 2011, Comput. Graph. Forum.

[27]  Adam Finkelstein,et al.  Coherent stylized silhouettes , 2003, ACM Trans. Graph..