Multiply a row of A by a column of B.

inline const T & max(const T & a, const T & b)

Robust floating point comparisons: http://realtimecollisiondetection.net/blog/?p=89

Get bit.

Get pointer.

Vertex queries.

Determine if this is a boundary face.

inline const T & min(const T & a, const T & b)

Edge queries.

We can probably do better than this. See for example: http://dss.stephanierct.com/DevBlog/?p=8

Return the next power of two. * @see http://graphics.stanford.edu/~seander/bithacks.html * @warning Behaviour for 0 is undefined. * @note

Set a bit.

Count the number of edges in this face.

inline const T & max3(const T & a, const T & b, const T & c)

Clear all the bits.

inline const T & min3(const T & a, const T & b, const T & c)

inline const T & clamp(const T & x, const T & a, const T & b)

take a -128..127 value and clamp it and convert to 0..255

Portable version of fopen.

@@ The implementation in nvmath.h should be equivalent.

Set first edge of all colocals.

Get a random number on [0, max] interval.

Link boundary edges once the mesh has been created.

Vertices

Get a random number between 0 - 65536.

if there's a pending marker from the entropy stream, return that otherwise, fetch from the stream and get a marker. if there's no marker, return 0xff,