用于3维的Delauny网格三角剖分算法的输出应该是什么? [英] What should be the out put of Delauny Mesh Triangulation algorithm for 3-Dimention?

问题描述

如果这是输入点 [ Delauny网格三角剖分算法 的输出是什么?

A. 这一个 [这一个 [

If this are the input points[^] to the Delauny Mesh Triangulation algorithm…….

Then what will be output of Delauny Mesh Triangulation algorithm for 3-Dimention?

A. This one[^]or

B. This one[^][ConvexHull of all given input points]

What is your answer? A or B....
Please Help........
Thanks........

推荐答案

为什么不尝试一下，然后您就会知道.

Why not try it, and then you will know.

The Delaunay三角剖分等效于计算点的凸包
消息来源:在哪里可以获取Voronoi/Delaunay的源? [ ^ ]

The Delaunay triangulation is equivalent to computing the convex hull of the points
SOURCE: Where can I get source for Voronoi/Delaunay triangulation?[^]

这篇关于用于3维的Delauny网格三角剖分算法的输出应该是什么?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！