evaluate the i-th smooth octahedral basis

Report success of a sub-test File f passed the test, msg is a happy success note, *args is format()ing args for msg.

---------------------------------------------------------------------- * Exported functions * ------------------------------------------------------

The usual power heuristic with beta = 2

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

return the area of a given primitive

return the device pointer

This method modify the Assimp data structures to make them easier to work with in Python. Supported operations: - MESH: replace a list

Returns the random seed used at the start of the current test run.

sample an outgoing direction \param geometry the local differential geometry \param z the incoming direction \param in the incoming direct

sample a given component \param geometry the local differential geometry \param z the input random numbers, relative to the given component \p

=========================================================================== * Scan a literal or distance tree to determine the frequencies of the cod

=========================================================================== * Send a literal or distance tree in compressed form, using the codes in

return the i-th component weight \param i component index

Returns �1

get the singular values of a matrix

STL-style container methods.

=========================================================================== * Slide the hash table when sliding the window down (could be avoided wit

A hybrid between the balance and maximum heuristic, where low probability values get soft-cutoff towards zero before applying the balance heuristic

Perform jittered spatial hashing

return the image plane distance needed to have screen with unit area

diskx, disky is point on radius 1 disk. x, y is point on [0,1]^2

\par Unpack an BSDF from a uint4