Call this only after you are finished inserting points into or removing points from the triangulation.

Basic fitting algorithm. See ApprQuery.h for the various Fit(...) functions that you can call.

The return value is 'true' when the linear system of the algorithm is solvable, 'false' otherwise. If 'false' is returned, the sphere center and radiu

See #1 in the comments at the beginning of this file. The preconditions are 1. inVertices.size() is a positive multiple of D The postconditions are 1.

Containment queries.

Containment queries.

Member access.

Get the eigenvalues of the matrix passed to Solve(...). The input 'eigenvalues' must have N elements.

The eigenvector matrix is a rotation (return +1) or a reflection (return 0). If the input 'size' to the constructor is 0 or the input 'eigenvectors'

Accumulate the Householder reflections and Givens rotations to produce the orthogonal matrix Q for which Q^T*A*Q = D. The input 'eigenvectors' must h

Member access.

Accessors to level of detail (MinLOD <= LOD <= MaxLOD is required).

Member access.

Access the actual number of iterations used in a call to Solve.

Mesh information.

Mesh information.

Member access.

Member access.

Get a block of numRequested bits starting with the leading 1-bit of the nonzero number. The returned number has the prefix stored in the high-order b

Member access.