Lines Matching refs:triangle

27 (rectangle or triangle) according to the per-patch outer and inner
80 For triangles, the tessellator subdivides a triangle primitive into smaller
124 relative influence of the three vertices of the triangle on the position of
227 triangle have counter-clockwise ordering if
234 normalized parameter space of the [eq]##i##th vertex of the triangle.
237 triangle have counter-clockwise ordering if [eq]#a# is positive, and
245 area of the triangle.
253 [[tessellation-triangle-tessellation]]
257 triangle is subdivided into a collection of triangles covering the area of
258 the original triangle.
259 First, the original triangle is subdivided into a collection of concentric
262 each triangle pair is filled by triangles produced by joining the vertices
265 triangle except the outermost is derived from the first inner tessellation
267 The edges of the outermost triangle are subdivided independently, using the
275 levels are exactly one after clamping and rounding, only a single triangle
284 produce _inner vertices_ positioned on the edge of the triangle.
291 For the outermost inner triangle, the inner triangle is degenerate -- a
292 single point at the center of the triangle -- if [eq]#n# is two.
293 Otherwise, for each corner of the outer triangle, an inner triangle corner
297 If [eq]#n# is three, the edges of the inner triangle are not subdivided and
298 it is the final triangle in the set of concentric triangles.
299 Otherwise, each edge of the inner triangle is divided into [eq]#n - 2#
304 Once the outermost inner triangle is subdivided, the previous subdivision
305 process repeats itself, using the generated triangle as an outer triangle.
322 outer triangle edges.
328 In this subdivision, two of the three vertices of each triangle are taken
329 from adjacent vertices on a subdivided edge of one triangle; the third is
330 one of the vertices on the corresponding edge of the other triangle.
331 If the innermost triangle is degenerate (i.e., a point), the triangle
333 vertices on that triangle with the center point.
334 If the innermost triangle is not degenerate, that triangle is added to the
339 triangle and the outermost inner triangle.
340 To do this, the temporary subdivision of the outer triangle edge above is
345 The original subdivision of the first inner triangle is retained.
348 If the first (and only) inner triangle is degenerate, a set of triangles is
349 produced by connecting each vertex on the outer triangle edges with the
352 After all triangles are generated, each vertex in the subdivided triangle is
354 the three vertices of the outer triangle.
362 <<drawing-triangle-lists, triangle lists>>, except that the order in which
363 each triangle is generated, and the order in which the vertices are
364 generated for each triangle, are implementation-dependent.
365 However, the order of vertices in each triangle is consistent across the
379 are decomposed into triangle pairs.
390 tessellation levels are exactly one, only a single triangle pair covering
445 Two of the three vertices of each triangle are adjacent vertices on a
458 <<drawing-triangle-lists, triangle lists>>, except that the order in which
459 each triangle is generated, and the order in which the vertices are
460 generated for each triangle, are implementation-dependent.
461 However, the order of vertices in each triangle is consistent across the