Construction. If the input controls is non-null, a copy is made of the controls. To defer setting the control points, pass a null pointer and later

Construction. The preconditions for calling the constructor are 1 <= degree0 && degree0 + 1 < numControls0 <= numSamples0 1 <= degree1 && degree1 + 1

Construction. If the input controls is non-null, a copy is made of the controls. To defer setting the control points, pass a null pointer and later

Abstract base class.

Construction and destruction.

Disallow copy and assignment.

Construction and destruction. The determination that the curve is open or floating is based on the multiplicities. The 'uniform' input is used to av

The members are uninitialized.

Construction and destruction. The number of control points must be degree + 1. This object copies the input array. The domain is t in [0,1]. To va

Bidiagonalize using Householder reflections. On input, mMatrix is a copy of the input matrix passed to Solve(...). On output, mDiagonal and mSuperdiag

Bisect the function Phi(t) = t + a0 - a1 * t / sqrt(a2 * t^2 + a3) on the specified interval [tmin,tmax].

The bisection algorithm to find the unique root of F(t).

The precomputed information about the 256 configurations for voxels.

Ensure that BlockSize > 0 and NumBlocks > 0 at compile time.

Ensure that BlockSize > 0 and NumDimensions > 0 at run time.

Construction and destruction.

Construction and destruction. The default constructor sets the center to the origin (0,0,0) and the radius to 0. A radius of 0 denotes an invalid bo

Test whether the box is outside the slab contained by the planes of the cylinder end disks. This is accomplished by computing the interval of projecti

Construction.

Populate the node so that it contains the points split along the coordinate axes.

The sorting algorithm uses std::atan2 and contains arithmetic operations, all subject to floating-point rounding errors when T is 'float' or 'double'.

The sorting algorithm uses only arithmetic operations. It supports T of 'float' or 'double' but the correctness is not guaranteed to be theoretically

Constructor and destructor. The number of vertices must be 2 or larger. The vertices are assumed to be ordered. The segments are <V[i],V[i+1]> for