
Jaap Suter wrote: >>Hi, >> >>Cant you check whether two triangles share two vertices. If they do then they form a triangle >>strip. See if you can connect more triangles untill no more share two vertices.
This was actually my original assumption. The problem with an algo like that goes something like this example:
You have a box, standard with 6 sides. The top faces share verticies with the side faces and the side faces each share vertices with the two triangles that compose them. By replacing those vertices that are shared, the ordering becomes most important. Just try the shared vertex idea on paper and you'll soon realize that a box can't be wraped up in one triangle strip, which the algo would output considering each face shares two verts in the next face, which share vertices in the next face, et al.
