# [−][src]Module pbrt::core::lowdiscrepancy

Algorithms that deal with low-discrepancy point sets.

## Constants

C_MAX_MIN_DIST | |

PRIMES | |

PRIME_SUMS | |

PRIME_TABLE_SIZE |

## Functions

compute_radical_inverse_permutations | Computes random permutation tables. |

gray_code_sample_1d | Takes a generator matrix |

gray_code_sample_2d | Takes two generator matrices |

inverse_radical_inverse | Compute the inverse of the radical inverse function. |

multiply_generator | |

radical_inverse | Map to an appropriate prime number and delegate to another function to compute the radical inverse. |

reverse_bits_32 | The bits of an integer quantity can be efficiently reversed with a series of logical bit operations. |

reverse_bits_64 | The bits of a 64-bit value can be reversed by reversing the two 32-bit components individually and then interchanging them. |

sample_generator_matrix | |

scrambled_radical_inverse | Compute the radical inverse, but put each pixel through the permutation table for the given base. |

sobol_2d | Similar to |

sobol_interval_to_index | Returns the index of the _frame_th sample in the pixel p, if the sampling domain has be scaled to cover the pixel sampling area. |

sobol_sample | Takes different paths for 32- and 64-bit floating point values. |

sobol_sample_float | Takes a 64 bit index and 32x52 matrices to calculate sample values. |

van_der_corput | Generates a number of scrambled 1D sample values using the Gray code-based sampling machinery. |