一种计算二维和三维NURBS曲线最小距离的高性能方法

YingLiang Ma, W. T. Hewitt, M. Turner
{"title":"一种计算二维和三维NURBS曲线最小距离的高性能方法","authors":"YingLiang Ma, W. T. Hewitt, M. Turner","doi":"10.1080/2151237X.2006.10129214","DOIUrl":null,"url":null,"abstract":"We present a fast, accurate, and robust method to compute the minimum distance between two 2D and 3D NURBS curves. This is carried out by first decomposing both of the NURBS curves into their piecewise-Bézier forms. Candidate pairs, as a subset of all possible pairs, are extracted based on a two-level selection process. The first-level selection uses upper-lower bounds of Bézier subcurves to remove pairs. The second-level selection is based on the spatial relationship test between a pair of Bézier curves. An iterative multidimensional Newton-Raphson method is applied on all candidate pairs in order to calculate the approximate local minimum distances. Finally, by comparing all local minimum distances between a pair of Bézier subcurves, we are able to find the global minimum distance. The accuracy is improved by further use of the multidimensional Newton-Raphson method to give high accuracy. Source code is available online.","PeriodicalId":318334,"journal":{"name":"Journal of Graphics Tools","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A High-Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves\",\"authors\":\"YingLiang Ma, W. T. Hewitt, M. Turner\",\"doi\":\"10.1080/2151237X.2006.10129214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a fast, accurate, and robust method to compute the minimum distance between two 2D and 3D NURBS curves. This is carried out by first decomposing both of the NURBS curves into their piecewise-Bézier forms. Candidate pairs, as a subset of all possible pairs, are extracted based on a two-level selection process. The first-level selection uses upper-lower bounds of Bézier subcurves to remove pairs. The second-level selection is based on the spatial relationship test between a pair of Bézier curves. An iterative multidimensional Newton-Raphson method is applied on all candidate pairs in order to calculate the approximate local minimum distances. Finally, by comparing all local minimum distances between a pair of Bézier subcurves, we are able to find the global minimum distance. The accuracy is improved by further use of the multidimensional Newton-Raphson method to give high accuracy. Source code is available online.\",\"PeriodicalId\":318334,\"journal\":{\"name\":\"Journal of Graphics Tools\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graphics Tools\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/2151237X.2006.10129214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graphics Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/2151237X.2006.10129214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种快速、准确、鲁棒的方法来计算二维和三维NURBS曲线之间的最小距离。这是通过首先将两个NURBS曲线分解成它们的分段bsamzier形式来实现的。候选配对作为所有可能配对的子集,基于两级选择过程进行提取。第一级选择使用bsamzier子曲线的上下界来删除对。第二级选择是基于一对bsamzier曲线之间的空间关系检验。在所有候选对上应用迭代多维牛顿-拉夫逊方法计算近似的局部最小距离。最后,通过比较一对b子曲线之间的所有局部最小距离,我们能够找到全局最小距离。进一步利用多维牛顿-拉夫逊方法提高了精度,得到了较高的精度。源代码可在线获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A High-Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves
We present a fast, accurate, and robust method to compute the minimum distance between two 2D and 3D NURBS curves. This is carried out by first decomposing both of the NURBS curves into their piecewise-Bézier forms. Candidate pairs, as a subset of all possible pairs, are extracted based on a two-level selection process. The first-level selection uses upper-lower bounds of Bézier subcurves to remove pairs. The second-level selection is based on the spatial relationship test between a pair of Bézier curves. An iterative multidimensional Newton-Raphson method is applied on all candidate pairs in order to calculate the approximate local minimum distances. Finally, by comparing all local minimum distances between a pair of Bézier subcurves, we are able to find the global minimum distance. The accuracy is improved by further use of the multidimensional Newton-Raphson method to give high accuracy. Source code is available online.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信