> Yes, I think it is difficult to extract triangles from vertices ubt it is > possible (if I understand correctly the problem).
Yes, is possible, but the solution has eluded me. > Are all the vertices in the same plane ? No > That is, do they form a polygon ? > If so, my idea would be to use a recursive methode : > - find 3 consecutive vertices that make a triangle included in the polygon > (there is always a set of vertices that matches this condition). Not only > the angle must be convex, but there is also a check to see if the segment > between vertices 1 and 3 intersects an other segment. > - remove the vertice 2 from the polygon to get a polygon with one vertice > less and reapply this method. Yes. Sounds similar to Delauney Triangulation. See, for example: http://astronomy.swin.edu.au/~pbourke/terrain/triangulate/ Miguel ------------------------------------------------------- This SF.Net email is sponsored by: New Crystal Reports XI. Version 11 adds new functionality designed to reduce time involved in creating, integrating, and deploying reporting solutions. Free runtime info, new features, or free trial, at: http://www.businessobjects.com/devxi/728 _______________________________________________ Jmol-developers mailing list Jmol-developers@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/jmol-developers
