[Bf-blender-cvs] SVN commit: /data/svn/bf-blender [31467] branches/soc-2010-rohith291991/ intern/comiso/intern/uv.cpp: Further updates to parametrization.

[Rohith B V]

Revision: 31467
          http://projects.blender.org/plugins/scmsvn/viewcvs.php?view=rev&root=bf-blender&revision=31467
Author:   rohith291991
Date:     2010-08-19 23:52:25 +0200 (Thu, 19 Aug 2010)

Log Message:
-----------
Further updates to parametrization.

Modified Paths:
--------------
    branches/soc-2010-rohith291991/intern/comiso/intern/uv.cpp

Modified: branches/soc-2010-rohith291991/intern/comiso/intern/uv.cpp
===================================================================
--- branches/soc-2010-rohith291991/intern/comiso/intern/uv.cpp	2010-08-19 21:30:14 UTC (rev 31466)
+++ branches/soc-2010-rohith291991/intern/comiso/intern/uv.cpp	2010-08-19 21:52:25 UTC (rev 31467)
@@ -1386,7 +1386,7 @@
 			if(fabs(v1[0]-round(v1[0]))<1e-7)
 				{
 			result->verts[vc].flag|=CV_INTEGER;
-printf("hap1\n");
+
 				}
 			result->verts[vc].numNeighbors=0;
 
@@ -1525,7 +1525,7 @@
 			if(fabs(v1[1]-round(v1[1]))<1e-7)
 				{
 			result->verts[vc].flag|=CV_INTEGER;
-printf("hap2\n");
+
 				}
 			result->verts[vc].numNeighbors=0;
 
@@ -1614,7 +1614,7 @@
 			if(fabs(u1[0]-round(u1[0]))<1e-7)
 				{
 			result->verts[vc].flag|=CV_INTEGER;
-			printf("hap3\n");
+		
 				}
 			result->verts[vc].numNeighbors=0;
 
@@ -1755,7 +1755,7 @@
 			if(fabs(u1[1]-round(u1[1]))<1e-7)
 				{
 				result->verts[vc].flag|=CV_INTEGER;
-				printf("hap4\n");
+	
 				}
 			result->verts[vc].numNeighbors=0;
 
@@ -2550,36 +2550,41 @@
 
 			while(terminate)
 				{
-
+printf("1\n");
 				terminate=0;
 
 				for(int i=0;i<numCV;i++)
 					{
+					printf("2\n");
 
 					std::vector<int> newVerts;
 					newVerts.resize(0);
 
 					for(int j=0;j<currentVerts[i].size();j++)
 						{
-
+printf("3\n");
 						terminate++;
 
 						int index=result->verts[currentVerts[i][j]].pvert;
-						CVert *vert=&(result->verts[index]);
+						CVert *vert=&(result->verts[currentVerts[i][j]]);
 
 						for(int k=0;k<vert->numNeighbors;k++)
 							{
+
+							printf("4\n");
 							int nIndex=vert->neighbors[k];
 
 							if(!(result->verts[nIndex].flag & CV_VISITED))
 								{
 
+								printf("5\n");
 								result->verts[nIndex].flag |= CV_VISITED;
-								if(!(result->verts[i].flag & CV_INTEGER))
+								if(!(result->verts[nIndex].flag & CV_INTEGER))
 								result->verts[nIndex].pvert=index;
 								else
 									{
 									
+									printf("6\n");
 									result->verts[nIndex].pvert=vc1;
 
 									//add point
@@ -2587,7 +2592,7 @@
 										{result1->verts=(CVert*)MEM_mallocN(sizeof(CVert)*(vc1+1), "vertices");}
 									else
 										{
-
+printf("7\n");
 										result1->verts=(CVert*)MEM_reallocN(result1->verts,(sizeof(CVert)*(vc1+1)));}
 
 									result1->verts[vc1].co[0]=result->verts[i].co[0];
@@ -2599,7 +2604,7 @@
 									result1->verts[vc1].numNeighbors=0;
 									vc1++;
 
-									printf("new point!!\n");
+									
 									//create edge
 									if(result1->edges==NULL)
 			result1->edges=(CEdge*)MEM_mallocN(sizeof(CEdge)*(ec1+1), "edges");