Dual/Primal mesh optimization for polygonized implicit surfaces

Y. Ohtake, A. Belyaev
{"title":"Dual/Primal mesh optimization for polygonized implicit surfaces","authors":"Y. Ohtake, A. Belyaev","doi":"10.1145/566282.566308","DOIUrl":null,"url":null,"abstract":"A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard marching cubes mesh Lorensen(in our experiments we use VTK marching cubes VTK). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that \"double dual\" mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"74","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Smart Media and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/566282.566308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 74

Abstract

A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard marching cubes mesh Lorensen(in our experiments we use VTK marching cubes VTK). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that "double dual" mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.
多边形隐式曲面的双/原始网格优化
提出了一种改进尖锐特征隐曲面多边形化的新方法。该方法是基于这样的观察:给定一个具有尖锐特征的隐式曲面,一个三角形网格的三角形在某些内三角形点与隐式曲面相切,它比Lorensen标准行军立方体网格更好地逼近隐式曲面(在我们的实验中,我们使用VTK行军立方体VTK)。首先,给定一个初始三角形网格,考虑由三角形质心组成的双网格。然后对双网格进行修改,使其顶点位于隐式曲面上,并考虑修改后的双网格的网格对偶。最后,通过最小化二次能量来测量网格法线与修改后的双重网格顶点计算的隐式表面法线的偏差,从而优化“双重双重”网格的顶点位置。为了实现精细表面特征的精确逼近,这些基本步骤与自适应网格细分和曲率加权顶点重采样相结合。该方法在速度和精度上优于基于网格演化范式的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信