3D Triangulation

Your description may be clear to others but it was not to me.

Triangulation usually refers to something you do on 2D surfaces. 2D surfaces can of coures be embedded in 3D space. 2D manifolds are often represented as triangulated meshes of 3D points.

What is your problem. Do you have a collection of 3D points from some scanning apparatus and you wish to generate triangular surface meshes so that you can display them?

Doesn't really matter to me. I won't be able to point you at any API or any references since I don't do any 3D Graphics or computational geometry, but perhaps others will respond if you give some better indication of what it is that you are looking for.

marlin314a at 2007-7-15 13:58:37 >

> Further, is there any Java API capable of finding

> g convex hulls?

>

> Thanks in advance,

>

> Monique

I don't know of an API (which says absolutely nothing!), but [url=http://www.cs.sunysb.edu/~algorith/implement/orourke/implement.shtml]here[/url] you can download a 3D Convex Hull algorithm in Java which writes a set of 3D points to an output file using the OFF file format. OFF files can be viewed using Geomview.

Good luck.

OFF files can be viewed using Geomview

prometheuzza at 2007-7-15 13:58:37 >