Hi Desiree,
There are many different algorithms for constructing a Delaunay
triangulation, some of which are better than others. I ported some
Delaunay triangulation algorithms from C to Java for use in VisAD, a
system for visualization of scientific data. These algorithms include
an N-D algorithm originally written by Ken Clarkson and a 2-D/3-D
algorithm written by David F. Watson. I wrote an "imperfect" algorithm
for faster 2-D triangulations that finds a decent triangulation for 2-D
data (but not necessarily a "perfect" Delaunay triangulation). VisAD
also provides an interface for supplying your own preconstructed
triangulations should you decide to use your own algorithm. VisAD also
supports using an existing 2-D triangulation as the triangulation for a
2-D terrain over 3-D data.
You can find VisAD at:
http://www.ssec.wisc.edu/~billh/visad.html
The relevant classes are: visad.DelaunayWatson, visad.DelaunayClarkson,
visad.DelaunayFast, visad.DelaunayCustom and visad.Delaunay.
There are many other algorithms available online, but very few are
coded in Java.
Good luck,
Curtis
At 10:07 7/10/00, you wrote:
>Hi,
>I have a given set of Points with x,y,z coordinates and want to
>triangulate a terrain object consisting of triangles with the delaunay
>algorithm. Has anyone experience with that? I would appreaciate a
>howtodo-recipee or some sample code or even links, where I can find more
>information.
>
>Thanks Desiree
>
>
>
>o------------------------------------------------------------------------o
>| Desiree Hilbring Institut fuer Photogrammetrie und Fernerkundung |
>| Universitaet Karlsruhe, Germany |
>| |
>| email: [EMAIL PROTECTED] |
>| # 0721 6083676 |
>o------------------------------------------------------------------------o
===========================================================================
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".
