Thanks a lot! yes, also convex hull algorithm may work too ;) Cheers!!!
________________________________ De: Sergey Kurdakov <[email protected]> Para: Raul Fernandez <[email protected]>; bf-blender developers <[email protected]> Enviado: miércoles 7 de septiembre de 2011 19:15 Asunto: [Bf-committers] bridging faces algorithm Hi Raul, I think, that general algorithm like constrained delaunay triangulation will fit - because what is needed -to have a mesh to fit into boundary points between two rings and it is what constrained delaunay will do, so docs from http://gts.sourceforge.net/ or docs at http://tetgen.berlios.de/ for http://tetgen.berlios.de/features.html#F3 might be of help. Regards Sergey _______________________________________________ Bf-committers mailing list [email protected] http://lists.blender.org/mailman/listinfo/bf-committers
