更理想的笔画NPR素描

J. P. Lewis, Nickson Fong, Xuexiang Xie, S. H. Soon, Feng Tian
{"title":"更理想的笔画NPR素描","authors":"J. P. Lewis, Nickson Fong, Xuexiang Xie, S. H. Soon, Feng Tian","doi":"10.1145/1101389.1101398","DOIUrl":null,"url":null,"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).","PeriodicalId":286067,"journal":{"name":"Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"More optimal strokes for NPR sketching\",\"authors\":\"J. P. Lewis, Nickson Fong, Xuexiang Xie, S. H. Soon, Feng Tian\",\"doi\":\"10.1145/1101389.1101398\",\"DOIUrl\":null,\"url\":null,\"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).\",\"PeriodicalId\":286067,\"journal\":{\"name\":\"Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1101389.1101398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1101389.1101398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

素描是一种绘画风格,在绘画过程中,近似和连续的细化是显而易见的。素描中轮廓的近似涉及多个重叠笔画,这些笔画在低曲率区域相对较长,在高曲率区域相对较短,但在草图的初始阶段忽略了不重要的高曲率细节。用单一的长笔画来渲染轮廓并不能捕捉到草图的感觉,而在曲率最大时打破笔画的简单策略很容易被不重要的细节和噪音所混淆。我们利用全局聚类算法(归一化切割),基于接近度和方向对轮廓样本进行聚类,解决了轮廓破坏问题。通过这种方法产生的笔触在质量上类似于真正的艺术家所产生的笔触,并且在素描中看到的连续近似效果可以通过采用我们的方法在连续的尺度上(增加簇的数量)来模拟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
More optimal strokes for NPR sketching
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).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信