Searched refs:sortedVertices (Results 1 - 4 of 4) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DpartitionY.h93 void findDiagonals(Int total_num_edges, directedLine** sortedVertices, sweepRange** ranges, Int& num_diagonals, directedLine** diagonal_vertices);
H A DmonoChain.h95 Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges);
97 void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices,
H A DpartitionY.cc333 void findDiagonals(Int total_num_edges, directedLine** sortedVertices, sweepRange** ranges, Int& num_diagonals, directedLine** diagonal_vertices) argument
341 directedLine* vert =sortedVertices[i];
357 diagonal_vertices[k++] = sortedVertices[j];
371 diagonal_vertices[k++] = sortedVertices[j];
722 void sweepY(Int nVertices, directedLine** sortedVertices, sweepRange** ret_ranges) argument
732 directedLine* vert = sortedVertices[i];
H A DmonoChain.cc451 Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges) argument
465 monoChain* vert = sortedVertices[i];
567 void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices, argument
575 sortedVertices[i]->resetCurrent();
579 directedLine* vert = sortedVertices[i]->getHead();
598 if(sortedVertices[j]->getHead()->head()[1] > minVert->head()[1])
609 diagonal_vertices[k++] = sortedVertices[j]->getHead();
627 if(sortedVertices[j]->getHead()->head()[1] < maxVert->head()[1])
636 diagonal_vertices[k++] = sortedVertices[j]->getHead();

Completed in 5 milliseconds