HomeSort by: relevance | last modified time | path
    Searched refs:dline (Results 1 - 8 of 8) sorted by relevancy

  /xsrc/external/mit/glu/dist/src/libnurbs/internals/
dataTransform.cc 77 directedLine* dline;
80 dline = &dline_buf[index_dline];
82 dline->init(INCREASING, sline);
83 ret = dline;
89 dline = &dline_buf[index_dline];
91 dline->init(INCREASING, sline);
92 ret->insert(dline);
172 directedLine* dline = new directedLine(INCREASING, sline); local
174 ret = dline;
176 ret->insert(dline);
    [all...]
slicer.cc 918 directedLine *dline = arcToDLine(arc); local
920 ret = dline;
922 ret->insert(dline);
936 directedLine *dline = new directedLine(INCREASING, sline); local
938 ret = dline;
940 ret->insert(dline);
  /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
sampleCompRight.cc 422 directedLine* dline; local
443 dline = new directedLine(INCREASING, sline);
445 poly = dline;
447 poly->insert(dline);
455 dline=new directedLine(INCREASING, sline);
457 poly = dline;
459 poly->insert(dline);
468 dline = new directedLine(INCREASING, sline);
469 poly->insert(dline);
475 dline = new directedLine(INCREASING, sline)
    [all...]
directedLine.cc 88 void directedLine::deleteSingleLine(directedLine* dline)
90 //make sure that dline->prev->tail is the same as
91 //dline->next->head. This is for numerical erros.
96 dline->next->head()[0] = dline->prev->tail()[0];
97 dline->next->head()[1] = dline->prev->tail()[1];
99 dline->prev->next = dline->next;
100 dline->next->prev = dline->prev
    [all...]
monoChain.cc 467 directedLine *dline = vert->getHead(); local
468 directedLine *dlinePrev = dline->getPrev();
469 if(isBelow(dline, dline) && isBelow(dline, dlinePrev))
484 if(cuspType(dline) == 1)//interior cusp
505 ret_ranges[i] = sweepRangeMake( dline, 1, dlinePrev, 1);
512 else if(isAbove(dline, dline) && isAbove(dline, dlinePrev)
    [all...]
monoTriangulation.cc 340 directedLine* dline; local
350 dline = new directedLine(INCREASING, sline);
351 poly->insert(dline);
354 dline = new directedLine(INCREASING, sline);
355 poly->insert(dline);
360 dline = new directedLine(INCREASING, sline);
361 poly = dline;
369 dline = new directedLine(INCREASING, sline);
370 poly->insert(dline);
374 dline = new directedLine(INCREASING, sline)
    [all...]
directedLine.h 96 void deleteSingleLine(directedLine* dline);
sampleMonoPoly.cc 995 directedLine* dLine = topEdge;
1012 while( (vtail=dLine->tail()[1]) > grid_v_value){
1014 tempMaxU = max(tempMaxU, dLine->tail()[0]);
1015 dLine = dLine -> getNext();
1018 if( fabs(dLine->head()[1] - vtail) < ZERO)
1023 slop = (dLine->head()[0] - dLine->tail()[0]) / (dLine->head()[1]-vtail);
1029 uinterc = max(dLine->head()[0], dLine->tail()[0])
2033 directedLine* dline; local
    [all...]

Completed in 41 milliseconds