算法用于填充面网格 [英] algorithm for filling a surface mesh

问题描述

我有一个点云描述了一个封闭的面网格。我想创建一个卷目出了这一点：因此，我要追加一些点这个面点云里。到现在为止我用一种谢尔宾斯基算法的：

I have a point cloud which describes a closed surface mesh. I want to create a volume mesh out of this: Therefore I have to append some points inside this "surface-point-cloud". Until now I use a kind of Sierpinski-algorithm:

1) begin with middlepoint of all points
2) random choose one of the surface points
3) create new point at the half of the connection line between point (1) and (2)  
4) start again at (1) but take the new point (3) as first point

问题：当我三角所有的点，然后多角度过大（ANSYS不能与这个数据集工作）。 有谁知道一个好的算法的表面网格内创建点，以便通过三角测量后的角度不要太大？

Problem: When I triangulate all my points then many angles are too big (ANSYS can't work with this dataset). Does anyone know a good algorithm for creating points inside a surface mesh so that the angles after the triangulation aren't too big?

推荐答案

嗯，我认为你是错的临近问题

Well I think you are approaching the problem wrongly

• 但是我误解你的问题
• 您已经点云，并希望三角化网格
• 您不能在你的会加分......这只是事情复杂化
• 而不是寻找周边多边形
• ，然后用三角测量就可以了

• but I could misunderstood your problem
• you have point cloud and want triangulated mesh
• you can not add points at your will ... that just complicate things
• instead find perimeter polygon
• and then use triangulation on it

最近我的解决非常类似的问题。

Recently I was solving very similar problem.

• 这里：<一href="http://stackoverflow.com/a/21884021/2521214">http://stackoverflow.com/a/21884021/2521214
• 在它被发现在点云洞，创造周长多边形
• ，除非孔非常小或者嵌套它的作品没有任何瑕疵等漏洞
• 您需要调整H，V行扫描，以满足您的需求（或填充地图[] []倒）
• 随便找点，而不是在地图上的孔

• here: http://stackoverflow.com/a/21884021/2521214
• it is finding holes in point-cloud and create perimeter polygon
• unless the hole is very small or nested with other holes it works without artifacts
• you need to tweak the H,V line scan to meet your needs (or fill the map[][] inverted)
• just find points instead of holes in map

在此，你只需要使用任何三角...

After this you just use any triangulation ...

• 或使自己的
• 因为你有凸/ H中的凹边界信息，V线（复制标志）
• 如果单行或列有更多行则1与同穴ID
• ，那么你必须disect网格，以从中获取凸多边形

这篇关于算法用于填充面网格的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！