非逼真渲染中平滑遮挡轮廓的新见解

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Aaron Hertzmann, Rajesh Sharma
{"title":"非逼真渲染中平滑遮挡轮廓的新见解","authors":"Aaron Hertzmann, Rajesh Sharma","doi":"10.1109/MCG.2023.3338784","DOIUrl":null,"url":null,"abstract":"<p><p>Computing occluding contours is often a crucial step in stroke-based artistic 3-D stylization for movies, video games, and visualizations. However, many existing applications use only simple curve stylization techniques, such as thin black lines or hand-animated strokes. This is because sophisticated procedural stylization requires accurate curve topology, which has long been an unsolved research problem. This article describes a recent theoretical breakthrough in the topology problem. Specifically, the new theory points out that existing contour algorithms often generate curves that cannot have any valid visibility, and new algorithms show how to correct the problem. This article surveys classes of algorithms that can compute contours accurately and identifies new research opportunities.</p>","PeriodicalId":55026,"journal":{"name":"IEEE Computer Graphics and Applications","volume":"44 1","pages":"76-85"},"PeriodicalIF":1.7000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Insights in Smooth Occluding Contours for Nonphotorealistic Rendering.\",\"authors\":\"Aaron Hertzmann, Rajesh Sharma\",\"doi\":\"10.1109/MCG.2023.3338784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Computing occluding contours is often a crucial step in stroke-based artistic 3-D stylization for movies, video games, and visualizations. However, many existing applications use only simple curve stylization techniques, such as thin black lines or hand-animated strokes. This is because sophisticated procedural stylization requires accurate curve topology, which has long been an unsolved research problem. This article describes a recent theoretical breakthrough in the topology problem. Specifically, the new theory points out that existing contour algorithms often generate curves that cannot have any valid visibility, and new algorithms show how to correct the problem. This article surveys classes of algorithms that can compute contours accurately and identifies new research opportunities.</p>\",\"PeriodicalId\":55026,\"journal\":{\"name\":\"IEEE Computer Graphics and Applications\",\"volume\":\"44 1\",\"pages\":\"76-85\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Computer Graphics and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/MCG.2023.3338784\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Computer Graphics and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/MCG.2023.3338784","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

计算遮挡轮廓通常是电影、视频游戏和可视化中基于笔触的艺术三维造型的关键步骤。然而,许多现有的应用程序只使用简单的曲线造型技术,如黑色细线或手工动画笔触。这是因为复杂的程序化造型需要精确的曲线拓扑,而这一直是一个悬而未决的研究难题。本文介绍了拓扑问题的最新理论突破。具体来说,新理论指出,现有的轮廓算法生成的曲线往往不可能有任何有效的可见性,而新算法则展示了如何纠正这一问题。本文对能准确计算轮廓的算法类别进行了调查,并指出了新的研究机会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New Insights in Smooth Occluding Contours for Nonphotorealistic Rendering.

Computing occluding contours is often a crucial step in stroke-based artistic 3-D stylization for movies, video games, and visualizations. However, many existing applications use only simple curve stylization techniques, such as thin black lines or hand-animated strokes. This is because sophisticated procedural stylization requires accurate curve topology, which has long been an unsolved research problem. This article describes a recent theoretical breakthrough in the topology problem. Specifically, the new theory points out that existing contour algorithms often generate curves that cannot have any valid visibility, and new algorithms show how to correct the problem. This article surveys classes of algorithms that can compute contours accurately and identifies new research opportunities.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications 工程技术-计算机:软件工程
CiteScore
3.20
自引率
5.60%
发文量
160
审稿时长
>12 weeks
期刊介绍: IEEE Computer Graphics and Applications (CG&A) bridges the theory and practice of computer graphics, visualization, virtual and augmented reality, and HCI. From specific algorithms to full system implementations, CG&A offers a unique combination of peer-reviewed feature articles and informal departments. Theme issues guest edited by leading researchers in their fields track the latest developments and trends in computer-generated graphical content, while tutorials and surveys provide a broad overview of interesting and timely topics. Regular departments further explore the core areas of graphics as well as extend into topics such as usability, education, history, and opinion. Each issue, the story of our cover focuses on creative applications of the technology by an artist or designer. Published six times a year, CG&A is indispensable reading for people working at the leading edge of computer-generated graphics technology and its applications in everything from business to the arts.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信