除细节外,简化常规曲面的网格划分 [英] Mesh simplification for regular surfaces except details

查看:310
本文介绍了除细节外,简化常规曲面的网格划分的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我需要准备汽车座椅的3D网格以进行进一步的动态分析.由于网格具有高分辨率,因此有必要使用MeshLab中的可用选项之一进行简化.我必须使用什么模块才能在表面简单(规则,简单的曲面)的地方获得较低分辨率的网格,而在必须保留细节(曲率,折痕,弯曲)的地方获得高分辨率的网格.我附加到此消息的对象的屏幕.

I need to prepare 3D mesh of car seat to further dynamic analysis. Because the mesh has high resolution it is necessity to make a simplification using one of the available options in MeshLab. What module I have to use to get the mesh with lower resolution in places where the faces are simple (regular, simple surfaces) but higher resolution where details must be preserved (curvatures, folds, bends). The screen of the object I attach to this message.

在此处输入图片描述

谢谢您的任何建议.

雅各布

推荐答案

filters > Remeshing, Simplification and Reconstruction > Quadric Edge Collapse Decimation

然后输入所需的面数,或输入应减少多少网格的百分比.

Then either enter the desired number of facets, or a percentage for how much the mesh should be reduced.

检查以下设置:

Preserve Boundary of the mesh->不修改任何现有的边界边

Preserve Boundary of the mesh --> Does not modify any existing boundary edges

Preserve Normal->保持网格的法线并防止面翻转

Preserve Normal --> Maintains the normals of the mesh and prevents face-flipping

Preserve Topology->保持网格的属类(即不创建或折叠孔)

Preserve Topology --> Maintains the genus of the mesh (i.e., doesn't create or collapse holes)

Optimal position of simplified vertices->将边缘折叠到最小化二次误差的点上

Optimal position of simplified vertices --> Collapses edges onto the point which minimizes the quadric error

Planar Simplification->改善平面区域的简化

Planar Simplification --> Improves simplification in planar regions

Post-simplification cleaning->不确定是否确实有此必要,但默认情况下始终会对其进行检查.

Post-simplification cleaning --> Not sure if this is actually necessary, but it's always checked by default.

二次抽取算法通过基于到二次平面的有符号距离为每个边缘分配一个成本",从而减少了切面的数量.该算法按成本对边缘进行排序,然后折叠边缘,这将在最终网格中产生最小的误差,而这正是您想要的.

The quadric decimation algorithm reduces the number of facets by assigning a 'cost' to each edge based on the signed distance to the quadric plane. The algorithm sorts edges by cost and collapses edges which would produce the smallest error in the final mesh, which is exactly what you want.

对此算法的解释可以在Michael Garland的简短论文中找到,标题为使用表面简化二次误差度量或他的博士学位论文标题为基于四边形的多边形曲面简化

An explanation of this algorithm can be found in a brief paper by Michael Garland titled Surface Simplification Using Quadric Error Metrics or in his Ph.D. Dissertation, titled Quadric-Based Polygonal Surface Simplification

这篇关于除细节外,简化常规曲面的网格划分的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆