Click here to Skip to main content
11,924,825 members (55,349 online)
Rate this:
Please Sign up or sign in to vote.
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........
Posted 18-May-11 2:04am
Edited 18-May-11 2:55am
S Mewara 18-May-11 7:29am
What is YOUR answer?
Pritesh Aryan 18-May-11 7:39am
I don't know......
BTW.... why should i post it here..if i already knowing the answer......?
Rate this: bad
Please Sign up or sign in to vote.

Solution 1

Why not try it, and then you will know.
Rate this: bad
Please Sign up or sign in to vote.

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?[^]

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy | Mobile
Web01 | 2.8.151125.3 | Last Updated 20 May 2011
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100