|
|
|
|
|
|
float3 localL; |
|
|
|
float NdotL, NdotH, LdotH; |
|
|
|
|
|
|
|
const int validSampleCount = sampleCount; |
|
|
|
const uint validSampleCount = sampleCount; |
|
|
|
int acceptedSampleCount = 0; |
|
|
|
int shiftedSampleIndex = 0; |
|
|
|
uint acceptedSampleCount = 0; |
|
|
|
uint shiftedSampleIndex = 0; |
|
|
|
for (int i = 0; i < sampleCount; i++) |
|
|
|
for (uint i = 0; i < sampleCount; i++) |
|
|
|
{ |
|
|
|
// We switch to the Golden sequence instead of the Fibonacci sequence |
|
|
|
// since the sample count is not guaranteed to be a Fibonacci number. |
|
|
|