Cross Reference: /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/polyDBG.cc

Lines Matching refs:temp
62   directedLine* temp;
65   for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
67       if(area(temp->head(), temp->tail(), temp->getNext()->tail()) < 0.00000)
78    directedLine* temp;
84   for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
87       cur_sign = compV2InX(temp->tail(), temp->head());
106   directedLine* temp;
115   for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
117       if( fabs(temp->head()[0] - temp->tail()[0]) <= fabs(temp->head()[1]-temp->tail()[1]))
118 	V_count += temp->get_npoints();
120 	U_count += temp->get_npoints();
122       if(temp->head()[0] == temp->tail()[0])
123 	V_count += temp->get_npoints();
124       else if(temp->head()[1] == temp->tail()[1])
125 	U_count += temp->get_npoints();
259   directedLine* temp;
262   for(temp=poly->getNext(); temp != poly; temp=temp->getNext())
263     if(DBG_edgesIntersect(edge, temp))
272   directedLine* temp;
275   for(temp=p1->getNext(); temp!= p1; temp = temp->getNext())
276     if(DBG_edgeIntersectPoly(temp, p2))
286   directedLine *temp;
287   for(temp=pList; temp != NULL; temp = temp->getNextPolygon())
288     if(DBG_polygonSelfIntersect(temp))
291   for(temp=pList; temp!=NULL; temp=temp->getNextPolygon())
293       for(temp2=temp->getNextPolygon(); temp2 != NULL; temp2=temp2->getNextPolygon())
294 	if(DBG_polygonsIntersect(temp, temp2))
380   directedLine* temp;
385   for(temp=poly->getNext(); temp != poly; temp = temp->getNext())
386     if(DBG_rayIntersectEdge(v0, dx, dy, temp->getPrev()->head(), temp->head(), temp->tail()))
414   directedLine* temp;
425   for(temp = list; temp != NULL; temp = temp->getNextPolygon())
427       if(poly != temp)
428 	if(DBG_pointInsidePoly(poly->head(), temp))
446   directedLine* temp;
447   for(temp=oldNext; temp!=poly; temp = oldNext)
449       if(temp->getDirection() == INCREASING)
450 	temp->putDirection(DECREASING);
452 	temp->putDirection(INCREASING);
454       oldNext = temp->getNext();
455       temp->putNext(temp->getPrev());
456       temp->putPrev(oldNext);
464   directedLine* temp;
468   for(temp=polygon->getNext(); temp != polygon; temp=temp->getNext())
470       if(temp->head()[0] != temp->getPrev()->tail()[0] ||
471 	 temp->head()[1] != temp->getPrev()->tail()[1])
484   directedLine* temp;
496   for(temp = polyList; temp!= NULL; temp = temp ->getNextPolygon())
498       if(! DBG_checkConnectivity(temp))
506   for(temp = polyList; temp!= NULL; temp = temp ->getNextPolygon())
512       if( DBG_enclosingPolygons(temp, polyList) % 2 == 0)
517       Int actualDir = DBG_isCounterclockwise(temp);
523 	  DBG_reverse(temp);
535   directedLine *temp;
536   for(temp=begin; temp != end; temp = temp->getNext())
538       if(DBG_edgesIntersect(e, temp))
539 	 return temp;
630   directedLine *temp;
655 	  for(temp=end->getNext(); temp!=begin; temp= temp->getNext())
657 //printf("temp=(%f,%f)\n", temp->head()[0], temp->head()[1]);
658 	       directedLine *intersect = DBG_edgeIntersectChainD(temp, begin, end);
661 		  crt = crt->deleteChain(intersect, temp);
667 		  end = temp;
681   directedLine* temp;
685   for(temp=list; temp != NULL; temp = tempNext)
688       tempNext = temp->getNextPolygon();
690       left = DBG_cutIntersectionPoly(temp, cutOccur);
699   directedLine *temp;
712   for(temp = polygonList->getNextPolygon(); temp != NULL; temp = temp->getNextPolygon())
714       DBG_collectSampledLinesPoly(temp, tempHead, tempTail);
723   directedLine *temp;
730   for(temp = polygon->getNext(); temp != polygon; temp=temp->getNext())
732       retHead = temp->getSampledLine()->insert(retHead);