//********************************** //*** subdivision for T-meshes // Written by Jarek Rossignac, June 2006 //********************************** void splitEdges() { // creates a new vertex for each edge and stores its ID in the W of the corner (and of its opposite if any) for (int i=0; i<3*nt; i++) { // for each corner i if(border(i)) {G[nv]=midPt(g(n(i)),g(p(i))); W[i]=nv++;} else {if(i