Lines Matching refs:eq
133 rectangle in the [eq]#u# dimension (i.e. the coordinates in code:TessCoord
134 are of the form [eq]#(0,x)# through [eq]#(1,x)# for all tessellation
139 [eq]#[0,1]#, as illustrated
170 [eq]#(u,v,w)#, where [eq]#u {plus} v {plus} w = 1.0#, and indicates the
173 For quads and isolines, the position is a [eq]#(u,v)# coordinate indicating
185 corresponds to a floating-point [eq]#NaN# (not a number) in implementations
186 supporting [eq]#NaN#.
208 clamped to [eq]#[1, pname:maxLevel]#, where [eq]#pname:maxLevel# is the
211 The result is rounded up to the nearest integer [eq]#n#, and the
212 corresponding edge is divided into [eq]#n# segments of equal length in (u,v)
216 clamped to [eq]#[2, pname:maxLevel]# and then rounded up to the nearest even
217 integer [eq]#n#.
219 [eq]#[1, pname:maxLevel - 1]# and then rounded up to the nearest odd integer
220 [eq]#n#.
221 If [eq]#n# is one, the edge will not be subdivided.
222 Otherwise, the corresponding edge will be divided into [eq]#n - 2# segments
226 decrease monotonically with [eq]#n - f#, where [eq]#f# is the clamped
228 When [eq]#n - f# is zero, the additional segments will have equal length to
230 As [eq]#n - f# approaches 2.0, the relative length of the additional
236 [eq]#f#.
276 {empty}:: [eq]#a = u~0~ v~1~ - u~1~ v~0~ {plus} u~1~ v~2~ - u~2~ v~1~
279 is negative, and clockwise ordering if [eq]#a# is positive.
280 [eq]#u~i~# and [eq]#v~i~# are the [eq]#u# and [eq]#v# coordinates in
281 normalized parameter space of the [eq]##i##th vertex of the triangle.
284 triangle have counter-clockwise ordering if [eq]#a# is positive, and
285 clockwise ordering if [eq]#a# is negative.
291 The value [eq]#a# is proportional (with a positive factor) to the signed
294 In code:Triangles mode, even though the vertex coordinates have a [eq]#w#
295 value, it does not participate directly in the computation of [eq]#a#, being
296 an affine combination of [eq]#u# and [eq]#v#.
316 subdivisions of the [eq]#u = 0# (left), [eq]#v = 0# (bottom), and [eq]#w =
323 with [eq]#(u,v,w)# coordinates of [eq]#(0,0,1)#, [eq]#(1,0,0)#, and
324 [eq]#(0,1,0)# is generated.
327 though it were originally specified as [eq]#1 {plus} {epsilon}# and will
337 spacing, generating [eq]#n# segments.
339 single point at the center of the triangle -- if [eq]#n# is two.
344 If [eq]#n# is three, the edges of the inner triangle are not subdivided and
346 Otherwise, each edge of the inner triangle is divided into [eq]#n - 2#
347 segments, with the [eq]#n - 1# vertices of this subdivision produced by
349 through the [eq]#n - 1# innermost vertices of the subdivision of the outer
389 Instead, the [eq]#u = 0#, [eq]#v = 0#, and [eq]#w = 0# edges are subdivided
422 rectangles, where the number of rectangles along the [eq]#u = 0# and [eq]#u
423 = 1# (vertical) and [eq]#v = 0# and [eq]#v = 1# (horizontal) edges are
429 subdivisions of the [eq]#u = 0# (left), [eq]#v = 0# (bottom), [eq]#u = 1#
430 (right), and [eq]#v = 1# (top) edges, respectively.
441 [eq]#1 {plus} {epsilon}# and will result in a two- or three-segment
447 subdividing the [eq]#u = 0# and [eq]#u = 1# edges of the outer rectangle
448 into [eq]#m# segments using the clamped and rounded first inner tessellation
450 The [eq]#v = 0# and [eq]#v = 1# edges are subdivided into [eq]#n# segments
452 Each vertex on the [eq]#u = 0# and [eq]#v = 0# edges are joined with the
453 corresponding vertex on the [eq]#u = 1# and [eq]#v = 1# edges to produce a
461 If either [eq]#m# or [eq]#n# is two, the inner rectangle is degenerate, and
472 tessellation levels of (a) [eq]#(4,2)# and (b) [eq]#(7,4)# are shown.
486 Instead, the [eq]#u = 0#, [eq]#v = 0#, [eq]#u = 1#, and [eq]#v = 1# edges
519 covering the full range [eq]#[0,1]#.
528 The [eq]#u = 0# and [eq]#u = 1# edges of the rectangle are subdivided
532 An isoline is drawn connecting each vertex on the [eq]#u = 0# rectangle edge
533 to the corresponding vertex on the [eq]#u = 1# rectangle edge, except that
534 no line is drawn between [eq]#(0,1)# and [eq]#(1,1)#.
535 If the number of isolines on the subdivided [eq]#u = 0# and [eq]#u = 1#
536 edges is [eq]#n#, this process will result in [eq]#n# equally spaced lines
540 Each of the [eq]#n# isolines is then subdivided according to the second
541 outer tessellation level and the tessellation spacing, resulting in [eq]#m#