|
|
JC (Exether) wrote:
>The Delaunay triangulation provides a more optimized algorithm for doing
>the distance comparison and building the triangles. But as Christopher
>pointed, this operation will result in the wanted mesh only if you have
>a set of points with certain properties.
>
>I have writen and posted a POV-script delaunay algorithm, but it's a 2D
>algo while you need a 3D one. You should be able to find it in
>useful in your case, it can point you toward interesting links on the net.
>
>I hope that helps,
them a 0 z-value, since I plan to start off with a flat surface first, then
do transformations from there to get the exact shape I want.... Thanks! =)
Post a reply to this message
|
|