Digital micrography

We present an algorithm for creating digital micrography images, or micrograms, a special type of calligrams created from minuscule text. These attractive text-art works successfully combine beautiful images with readable meaningful text. Traditional micrograms are created by highly skilled artists and involve a huge amount of tedious manual work. We aim to simplify this process by providing a computerized digital micrography design tool. The main challenge in creating digital micrograms is designing textual layouts that simultaneously convey the input image, are readable and appealing. To generate such layout we use the streamlines of singularity free, low curvature, smooth vector fields, especially designed for our needs. The vector fields are computed using a new approach which controls field properties via a priori boundary condition design that balances the different requirements we aim to satisfy. The optimal boundary conditions are computed using a graph-cut approach balancing local and global design considerations. The generated layouts are further processed to obtain the final micrograms. Our method automatically generates engaging, readable micrograms starting from a vector image and an input text while providing a variety of optional high-level controls to the user.

[1]  Eugene Zhang,et al.  Interactive procedural street modeling , 2008, ACM Trans. Graph..

[2]  Bruno Lévy,et al.  Geometry-aware direction field processing , 2009, TOGS.

[3]  Beth Tondreau Layout Essentials: 100 Design Principles for Using Grids , 2009 .

[4]  C. Bigelow,et al.  Digital typography , 1987 .

[5]  Daniel Cohen-Or,et al.  Feature-aligned shape texturing , 2009, ACM Trans. Graph..

[6]  Roger D. Hersch,et al.  Multi-color and artistic dithering , 1999, SIGGRAPH.

[7]  Bruno Lévy,et al.  N-symmetry direction field design , 2008, TOGS.

[8]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[9]  Hugues Hoppe,et al.  Design of tangent vector fields , 2007, SIGGRAPH 2007.

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Paul Asente Folding Avoidance in Skeletal Strokes , 2010, SBIM.

[12]  Victor Ostromoukhov,et al.  Hatching by example: a statistical approach , 2002, NPAR '02.

[13]  Eugene Zhang,et al.  Geometry Synthesis on Surfaces Using Field-Guided Shape Grammars , 2011, IEEE Transactions on Visualization and Computer Graphics.

[14]  Gershon Elber,et al.  Arbitrary precise orientation specification for layout of text , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

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

[16]  Wilfrid Lefer,et al.  Creating Evenly-Spaced Streamlines of Arbitrary Density , 1997, Visualization in Scientific Computing.

[17]  Joann M. Taylor,et al.  Digital Color Imaging Handbook , 2004 .

[18]  Karan Singh,et al.  Organic labyrinths and mazes , 2006, NPAR.

[19]  David Salesin,et al.  Computer-generated floral ornament , 1998, SIGGRAPH.

[20]  Eugene Zhang,et al.  Rotational symmetry field design on surfaces , 2007, ACM Trans. Graph..

[21]  Keenan Crane,et al.  Trivial Connections on Discrete Surfaces , 2010, Comput. Graph. Forum.

[22]  Philip E. Gill,et al.  Practical optimization , 1981 .

[23]  Tien-Tsin Wong,et al.  Structure-based ASCII art , 2010, ACM Trans. Graph..

[24]  Craig S. Kaplan,et al.  Image-guided maze construction , 2007, ACM Trans. Graph..

[25]  Bror Zachrisson,et al.  Studies in the legibility of printed text , 1965 .

[26]  Guillaume Apollinaire,et al.  Calligrammes : Poems of Peace and War (1913-1916) , 1918 .

[27]  Cohen-OrDaniel,et al.  Consistent mesh partitioning and skeletonisation using the shape diameter function , 2008 .

[28]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[29]  Jie Xu,et al.  Calligraphic packing , 2007, GI '07.