从点云生成三角形网格的算法 [英] Algorithm for generating a triangular mesh from a cloud of points

问题描述

在一些模拟程序中，我们根据点生成对象表面，每个点都有 3D 坐标和表示该点表面法线的向量.出于可视化目的，我们想生成一个由三角形组成的网格；每三个闭合点与其法线形成一个三角形.然后我们可以将这些信息发送到一些标准的可视化程序，这些程序可以像 VMD(视觉分子动力学)一样渲染表面.

In some simulation program we generate object surfaces in terms of points, each point has 3D coordinates and the vector that represents the normal to the surface at that point. For visualization purposes we would like to generate a mesh composed of triangles; each three close points form one triangle with its normal. Then we can send this information to some standard visualization programs that render the surface like VMD (Visual Molecular Dynamics).

我们想知道哪种算法是最快/可用的算法.

We wonder which is the fastest/available algorithm for doing this.

推荐答案

看看JonathanShewchuk 的工作，尤其是他(和他的同事)著名的论文和实现:

Take a look at Jonathan Shewchuk's work, especially on his (together with his colleagues) famous papers and implementations of:

• Delaunay 三角剖分的流式计算

二维质量网格生成器和 Delaunay三角仪

在点云库 (PCL) 中还可以快速实现未排序的点云.查看他们在 无序点云的快速三角剖分上的演示.

There is also fast implementation of unsorted point clouds implemented in the Point Cloud Library (PCL). Check their presentation on Fast triangulation of unordered point clouds.

这篇关于从点云生成三角形网格的算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！