This should compute convex hull and use rotating calipers to find the best box. Currently it uses a brute force method. If vertices are empty, the bou

Cost is combined metrics * weights.

Fit a plane to a collection of points. Fast, and accurate to within a few degrees. Returns None if the points do not span a plane. https://www.ilikebi

Returns a value in [0-1]. 0 if face normal is coplanar to the chart's best fit normal. 1 if face normal is perpendicular.

compute unit inward normals for each edge.

Compute the convex hull using Graham Scan.

Tridiagonal solver from Charles Bloom. Householder transforms followed by QL decomposition. Seems to be based on the code from Numerical Recipes in C.

Returns true if any of the charts can grow more.

Insert the given element at the given index shifting all the elements up.

m_faceCharts for the chart faces must be set to the chart ID. Needed to compute boundary edges.