If 'this' is P(t) and the divisor is D(t) with degree(P) >= degree(D), then P(t) = Q(t)*D(t)+R(t) where Q(t) is the quotient with degree(Q) = degree(P

Member access.

(x,y,z,0)

The function returns 'true' when the depth range is [0,1] (DirectX) or 'false' when the depth range is [-1,1] (OpenGL).

Call one of these functions before binding the buffer to the engine. These will set the CounterType and set the usage to SHADER_OUTPUT.

Currently, OpenGL 4.6 or later is required for compute shaders. Because of deferred construction via Initialize(...), the requirements are not known u

Copy Delaunay tetrahedra to compact arrays mIndices and mAdjacencies. The array information is accessible via the functions GetIndices(size_t, std::ar

These methods should be used instead of the attach/detach methods in the Node base class.

Compute the functional value a^T*M*a when lambda is zero or lambda*w^T*(M+lambda*I)*w when lambda is positive. See the thin plate splines PDF for a d

Compute the indices for non-arbitrary topologies. This function is called by derived classes.

These two functions are exact for computing Result::sqrDistance when T is a rational type. However, it is generally more robust than the operator()(..

Compute a vertex normal, an average of the normals of the 3 faces sharing the vertex. The input 'vertex' must be in {0,1,2,3} and are the indices into

Eliminate any leading zeros in the polynomial, except in the case the degree is 0 and the coefficient is 0. The elimination is necessary when arithme

Get the individual frustum values.

Compute a single eigenvector, which amounts to computing column c of matrix Q. The reflections and rotations are applied incrementally. This is usef

Return the feature level of the created device. This will be a feature less than DX11.1 when your graphics driver does not support DX11.1.

Get the current frame. The returned frame is a copy of the member data so that the texture may be consumed at any time without fear of the producer o

Compute M = sum_{d=0}^{N-1} U[d]*U[d]^T/e[d]^2.

Member access.

The number of rectangles in the set.

Member access.

The input must satisfy 0 <= i < 6 where the extremes were passed to the constructor. The normals are directed into the interior of the simulation regi

(s0,s1,s2,1)

Member access.

The 'edge' is the constrained edge to be inserted into the triangulation. If that edge is already in the triangulation, the function returns without a

R*S (GTE_USE_MAT_VEC defined) or S*R (GTE_USE_MAT_VEC not defined)

RS-matrix with S = c*I

Scale the polynomial so the highest-degree term has coefficient 1.

The extraction does not use any topological information about the level surfaces. The triangles can be a mixture of clockwise-ordered and counterclock

point location (-1 inside, 0 on polygon, 1 outside)