Curvature continuous corner cutting

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Kai Hormann , Claudio Mancinelli
{"title":"Curvature continuous corner cutting","authors":"Kai Hormann ,&nbsp;Claudio Mancinelli","doi":"10.1016/j.cagd.2024.102392","DOIUrl":null,"url":null,"abstract":"<div><div>Subdivision schemes are used to generate smooth curves by iteratively refining an initial control polygon. The simplest such schemes are corner cutting schemes, which specify two distinct points on each edge of the current polygon and connect them to get the refined polygon, thus cutting off the corners of the current polygon. While <span><span>de Boor (1987)</span></span> shows that this process always converges to a Lipschitz continuous limit curve, no matter how the points on each edge are chosen, <span><span>Gregory and Qu (1996)</span></span> discover that the limit curve is continuously differentiable under certain constraints. We extend these results and show that the limit curve can even be curvature continuous for specific sequences of cut ratios.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102392"},"PeriodicalIF":1.3000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624001262","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Subdivision schemes are used to generate smooth curves by iteratively refining an initial control polygon. The simplest such schemes are corner cutting schemes, which specify two distinct points on each edge of the current polygon and connect them to get the refined polygon, thus cutting off the corners of the current polygon. While de Boor (1987) shows that this process always converges to a Lipschitz continuous limit curve, no matter how the points on each edge are chosen, Gregory and Qu (1996) discover that the limit curve is continuously differentiable under certain constraints. We extend these results and show that the limit curve can even be curvature continuous for specific sequences of cut ratios.
曲率连续切角
细分方案用于通过迭代细化初始控制多边形来生成平滑曲线。最简单的细分方案是切角方案,即在当前多边形的每条边上指定两个不同的点,然后将它们连接起来,得到细化多边形,从而切掉当前多边形的角。de Boor(1987 年)的研究表明,无论如何选择每条边上的点,这一过程总是收敛于一条 Lipschitz 连续的极限曲线,而 Gregory 和 Qu(1996 年)则发现,在某些约束条件下,极限曲线是连续可微的。我们扩展了这些结果,证明极限曲线甚至可以在特定的切割比序列中曲率连续。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following: -Mathematical and Geometric Foundations- Curve, Surface, and Volume generation- CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision- Industrial, medical, and scientific applications. The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.
×
引用
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学术官方微信