intcount3=0;//counts other triangles with this vertex
intcount3=0;//counts other triangles with this vertex
intcount6=0;
intcount6=0;
intcount7=0;
intcount7=0;
/*
for (int j = 0; j < ib_combined.length(); j++){
if(log_subdiv_trace().isDebugEnabled()){
if (j != i && j != i+1 && j != i+2){
for(intj=0;j<ib_combined.length();j++){
//for debugging // checking if patch is regular.
if(j!=i&&j!=i+1&&j!=i+2){
if (vb[ib_combined[j]] == v3) count3++;
//for debugging // checking if patch is regular.
if (vb[ib_combined[j]] == v6) count6++;
if(vb[ib_combined[j]]==v3)count3++;
if (vb[ib_combined[j]] == v7) count7++;
if(vb[ib_combined[j]]==v6)count6++;
if(vb[ib_combined[j]]==v7)count7++;
}
}
if(count3!=5||count6!=5||count7!=5){
qCWarning(log_subdiv)<<"Counts wrong! 3: "<<count3<<", 6: "<<count6<<", 7: "<<count7<<".\nEither this patch is not regular, or you didn't pass all neighboring triangles.";
}
}
}
}
if (count3 != 5 || count6 != 5 || count7 != 5){
qCWarning(log_subdiv) << "Counts wrong! 3: "<< count3 <<", 6: " << count6 << ", 7: " << count7 << ".\nEither this patch is not regular, or you didn't pass all neighboring triangles.";
}
*/
//find triangles with shared edge. Fills i2, i4, i10.
//find triangles with shared edge. Fills i2, i4, i10.