improved perlin basic blockgen

This commit is contained in:
2024-08-23 16:55:59 +10:00
parent efd9905f5b
commit 9ef60faa86
6 changed files with 105 additions and 11 deletions

View File

@ -0,0 +1,56 @@
import Foundation
public struct ImprovedPerlin<T: BinaryFloatingPoint & SIMDScalar> {
private let p: [Int32]
public init(random: inout any RandomProvider) {
self.p = (0..<0x100).map { Int32($0) }.shuffled(using: &random)
}
public func get(_ point: SIMD3<T>) -> T {
// Find unit cube containg point
let idx = SIMD3(Int(floor(point.x)), Int(floor(point.y)), Int(floor(point.z))) & 0xFF
// Find relative point in cube
let inner = point - SIMD3(floor(point.x), floor(point.y), floor(point.z))
// Compute fade curves for each axis
let u = inner.x.smootherStep()
let v = inner.y.smootherStep()
let w = inner.z.smootherStep()
// Compute hash of the coordinates of the 8 cube corners
let a = idx.y + perm(idx.x)
let aa = idx.z + perm(a)
let ab = idx.z + perm(a + 1)
let b = idx.y + perm(idx.x + 1)
let ba = idx.z + perm(b)
let bb = idx.z + perm(b + 1)
// Add blended results
return w.mlerp(v.mlerp(
u.mlerp(
grad(perm(aa), inner),
grad(perm(ba), .init(inner.x - 1, inner.y, inner.z))),
u.mlerp(
grad(perm(ab), .init(inner.x, inner.y - 1, inner.z)),
grad(perm(bb), .init(inner.x - 1, inner.y - 1, inner.z)))),
v.mlerp(u.mlerp(
grad(perm(aa + 1), .init(inner.x, inner.y, inner.z - 1)),
grad(perm(ba + 1), .init(inner.x - 1, inner.y, inner.z - 1))),
u.mlerp(
grad(perm(ab + 1), .init(inner.x, inner.y - 1, inner.z - 1)),
grad(perm(bb + 1), inner - .init(repeating: 1)))))
@inline(__always) func perm(_ x: Int) -> Int { Int(self.p[x & 0xFF]) }
func grad(_ hash: Int, _ point: SIMD3<T>) -> T {
// Convert low 4 bits of hash code into 12 gradient directions
let low4 = hash & 0xF
var u = low4 < 8 ? point.x : point.y
var v = low4 < 4 ? point.y : (low4 == 0b1100 || low4 == 0b1110 ? point.x : point.z)
u = (low4 & 0x1) == 0 ? u : -u
v = (low4 & 0x2) == 0 ? v : -v
return u + v
}
}
}

View File

@ -0,0 +1,19 @@
public extension MutableCollection {
mutating func shuffle<T: RandomProvider>(using provider: inout T) {
guard self.count > 1 else {
return
}
for (first, remaining) in zip(self.indices, stride(from: 0x100, to: 1, by: -1)) {
let i = self.index(first, offsetBy: provider.next(in: remaining))
self.swapAt(first, i)
}
}
}
public extension Sequence {
func shuffled<T: RandomProvider>(using provider: inout T) -> [Self.Element] {
var copy = Array(self)
copy.shuffle(using: &provider)
return copy
}
}