Construction and destruction. The input 'tree' must be dynamically allocated and created using 'storeInteriorTris = true'.

Create the color (0,0,0,0).

Support for Evaluate(...).

Support for Evaluate(...).

Support for Evaluate(...).

Support for Evaluate(...).

Support for Evaluate(...).

Support for Evaluate(...).

Support for Evaluate(...).

Compute (sin(angle))^2 for the polygon edges emanating from the support vertices of the box. The return value is 'true' if at least one angle is in [0

The fast O(n) search.

This is the slow O(n^2) search.

Compute coordinate-directional convex set. For a given coordinate direction (x, y, or z), identify the first and last 1-valued voxels on a segment of

Compute the Christoffel symbols of the second kind for the current state. The values depend on the inverse of the metric tensor, so they may be compu

Wrapping the classifier computations in a function supports conversion of type T. If T is Rational, then g0, g1, g2, and g3 are passed by reference to

Wrapping the classifier computations in a function supports conversion of type T. If T is Rational, then g0, g1, and g2 are passed by reference to thi

Wrapping the classifier computations in a function supports conversion of type T. If T is Rational, then g0, g1, g2, g3, and g4 are passed by referenc

The current estimate of the minimum location is mTCurr[0..d-1]. The direction of the current line to search is mDCurr[0..d-1]. This line must be clipp

Support for construction.

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

Algorithm 5.1.1 (Householder Vector). The matrix A has size numRows-by-numCols with numRows >= numCols and the vector v has size numRows.

Algorithm 5.1.1 (Householder Vector). The matrix A has size numRows-by-numCols with numRows >= numCols and the vector v has size numCols.

Support for ComputeSegmentCurvature.

The bounding volume for the primitives' vertices depends on the type of primitive. A derived class representing a primitive tree must implement this.

Let C be the box center and let U0, U1 and U2 be the box axes. Each input point is of the form X = C + y0*U0 + y1*U1 + y2*U2. The following code compu

The derived classes must override ComputeInteriorBox, calling the base class function first. They must then compute the box extents to ensure the box

Let C be the box center and let U0, U1 and U2 be the box axes. Each input point is of the form X = C + y0*U0 + y1*U1 + y2*U2. The following code compu

Let C be the box center and let U0, U1 and U2 be the box axes. Each input point is of the form X = C + y0*U0 + y1*U1 + y2*U2. The following code compu

Compute the intersection of the line dR/ds = 0 with the domain [0,1]^2. The direction of the line dR/ds is conjugate to (1,0), so the algorithm for mi

The bounding volume for a single primitive's vertices depends on the type of primitive. A derived class representing a primitive tree must implement t