Thanks...most of what I've found uses an incremental insertion algorithm, which
I don't think will work for the number of points I'll be working with. The
VisAD package does have a number of Delaunay algorithms implemented which should
help out. The Delaunay triangulation is the other side of the Voronoi coin.
Delaunay edges are the perpendicular bisectors of the Voronoi edges, and vice
versa.
Thanks,
Andy
===========================================================================
To unsubscribe, send email to [EMAIL PROTECTED] and include in the body
of the message "signoff JAVA3D-INTEREST". For general help, send email to
[EMAIL PROTECTED] and include in the body of the message "help".
