83 lines
3.1 KiB
HLSL
83 lines
3.1 KiB
HLSL
|
#ifndef UNITY_SPACE_FILLING_CURVES_INCLUDED
|
||
|
|
#define UNITY_SPACE_FILLING_CURVES_INCLUDED
|
||
|
|
|
||
|
|
// "Insert" a 0 bit after each of the 16 low bits of x.
|
||
|
|
// Ref: https://fgiesen.wordpress.com/2009/12/13/decoding-morton-codes/
|
||
|
|
uint Part1By1(uint x)
|
||
|
|
{
|
||
|
|
x &= 0x0000ffff; // x = ---- ---- ---- ---- fedc ba98 7654 3210
|
||
|
|
x = (x ^ (x << 8)) & 0x00ff00ff; // x = ---- ---- fedc ba98 ---- ---- 7654 3210
|
||
|
|
x = (x ^ (x << 4)) & 0x0f0f0f0f; // x = ---- fedc ---- ba98 ---- 7654 ---- 3210
|
||
|
|
x = (x ^ (x << 2)) & 0x33333333; // x = --fe --dc --ba --98 --76 --54 --32 --10
|
||
|
|
x = (x ^ (x << 1)) & 0x55555555; // x = -f-e -d-c -b-a -9-8 -7-6 -5-4 -3-2 -1-0
|
||
|
|
return x;
|
||
|
|
}
|
||
|
|
|
||
|
|
// "Insert" two 0 bits after each of the 10 low bits of x.
|
||
|
|
// Ref: https://fgiesen.wordpress.com/2009/12/13/decoding-morton-codes/
|
||
|
|
uint Part1By2(uint x)
|
||
|
|
{
|
||
|
|
x &= 0x000003ff; // x = ---- ---- ---- ---- ---- --98 7654 3210
|
||
|
|
x = (x ^ (x << 16)) & 0xff0000ff; // x = ---- --98 ---- ---- ---- ---- 7654 3210
|
||
|
|
x = (x ^ (x << 8)) & 0x0300f00f; // x = ---- --98 ---- ---- 7654 ---- ---- 3210
|
||
|
|
x = (x ^ (x << 4)) & 0x030c30c3; // x = ---- --98 ---- 76-- --54 ---- 32-- --10
|
||
|
|
x = (x ^ (x << 2)) & 0x09249249; // x = ---- 9--8 --7- -6-- 5--4 --3- -2-- 1--0
|
||
|
|
return x;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Inverse of Part1By1 - "delete" all odd-indexed bits.
|
||
|
|
// Ref: https://fgiesen.wordpress.com/2009/12/13/decoding-morton-codes/
|
||
|
|
uint Compact1By1(uint x)
|
||
|
|
{
|
||
|
|
x &= 0x55555555; // x = -f-e -d-c -b-a -9-8 -7-6 -5-4 -3-2 -1-0
|
||
|
|
x = (x ^ (x >> 1)) & 0x33333333; // x = --fe --dc --ba --98 --76 --54 --32 --10
|
||
|
|
x = (x ^ (x >> 2)) & 0x0f0f0f0f; // x = ---- fedc ---- ba98 ---- 7654 ---- 3210
|
||
|
|
x = (x ^ (x >> 4)) & 0x00ff00ff; // x = ---- ---- fedc ba98 ---- ---- 7654 3210
|
||
|
|
x = (x ^ (x >> 8)) & 0x0000ffff; // x = ---- ---- ---- ---- fedc ba98 7654 3210
|
||
|
|
return x;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Inverse of Part1By2 - "delete" all bits not at positions divisible by 3.
|
||
|
|
// Ref: https://fgiesen.wordpress.com/2009/12/13/decoding-morton-codes/
|
||
|
|
uint Compact1By2(uint x)
|
||
|
|
{
|
||
|
|
x &= 0x09249249; // x = ---- 9--8 --7- -6-- 5--4 --3- -2-- 1--0
|
||
|
|
x = (x ^ (x >> 2)) & 0x030c30c3; // x = ---- --98 ---- 76-- --54 ---- 32-- --10
|
||
|
|
x = (x ^ (x >> 4)) & 0x0300f00f; // x = ---- --98 ---- ---- 7654 ---- ---- 3210
|
||
|
|
x = (x ^ (x >> 8)) & 0xff0000ff; // x = ---- --98 ---- ---- ---- ---- 7654 3210
|
||
|
|
x = (x ^ (x >> 16)) & 0x000003ff; // x = ---- ---- ---- ---- ---- --98 7654 3210
|
||
|
|
return x;
|
||
|
|
}
|
||
|
|
|
||
|
|
uint EncodeMorton2D(uint2 coord)
|
||
|
|
{
|
||
|
|
return (Part1By1(coord.y) << 1) + Part1By1(coord.x);
|
||
|
|
}
|
||
|
|
|
||
|
|
uint EncodeMorton3D(uint3 coord)
|
||
|
|
{
|
||
|
|
return (Part1By2(coord.z) << 2) + (Part1By2(coord.y) << 1) + Part1By2(coord.x);
|
||
|
|
}
|
||
|
|
|
||
|
|
uint2 DecodeMorton2D(uint code)
|
||
|
|
{
|
||
|
|
return uint2(Compact1By1(code >> 0), Compact1By1(code >> 1));
|
||
|
|
}
|
||
|
|
|
||
|
|
uint3 DecodeMorton3D(uint code)
|
||
|
|
{
|
||
|
|
return uint3(Compact1By2(code >> 0), Compact1By2(code >> 1), Compact1By2(code >> 2));
|
||
|
|
}
|
||
|
|
|
||
|
|
uint InterleaveQuad(uint2 quad)
|
||
|
|
{
|
||
|
|
return quad.x + 2 * quad.y;
|
||
|
|
}
|
||
|
|
|
||
|
|
uint2 DeinterleaveQuad(uint code)
|
||
|
|
{
|
||
|
|
return uint2(code & 1, (code >> 1) & 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif // UNITY_SPACE_FILLING_CURVES_INCLUDED
|