在三角形网格上生成具有双三次样条的光滑表面:从无组织的3D点自动建立模型

T. Ueshiba, G. Roth
{"title":"在三角形网格上生成具有双三次样条的光滑表面:从无组织的3D点自动建立模型","authors":"T. Ueshiba, G. Roth","doi":"10.1109/IM.1999.805360","DOIUrl":null,"url":null,"abstract":"The paper presents an algorithm for constructing tangent plane continuous (G/sup 1/) surfaces with piecewise polynomials over triangular meshes. The input mesh can be of arbitrary topological type, that is, any number of faces can meet at a mesh vertex. The mesh is first refined to one solely with quadrilateral cells. Rectangular Bezier patches are then assigned to each of the cells and control points are determined so that G/sup 1/ continuity across the patch boundaries is maintained. Since all the patches are rectangular, the resulting surface can be rendered efficiently by current commercial graphic hardware/software. In addition, by exploiting the fact that all the faces of the original mesh are triangular, the degree of each patch is optimized to three while a more general method dealing with arbitrary irregular meshes requires biquartic patches. Several surface examples generated from real 3D data are shown.","PeriodicalId":110347,"journal":{"name":"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Generating smooth surfaces with bicubic splines over triangular meshes: toward automatic model building from unorganized 3D points\",\"authors\":\"T. Ueshiba, G. Roth\",\"doi\":\"10.1109/IM.1999.805360\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an algorithm for constructing tangent plane continuous (G/sup 1/) surfaces with piecewise polynomials over triangular meshes. The input mesh can be of arbitrary topological type, that is, any number of faces can meet at a mesh vertex. The mesh is first refined to one solely with quadrilateral cells. Rectangular Bezier patches are then assigned to each of the cells and control points are determined so that G/sup 1/ continuity across the patch boundaries is maintained. Since all the patches are rectangular, the resulting surface can be rendered efficiently by current commercial graphic hardware/software. In addition, by exploiting the fact that all the faces of the original mesh are triangular, the degree of each patch is optimized to three while a more general method dealing with arbitrary irregular meshes requires biquartic patches. Several surface examples generated from real 3D data are shown.\",\"PeriodicalId\":110347,\"journal\":{\"name\":\"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IM.1999.805360\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IM.1999.805360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

提出了在三角形网格上构造分段多项式切平面连续曲面(G/sup 1/)的一种算法。输入网格可以是任意拓扑类型,即在一个网格顶点处可以有任意数量的面。首先将网格细化为仅包含四边形单元的网格。然后将矩形贝塞尔块分配给每个单元并确定控制点,以便保持块边界之间的G/sup /连续性。由于所有的补丁都是矩形的,因此可以通过当前的商业图形硬件/软件高效地渲染生成的表面。此外,通过利用原始网格的所有面都是三角形的事实,每个补丁的程度被优化为3,而处理任意不规则网格的更一般的方法需要双四次补丁。给出了几个由实际三维数据生成的曲面实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generating smooth surfaces with bicubic splines over triangular meshes: toward automatic model building from unorganized 3D points
The paper presents an algorithm for constructing tangent plane continuous (G/sup 1/) surfaces with piecewise polynomials over triangular meshes. The input mesh can be of arbitrary topological type, that is, any number of faces can meet at a mesh vertex. The mesh is first refined to one solely with quadrilateral cells. Rectangular Bezier patches are then assigned to each of the cells and control points are determined so that G/sup 1/ continuity across the patch boundaries is maintained. Since all the patches are rectangular, the resulting surface can be rendered efficiently by current commercial graphic hardware/software. In addition, by exploiting the fact that all the faces of the original mesh are triangular, the degree of each patch is optimized to three while a more general method dealing with arbitrary irregular meshes requires biquartic patches. Several surface examples generated from real 3D data are shown.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信