|
 |
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
p.b.scene-files under the Voronoļ title, even if the package isn't so
useful in your case, it can point you toward interesting links on the net.
I hope that helps,
JC
Habagat Boy wrote:
> does anyone know of a way to convert an array of points into non-overlapping
> triangles? the line i“ve been following lately is that i“ll have another
> series of points, and test the first array for distance to each point; the
> three closest points on the first array to a point on the second set become
> the vertices of a triangle. however, this will result in a lot of identical
> triangles, which i“d need to avoid....
>
Post a reply to this message
|
|
