| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| H A D | polyUtil.h | 40 Real area(Real A[2], Real B[2], Real C[2]);
42 Int pointLeftLine(Real A[2], Real B[2], Real P[2]);
43 Int pointLeft2Lines(Real A[2], Real B[2], Real
[all...] |
| H A D | definitions.h | 36 typedef float Real; typedef in typeref:typename:float
38 typedef Real Real2[2];
|
| H A D | polyUtil.cc | 43 Real area(Real A[2], Real B[2], Real C[2])
45 Real Bx, By, Cx, Cy;
64 Int pointLeftLine(Real A[2], Real B[2], Real P[2])
78 Int pointLeft2Lines(Real A[2], Real
[all...] |
| H A D | gridWrap.h | 45 Real u_min, u_max;
46 Real v_min, v_max;
52 Real* u_values; /*size is n_ulines*/
53 Real* v_values; /*size is n_vlines*/
60 Real uMin, Real uMax,
61 Real vMin, Real vMax
65 gridWrap(Int nUlines, Real *uvals,
66 Int nVlines, Real *vvla
[all...] |
| H A D | polyDBG.h | 40 Int DBG_edgesIntersectGen(Real A[2], Real B[2], Real C[2], Real D[2]);
41 Int DBG_intersectChain(vertexArray* chain, Int start, Int end, Real A[2], Real B[2]);
51 Int DBG_rayIntersectEdge(Real v0[2], Real dx, Real dy, Real v1
[all...] |
| H A D | monoTriangulation.h | 58 void insert(Real u, Real v);
59 void insert(Real v[2]);
61 void processNewVertex(Real v[2], primStream* pStream);
62 void outputFan(Real v[2], primStream* pStream);
64 void processNewVertex(Real v[2], Backend* backend);
65 void outputFan(Real v[2], Backend* backend);
78 Real** array;
83 vertexArray(Real vertices[][2], Int nVertices);
85 void appendVertex(Real* pt
[all...] |
| H A D | sampledLine.h | 44 sampledLine(Int n_points, Real pts[][2]);
45 sampledLine(Real pt1[2], Real pt2[2]);
51 void setPoint(Int i, Real p[2]) ;
60 void tessellate(Real u_reso, Real v_reso);//n segments
61 void tessellateAll(Real u_reso, Real v_reso);
|
| H A D | primitiveStream.h | 47 Real *vertices; /*the size >= 2 * num_vertices, each vertex (u,v)*/
77 Real* get_vertices() {return vertices;}
83 void insert(Real u, Real v);
84 void insert(Real v[2]) {insert(v[0], v[1]);}
89 void triangle(Real A[2], Real B[2], Real C[2])
|
| H A D | rectBlock.h | 57 void draw(Real* u_values, Real* v_values);
76 void draw(Real* u_values, Real* v_values);
|
| H A D | sampleComp.h | 39 void sampleConnectedComp(Real* topVertex, Real* botVertex,
59 void sampleCompLeft(Real* topVertex, Real* botVertex,
72 void sampleLeftSingleTrimEdgeRegionGen(Real topVert[2], Real botVert[2],
|
| H A D | sampleCompRight.h | 74 void sampleRightSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
87 void sampleCompRight(Real* topVertex, Real* botVertex,
100 void sampleRightSingleTrimEdgeRegionGen(Real topVert[2], Real botVert[2],
|
| H A D | directedLine.h | 69 Real* head(); /*points[0] if INCREASING, points[n-1] otherwise*/
70 Real* tail(); /*points[n-1] if INCREASING, points[0] otherwise*/
71 Real* getVertex(Int i); /*points[i] if INCREASING, points[n-1-i] otherwise*/
123 Real polyArea();
167 extern Int compV2InY(Real A[2], Real B[2]);
168 extern Int compV2InX(Real A[2], Real B[2]);
|
| H A D | gridWrap.cc | 54 gridWrap::gridWrap(Int nUlines, Real* uvals,
55 Int nVlines, Real* vvals)
67 u_values = (Real*) malloc(sizeof(Real) * n_ulines);
69 v_values = (Real*) malloc(sizeof(Real) * n_vlines);
80 Real uMin, Real uMax,
81 Real vMin, Real vMa
[all...] |
| H A D | sampleCompBot.h | 41 Real u,
48 Real u,
53 void sampleBotRightWithGridLinePost(Real* botVertex,
66 void sampleBotRightWithGridLine(Real* botVertex,
77 void sampleBotLeftWithGridLinePost(Real* botVertex,
90 void sampleBotLeftWithGridLine(Real* botVertex,
110 void sampleCompBot(Real* botVertex,
124 void sampleCompBotSimple(Real* botVertex,
|
| H A D | sampleCompTop.h | 38 void sampleCompTop(Real* topVertex,
52 void sampleCompTopSimple(Real* topVertex,
|
| H A D | sampleMonoPoly.h | 41 void triangulateXYMono(Int n_upper, Real upperVerts[][2],
42 Int n_lower, Real lowerVerts[][2],
63 void sampleLeftSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
94 Real* topVertex,
95 Real* botVertex,
116 void findUpCorners(Real *topVertex,
121 Real v,
122 Real uleft,
123 Real urigh
[all...] |
| H A D | partitionX.cc | 51 Real* T = v->head();
52 Real* P = v->getPrev()->head();
53 Real* N = v->getNext()->head();
69 Real* A = v->getPrev()->head();
70 Real* B = v->head();
71 Real* C = v->tail();
72 Real Bx,By, Cx, Cy;
|
| H A D | primitiveStream.cc | 67 void primStream::insert(Real u, Real v)
73 Real* temp = (Real*) malloc (sizeof(Real) * (2*size_vertices + 2));
152 vertices = (Real*) malloc(sizeof(Real) * sizeVertices);
|
| H A D | sampledLine.cc | 45 void sampledLine::setPoint(Int i, Real p[2])
95 sampledLine::sampledLine(Real pt1[2], Real pt2[2])
140 void sampledLine::tessellate(Real u_reso, Real v_reso)
154 Real du = (points[npoints-1][0] - points[0][0])/n;
155 Real dv = (points[npoints-1][1] - points[0][1])/n;
159 Real u,v;
175 void sampledLine::tessellateAll(Real u_reso, Real v_res
[all...] |
| H A D | monoChain.h | 50 Real minX, maxX, minY, maxY;
83 Real keyY; //the current horizotal line
84 Real chainIntersectHoriz(Real y); //updates current incrementally for efficiency
85 directedLine* find(Real y);//find dline so that y intersects dline.
|
| H A D | polyDBG.cc | 50 static Real area(Real A[2], Real B[2], Real C[2])
52 Real Bx, By, Cx, Cy;
198 Int DBG_edgesIntersectGen(Real A[2], Real B[2], Real C[2], Real D[2])
216 Int DBG_intersectChain(vertexArray* chain, Int start, Int end, Real
[all...] |
| H A D | partitionY.cc | 58 static Int compVertInY(Real A[2], Real B[2])
75 Real* vert = v->head();
91 Real* vert = v->head();
102 Real *A=v->getPrev()->head();
103 Real *B=v->head();
104 Real *C=v->tail();
124 Real* A = v->getPrev()->head();
125 Real* B = v->head();
126 Real*
[all...] |
| H A D | monoTriangulation.cc | 104 void monoTriangulationRecOpt(Real* topVertex, Real* botVertex,
120 Real left_v = left_chain->getVertex(left_current)[1];
121 Real right_v = right_chain->getVertex(right_current)[1];
162 void monoTriangulationRecGenTBOpt(Real* topVertex, Real* botVertex,
181 void triangulateXYMonoTB(Int n_left, Real** leftVerts,
182 Int n_right, Real** rightVerts,
188 Real* topMostV;
324 void monoTriangulationRecGenInU(Real* topVerte
[all...] |
| H A D | sampleCompBot.cc | 55 Real u,
81 Real u,
107 void sampleBotRightWithGridLinePost(Real* botVertex,
122 Real *tempBot;
127 Real tempTop[2];
175 Real tempTop[2];
183 Real tempTop[2];
193 void sampleBotRightWithGridLine(Real* botVertex,
232 void sampleBotLeftWithGridLinePost(Real* botVertex,
248 Real *tempBo
[all...] |
| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| H A D | monoTriangulationBackend.cc | 43 void reflexChain::outputFan(Real v[2], Backend* backend)
83 void reflexChain::processNewVertex(Real v[2], Backend* backend)
159 void monoTriangulationRec(Real* topVertex, Real* botVertex,
169 Real** inc_array ;
170 Real** dec_array ;
253 void monoTriangulationFunBackend(Arc_ptr loop, Int (*compFun)(Real*, Real*), Backend* backend)
303 void monoTriangulationRecFunBackend(Real* topVertex, Real* botVerte
[all...] |