EPOS algorithm based on: http://www.ep.liu.se/ecp/034/009/ecp083409.pdf

Approximate bounding sphere, based on "An Efficient Bounding Sphere" by Jack Ritter, from "Graphics Gems"

Assert handler method.

Assert handler method.

Assert handler method.

Create a rotation quaternion for @a angle alpha around normal vector @a v.

Provide begin/end pointers for C++11 range-based for loops.

Given a convex hull, finds best fit polygon with the given number of edges. Brute force implementation, tries all possible edges, but may not arrive t

It may be useful to pack mulitple bit arrays together interleaving their bits.

Count the number of boundary edges in the face.

Get boundary length.

Get const vector pointer.

Build a basis from 2 vectors and a handness flag.

Get half edge mesh.

Get tri mesh.

Get byte order.

Return true if the edge doesn't exist or doesn't have any adjacent face.

Return true if the face can be added to the manifold mesh.

Get vector capacity.

Return the size of the string container.

static*/

Clip the given segment against this box.

Clone this string

Compute texture space deltas. This method takes two edge vectors that form a basis, determines the coordinates of the canonic vectors in that basis, a

Compute a seamless texture atlas.

compute unit inward normals for each edge.

Return the number of connected components.

Compute the convex hull using Graham Scan.

Get vector size.

Count the number of bits clear.

Count the number of bits set.