Generating Chinese Calligraphy on Freeform Shapes

To adequately reveal aesthetic value of Chinese calligraphy, the way to precisely generate characters on freeform shapes is a critical issue. In this paper, we present a novel method to solve the problem. Firstly, to avoid the disadvantage of pictures and obtain an excellent visual effect, we vectorize Chinese calligraphy characters by disk B-spline curve DBSC. Secondly, instead of the traditional texture mapping method, we innovatively employ geodesic computation and exponential map method to calculate accurate texture coordinates. The geodesic computation is to calculate the geodesic distance between every two vertexes of the character mapped region. And the exponential map is to obtain every vertex's geodesic coordinates. Thirdly, 3D points coordinates on surfaces that correspond to vectored character in tangent plane are acquired, therefore the vectored character is able to be mapped onto surfaces. At last, some experiments are accomplished to test and verify the accuracy and efficiency of our method.

[1]  Theodosios Pavlidis,et al.  Computer Recognition of Handwritten Numerals by Polygonal Approximations , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Tom Wright History and Technology of Computer Fonts , 1998, IEEE Ann. Hist. Comput..

[3]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..

[4]  Frédo Durand,et al.  Axis-aligned filtering for interactive physically-based diffuse indirect lighting , 2013, ACM Trans. Graph..

[5]  Hiromasa Suzuki,et al.  Approximate shortest path on a polyhedral surface based on selective refinement of the discrete graph and its applications , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[6]  C. J. Hilditch,et al.  Linear Skeletons From Square Cupboards , 1969 .

[7]  Siu Chi Hsu,et al.  Drawing and animation using skeletal strokes , 1994, SIGGRAPH.

[8]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Seah Hock Soon,et al.  Artistic brushstroke representation and animation with disk b-spline curve , 2005, ACE '05.

[10]  Shi-Qing Xin,et al.  Constant-time O(1) all pairs geodesic distance query on triangle meshes , 2011, SA '11.

[11]  Tomoyuki Nishita,et al.  A Display Algorithm of Brush Strokes Using Bézier Functions , 1993 .

[12]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[13]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[14]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[15]  Daniel Cohen-Or,et al.  L1-medial skeleton of point cloud , 2013, ACM Trans. Graph..

[16]  Matthew Carter Typography and Current Technologies , 1990 .

[17]  Andrea Tagliasacchi,et al.  Mean Curvature Skeletons , 2012, Comput. Graph. Forum.

[18]  Hongwei Lin,et al.  A Novel Method for Vectorizing Historical Documents of Chinese Calligraphy , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.