>Egon wrote: >> Ok, I'll think about how to get to triangles from a set of vertices... >> (suggestions welcome, ofcourse)... > >Egon, > >This is a difficult problem that I have been working on for months. > >This is the reason that my surface code does not work.
Yes, I think it is difficult to extract triangles from vertices ubt it is possible (if I understand correctly the problem). Are all the vertices in the same plane ? 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. Nicolas ------------------------------------------------------- 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
