ACM Home Page
Please provide us with feedback. Feedback
More optimal strokes for NPR sketching
Full text PdfPdf (158 KB)
Source Computer graphics and interactive techniques in Australasia and South East Asia archive
Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia table of contents
Dunedin, New Zealand
SESSION: Sketch interfaces table of contents
Pages: 47 - 50  
Year of Publication: 2005
ISBN:1-59593-201-1
Authors
J. P. Lewis  Graphics Primitives
Nickson Fong  Egg Story Creative Productions
Xie XueXiang  Nanyang Technological University
Seah Hock Soon  Nanyang Technological University
Tian Feng  Nanyang Technological University
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 44,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1101389.1101398
What is a DOI?

ABSTRACT

Sketching is a drawing style where approximations and successive refinement in the drawing process are evident. The approximation of contours in sketching involves multiple overlapping strokes that are relatively long in regions of low curvature and shorter in high-curvature areas, yet unimportant high-curvature details are omitted in the initial stages of a sketch. Rendering contours with a single long stroke does not capture the feel of a sketch, and a simple strategy of breaking strokes at curvature maxima is easily confused by unimportant details and noise. We address the contour breaking problem for sketching by clustering samples of the contour based on proximity and orientation, making use of a global clustering algorithm (normalized cuts). The strokes generated by this approach qualitatively resemble those produced by real artists, and the successive approximation effect seen in sketching can be simulated by employing our approach at a succession of scales (increasing the number of clusters).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bobrow, J. E., Martin, B., Sohl, G., Wang, E. C., Kim, J., and Park, F. C. 2001. Optimal robot motions for physical criteria. J. Robotic Systems 18, 12 (Dec.), 785--795.
 
2
 
3
 
4
 
5
 
6
Hertzmann, A. 1998. Painterly rendering with curved brush strokes of multiple sizes. 453--460.
 
7
 
8
Isenberg, T., Halper, N., and Strothotte, T. 2002. Stylizing silhouettes at interactive rates: From silhouette edges to silhouette strokes. Computer Graphics Forum 21, 3 (Sept.).
 
9
 
10
11
 
12
Medioni, G., Tang, C. K., and Lee, M. S. 2002. Tensor voting: Theory and applications. In European Conference on Computer Vision.
 
13
Mignotte, M. 2003. Unsupervised statistical sketching for non-photorealistic rendering models. In 10th IEEE International Conference on Image Processing, ICIP'03, volume III, 573--577.
 
14
Ng, A., Jordan, M., and Weiss, Y. 2001. On spectral clustering: Analysis and an algorithm. In In Advances in Neural Information Processing Systems 14.
15
16
 
17
 
18
 
19
Sousa, M. C., and Buchannan, J. W. 2000. Observational models of graphite pencil materials. Comput. Graph. Forum 19, 1, 27--49.
 
20
Sousa, M. C., and Prusinkiewicz, P. 2003. A few good lines: Suggestive drawing of 3d models. Computer Graphics Forum 22, 3 (September).
 
21
22
 
23
Collaborative Colleagues:
J. P. Lewis: colleagues
Nickson Fong: colleagues
Xie XueXiang: colleagues
Seah Hock Soon: colleagues
Tian Feng: colleagues