Estimation of minimum volume of bounding box for geometrical metrology

Q3 Engineering
Petr Chelishchev, K. Sørby
{"title":"Estimation of minimum volume of bounding box for geometrical metrology","authors":"Petr Chelishchev, K. Sørby","doi":"10.1051/ijmqe/2020007","DOIUrl":null,"url":null,"abstract":"This paper presents algorithms for estimating the minimum volume bounding box based on a three-dimensional point set measured by a coordinate measuring machine. A new algorithm, which calculates the minimum volume with high accuracy and reduced number of computations, is developed. The algorithm is based on the convex hull operation and established theories about a minimum bounding box circumscribing a convex polyhedron. The new algorithm includes a pre-processing operation that removes convex polyhedron faces located near the edges of the measured object. As showed in the paper, the solution of the minimum bonding box is not based on faces located near the edges; therefore, we can save computation time by excluding them from the convex polyhedron data set. The algorithms have been demonstrated on physical objects measured by a coordinate measuring machine, and on theoretical 3D models. The results show that the algorithm can be used when high accuracy is required, for example in calibration of reference standards.","PeriodicalId":38371,"journal":{"name":"International Journal of Metrology and Quality Engineering","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Metrology and Quality Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ijmqe/2020007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents algorithms for estimating the minimum volume bounding box based on a three-dimensional point set measured by a coordinate measuring machine. A new algorithm, which calculates the minimum volume with high accuracy and reduced number of computations, is developed. The algorithm is based on the convex hull operation and established theories about a minimum bounding box circumscribing a convex polyhedron. The new algorithm includes a pre-processing operation that removes convex polyhedron faces located near the edges of the measured object. As showed in the paper, the solution of the minimum bonding box is not based on faces located near the edges; therefore, we can save computation time by excluding them from the convex polyhedron data set. The algorithms have been demonstrated on physical objects measured by a coordinate measuring machine, and on theoretical 3D models. The results show that the algorithm can be used when high accuracy is required, for example in calibration of reference standards.
几何计量中边界盒最小体积的估计
本文提出了一种基于坐标测量机测量的三维点集的最小体积边界盒估计算法。提出了一种计算最小体积精度高、计算次数少的新算法。该算法基于凸壳运算,并建立了关于凸多面体的最小边界盒的理论。新算法包括一个预处理操作,去除位于测量对象边缘附近的凸多面体面。从文中可以看出,最小键合盒的解不是基于靠近边缘的面;因此,将它们从凸多面体数据集中排除可以节省计算时间。该算法已在坐标测量机测量的物理对象和理论三维模型上进行了验证。结果表明,该算法可用于对精度要求较高的场合,如标准品的标定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Metrology and Quality Engineering
International Journal of Metrology and Quality Engineering Engineering-Safety, Risk, Reliability and Quality
CiteScore
1.70
自引率
0.00%
发文量
8
审稿时长
8 weeks
×
引用
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学术官方微信