13,054,329 members (122,925 online)
Rate this:
See more:
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]

Thanks........
Posted 18-May-11 1:04am
Updated 18-May-11 1:55am
v3
S Mewara 18-May-11 7:29am

Pritesh Aryan 18-May-11 7:39am

I don't know......
BTW.... why should i post it here..if i already knowing the answer......?
Thanks.........

Rate this:

## Solution 1

Why not try it, and then you will know.
Rate this:

## Solution 2

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

Top Experts
Last 24hrsThis month
 OriginalGriff 185 Graeme_Grant 158 Jochen Arndt 135 Dave Kreskowiak 85 Karthik Bangalore 55
 OriginalGriff 5,731 RickZeeland 1,994 ppolymorphe 1,858 F-ES Sitecore 1,646 Richard MacCutchan 1,459