Lines Matching defs:upper

114 	Patch upper( *this, 0, ptb[0], 0 );
125 Patch upper( *this, 1, ptb[1], 0 );
136 Patch::Patch( Patch& upper, int param, REAL value, Patch *n )
140 lower.cullval = upper.cullval;
141 lower.mapdesc = upper.mapdesc;
142 lower.notInBbox = upper.notInBbox;
143 lower.needsSampling = upper.needsSampling;
144 lower.pspec[0].order = upper.pspec[0].order;
145 lower.pspec[1].order = upper.pspec[1].order;
146 lower.pspec[0].stride = upper.pspec[0].stride;
147 lower.pspec[1].stride = upper.pspec[1].stride;
153 REAL d = (value-upper.pspec[0].range[0]) / upper.pspec[0].range[2];
155 mapdesc->subdivide( upper.spts, lower.spts, d, pspec[1].order,
159 mapdesc->subdivide( upper.cpts, lower.cpts, d, pspec[1].order,
163 mapdesc->subdivide( upper.bpts, lower.bpts, d, pspec[1].order,
166 lower.pspec[0].range[0] = upper.pspec[0].range[0];
168 lower.pspec[0].range[2] = value - upper.pspec[0].range[0];
169 upper.pspec[0].range[0] = value;
170 upper.pspec[0].range[2] = upper.pspec[0].range[1] - value;
172 lower.pspec[1].range[0] = upper.pspec[1].range[0];
173 lower.pspec[1].range[1] = upper.pspec[1].range[1];
174 lower.pspec[1].range[2] = upper.pspec[1].range[2];
178 REAL d = (value-upper.pspec[1].range[0]) / upper.pspec[1].range[2];
180 mapdesc->subdivide( upper.spts, lower.spts, d, pspec[0].order,
183 mapdesc->subdivide( upper.cpts, lower.cpts, d, pspec[0].order,
186 mapdesc->subdivide( upper.bpts, lower.bpts, d, pspec[0].order,
188 lower.pspec[0].range[0] = upper.pspec[0].range[0];
189 lower.pspec[0].range[1] = upper.pspec[0].range[1];
190 lower.pspec[0].range[2] = upper.pspec[0].range[2];
192 lower.pspec[1].range[0] = upper.pspec[1].range[0];
194 lower.pspec[1].range[2] = value - upper.pspec[1].range[0];
195 upper.pspec[1].range[0] = value;
196 upper.pspec[1].range[2] = upper.pspec[1].range[1] - value;
203 memcpy( lower.bb, upper.bb, sizeof( bb ) );
206 upper.checkBboxConstraint();
280 // upper bound on path length between sample points
309 // t2 is upper bound on the distance between surface and tessellant
370 // t1 is upper bound on path length