roxlap-cavegen 0.1.0

Procedural cave generation for the roxlap voxel engine — Worley + Perlin classify into voxlap slab format.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
//! Worley cave-shape classification.
//!
//! Algorithm (Tom Dobrowolski's `CaveGen`, simplified):
//!
//! 1. Place `seed_count` random seeds uniformly in the voxel
//!    volume. The first `air_ratio × seed_count` are tagged "air";
//!    the rest are tagged "solid".
//! 2. For each voxel `p`:
//!    - `d_a` = distance to the nearest **air** seed
//!    - `d_s` = distance to the nearest **solid** seed
//!    - The voxel is air iff `d_a < d_s`, else solid.
//! 3. (CD.5.3) Add a Perlin overlay to `d_a` to break up the clean
//!    Worley facets. Currently disabled (overlay = 0).
//!
//! `anisotropy` scales the z component of the distance: `> 1.0`
//! produces caves that are wider than tall (mineshaft-style); `< 1.0`
//! gives tall narrow caves; `1.0` is isotropic.
//!
//! Determinism: same `seed` + same params + same code → byte-stable
//! grid (within toolchain — cross-CPU FP might diverge slightly,
//! same caveat as the rendering tests).

use crate::perlin::PerlinNoise3D;
use crate::rng::SplitMix64;
use crate::{CaveParams, MAXZDIM};

/// Wavelength of the Perlin overlay's lowest octave, in voxels.
/// Tuned so a `seed_count = 128` cave at `vsid = 256` shows
/// recognisable surface roughness without dissolving the Worley
/// cell structure.
const PERLIN_LOWEST_FREQUENCY: f32 = 1.0 / 16.0;

/// Perlin overlay's effect in voxel-distance units when
/// `perlin_amplitude = 1.0` and the noise sample is at its peak.
/// The full overlay is `perlin_amplitude * fbm * VOXEL_SCALE` —
/// `VOXEL_SCALE = 8` means an `amplitude = 0.15` overlay shifts
/// the air/solid boundary by up to ±1.2 voxels.
const PERLIN_VOXEL_SCALE: f32 = 8.0;

/// One Worley seed point.
#[derive(Debug, Clone, Copy)]
pub struct Seed {
    /// World coordinates `(x, y, z)`.
    pub pos: [f32; 3],
    /// `true` for air-tagged seeds, `false` for solid-tagged.
    pub is_air: bool,
}

/// Place `params.seed_count` deterministic random seeds across the
/// `vsid × vsid × MAXZDIM` volume. The first `params.air_ratio ×
/// params.seed_count` (rounded) are tagged air; the rest solid.
#[must_use]
#[allow(
    clippy::cast_possible_truncation,
    clippy::cast_precision_loss,
    clippy::cast_sign_loss
)]
pub fn place_seeds(params: &CaveParams, vsid: u32) -> Vec<Seed> {
    let mut rng = SplitMix64::new(params.seed);
    let total = params.seed_count;
    // air_ratio is clamped to [0.0, 1.0] by the caller; we trust it here.
    let n_air = ((total as f32) * params.air_ratio).round() as usize;
    let n_air = n_air.min(total);
    let xy_max = vsid as f32;
    let z_max = MAXZDIM as f32;
    let mut seeds = Vec::with_capacity(total);
    for i in 0..total {
        let pos_x = rng.next_f32_unit() * xy_max;
        let pos_y = rng.next_f32_unit() * xy_max;
        let pos_z = rng.next_f32_unit() * z_max;
        seeds.push(Seed {
            pos: [pos_x, pos_y, pos_z],
            is_air: i < n_air,
        });
    }
    seeds
}

/// Classify a single voxel as solid (`true`) or air (`false`)
/// against the seed set. The voxel position `(x, y, z)` is in
/// integer voxel coordinates.
///
/// CD.5.3 will fold a Perlin overlay into `d_a` here.
#[must_use]
#[allow(clippy::cast_precision_loss)]
pub fn classify_voxel(seeds: &[Seed], x: u32, y: u32, z: i32, anisotropy: f32) -> bool {
    let p = [x as f32, y as f32, z as f32];
    let mut d_air_sq = f32::INFINITY;
    let mut d_solid_sq = f32::INFINITY;
    for seed in seeds {
        let d_sq = anisotropic_dist_sq(p, seed.pos, anisotropy);
        if seed.is_air {
            if d_sq < d_air_sq {
                d_air_sq = d_sq;
            }
        } else if d_sq < d_solid_sq {
            d_solid_sq = d_sq;
        }
    }
    // d_a < d_s means closer to air seed → voxel is air.
    // Comparing squared distances is fine since both are ≥ 0.
    d_air_sq >= d_solid_sq
}

/// Like [`classify_voxel`] but adds a Perlin-noise overlay to the
/// distance-to-air-seed term. Voxel is air iff
/// `d_air + overlay < d_solid`, where
/// `overlay = perlin_amplitude × fbm(x, y, z, octaves) × PERLIN_VOXEL_SCALE`.
///
/// `perlin_octaves = 0` or `perlin_amplitude = 0.0` is equivalent to
/// [`classify_voxel`] (overlay short-circuits to 0).
///
/// Costs 2 extra `sqrt`s per voxel + 1 `fbm` call vs the plain
/// Worley path. At `vsid = 256, seed_count = 128`, the overlay's
/// per-voxel work is dwarfed by the seed-distance loop (128 squared
/// dists), so this is essentially free.
#[must_use]
#[allow(clippy::cast_precision_loss, clippy::too_many_arguments)]
pub fn classify_voxel_with_perlin(
    seeds: &[Seed],
    perlin: &PerlinNoise3D,
    x: u32,
    y: u32,
    z: i32,
    anisotropy: f32,
    perlin_octaves: u32,
    perlin_amplitude: f32,
) -> bool {
    let p = [x as f32, y as f32, z as f32];
    let mut d_air_sq = f32::INFINITY;
    let mut d_solid_sq = f32::INFINITY;
    for seed in seeds {
        let d_sq = anisotropic_dist_sq(p, seed.pos, anisotropy);
        if seed.is_air {
            if d_sq < d_air_sq {
                d_air_sq = d_sq;
            }
        } else if d_sq < d_solid_sq {
            d_solid_sq = d_sq;
        }
    }
    if perlin_octaves == 0 || perlin_amplitude == 0.0 {
        return d_air_sq >= d_solid_sq;
    }
    let d_air = d_air_sq.sqrt();
    let d_solid = d_solid_sq.sqrt();
    let overlay = perlin.fbm(p[0], p[1], p[2], perlin_octaves, PERLIN_LOWEST_FREQUENCY)
        * perlin_amplitude
        * PERLIN_VOXEL_SCALE;
    (d_air + overlay) >= d_solid
}

/// Build the dense `(VSID × VSID × MAXZDIM)` solidness grid by
/// classifying every voxel against the seed set. Output: 1 byte
/// per voxel; non-zero = solid.
///
/// O(`vsid² × MAXZDIM × seed_count`). At `vsid = 256`,
/// `seed_count = 128` this is ~2 G ops — minutes on a single core.
/// CD.5.3+ will add spatial bucketing if perf bites.
#[must_use]
#[allow(clippy::cast_sign_loss)]
pub fn worley_classify_grid(params: &CaveParams, vsid: u32) -> Vec<u8> {
    let seeds = place_seeds(params, vsid);
    // Different sub-seed for Perlin so its permutation table is
    // decorrelated from the seed-placement RNG stream.
    let perlin_active = params.perlin_octaves > 0 && params.perlin_amplitude > 0.0;
    let perlin = if perlin_active {
        Some(PerlinNoise3D::new(
            params.seed.wrapping_mul(0x9E37_79B9_7F4A_7C15),
        ))
    } else {
        None
    };
    let vsid_u = vsid as usize;
    let maxzdim_u = MAXZDIM as usize;
    let n_voxels = vsid_u * vsid_u * maxzdim_u;
    let mut grid = vec![0u8; n_voxels];
    for y in 0..vsid {
        for x in 0..vsid {
            for z in 0..MAXZDIM {
                let idx = (y as usize * vsid_u + x as usize) * maxzdim_u + z as usize;
                let solid = if let Some(ref p) = perlin {
                    classify_voxel_with_perlin(
                        &seeds,
                        p,
                        x,
                        y,
                        z,
                        params.anisotropy,
                        params.perlin_octaves,
                        params.perlin_amplitude,
                    )
                } else {
                    classify_voxel(&seeds, x, y, z, params.anisotropy)
                };
                if solid {
                    grid[idx] = 1;
                }
            }
        }
    }
    grid
}

#[inline]
pub(crate) fn anisotropic_dist_sq(a: [f32; 3], b: [f32; 3], anisotropy: f32) -> f32 {
    let dx = a[0] - b[0];
    let dy = a[1] - b[1];
    let dz = (a[2] - b[2]) * anisotropy;
    dx * dx + dy * dy + dz * dz
}

#[cfg(test)]
#[allow(
    clippy::cast_possible_truncation,
    clippy::cast_precision_loss,
    clippy::cast_sign_loss
)]
mod tests {
    use super::*;

    fn test_params(seed: u64, seed_count: usize, air_ratio: f32) -> CaveParams {
        CaveParams {
            seed,
            seed_count,
            air_ratio,
            anisotropy: 1.0,
            perlin_octaves: 0,
            perlin_amplitude: 0.0,
        }
    }

    #[test]
    fn place_seeds_deterministic_in_seed() {
        let p = test_params(42, 16, 0.5);
        let a = place_seeds(&p, 64);
        let b = place_seeds(&p, 64);
        assert_eq!(a.len(), b.len());
        for (sa, sb) in a.iter().zip(b.iter()) {
            assert_eq!(sa.pos[0].to_bits(), sb.pos[0].to_bits(), "x");
            assert_eq!(sa.pos[1].to_bits(), sb.pos[1].to_bits(), "y");
            assert_eq!(sa.pos[2].to_bits(), sb.pos[2].to_bits(), "z");
            assert_eq!(sa.is_air, sb.is_air);
        }
    }

    #[test]
    fn place_seeds_different_seed_yields_different_seeds() {
        let a = place_seeds(&test_params(1, 16, 0.5), 64);
        let b = place_seeds(&test_params(2, 16, 0.5), 64);
        // Should differ on every position; allow at most a quarter
        // of accidental coincidences.
        let same = a
            .iter()
            .zip(b.iter())
            .filter(|(x, y)| x.pos[0].to_bits() == y.pos[0].to_bits())
            .count();
        assert!(same * 4 < a.len(), "too many coincident x positions");
    }

    #[test]
    fn place_seeds_air_ratio_split() {
        let p = test_params(7, 100, 0.4);
        let seeds = place_seeds(&p, 64);
        let n_air = seeds.iter().filter(|s| s.is_air).count();
        assert_eq!(n_air, 40, "40% of 100 seeds tagged air");
    }

    #[test]
    fn place_seeds_within_volume_bounds() {
        let p = test_params(7, 256, 0.5);
        let seeds = place_seeds(&p, 64);
        for s in &seeds {
            assert!((0.0..64.0).contains(&s.pos[0]), "x in bounds");
            assert!((0.0..64.0).contains(&s.pos[1]), "y in bounds");
            assert!((0.0..MAXZDIM as f32).contains(&s.pos[2]), "z in bounds");
        }
    }

    #[test]
    fn classify_at_air_seed_returns_air() {
        // One air seed at (10, 20, 30); one solid seed far away. Voxel
        // at (10, 20, 30) should be air.
        let seeds = vec![
            Seed {
                pos: [10.0, 20.0, 30.0],
                is_air: true,
            },
            Seed {
                pos: [100.0, 100.0, 100.0],
                is_air: false,
            },
        ];
        assert!(!classify_voxel(&seeds, 10, 20, 30, 1.0), "should be air");
    }

    #[test]
    fn classify_at_solid_seed_returns_solid() {
        let seeds = vec![
            Seed {
                pos: [100.0, 100.0, 100.0],
                is_air: true,
            },
            Seed {
                pos: [10.0, 20.0, 30.0],
                is_air: false,
            },
        ];
        assert!(classify_voxel(&seeds, 10, 20, 30, 1.0), "should be solid");
    }

    #[test]
    fn classify_anisotropy_squishes_caves_vertically() {
        // One air seed at (10, 20, 30); one solid seed at (10, 20, 50).
        // Voxel at (10, 20, 40) — equidistant in isotropic, so the
        // tiebreak goes to solid (d_air >= d_solid → solid).
        // With aniso=2, z distance is amplified, but still
        // equidistant — same outcome.
        let seeds = vec![
            Seed {
                pos: [10.0, 20.0, 30.0],
                is_air: true,
            },
            Seed {
                pos: [10.0, 20.0, 50.0],
                is_air: false,
            },
        ];
        // Move voxel slightly toward air seed.
        assert!(
            !classify_voxel(&seeds, 10, 20, 39, 1.0),
            "isotropic — closer to air seed"
        );
        // Same with aniso=2 — z distance amplified equally for both.
        assert!(
            !classify_voxel(&seeds, 10, 20, 39, 2.0),
            "aniso=2 — closer to air seed"
        );
    }

    #[test]
    #[allow(clippy::naive_bytecount)]
    fn worley_classify_grid_air_ratio_roughly_matches() {
        // Small world, count solid vs air. With air_ratio=0.5 we
        // expect ~50% air.
        let p = test_params(7, 32, 0.5);
        let vsid = 16u32;
        let grid = worley_classify_grid(&p, vsid);
        let n_air = grid.iter().filter(|&&b| b == 0).count();
        let total = grid.len();
        let ratio = n_air as f32 / total as f32;
        assert!(
            (0.30..=0.70).contains(&ratio),
            "expected ~50% air, got {:.2}",
            ratio * 100.0
        );
    }

    #[test]
    fn worley_classify_grid_deterministic_in_seed() {
        let p = test_params(1234, 32, 0.5);
        let g1 = worley_classify_grid(&p, 16);
        let g2 = worley_classify_grid(&p, 16);
        assert_eq!(g1, g2, "same seed → byte-stable grid");
    }

    #[test]
    fn perlin_overlay_perturbs_classification() {
        // Same Worley seeds; with vs without Perlin overlay should
        // disagree on at least *some* voxels (boundary shifts).
        let no_perlin = test_params(99, 32, 0.5);
        let with_perlin = CaveParams {
            perlin_octaves: 3,
            perlin_amplitude: 0.4, // amplified to guarantee divergence
            ..no_perlin
        };
        let g1 = worley_classify_grid(&no_perlin, 16);
        let g2 = worley_classify_grid(&with_perlin, 16);
        let diffs = g1.iter().zip(g2.iter()).filter(|(a, b)| a != b).count();
        assert!(
            diffs > 0,
            "Perlin overlay should perturb the air/solid boundary"
        );
        // But not so many — Perlin should shift the boundary, not
        // randomise it. Expect <30% of voxels to flip.
        let total = g1.len();
        assert!(
            diffs * 100 / total < 30,
            "Perlin shifts boundary, doesn't randomise: {diffs} of {total} flipped"
        );
    }

    #[test]
    fn perlin_overlay_byte_stable() {
        // Same seed + perlin params → byte-stable grid.
        let p = CaveParams {
            seed: 7,
            seed_count: 32,
            air_ratio: 0.5,
            anisotropy: 1.0,
            perlin_octaves: 3,
            perlin_amplitude: 0.15,
        };
        let g1 = worley_classify_grid(&p, 16);
        let g2 = worley_classify_grid(&p, 16);
        assert_eq!(g1, g2);
    }

    #[test]
    fn perlin_disabled_when_amplitude_zero() {
        // amplitude = 0 should match the no-Perlin path exactly.
        let no_perlin = test_params(11, 32, 0.5);
        let zero_amplitude = CaveParams {
            perlin_octaves: 3,
            perlin_amplitude: 0.0,
            ..no_perlin
        };
        let g1 = worley_classify_grid(&no_perlin, 16);
        let g2 = worley_classify_grid(&zero_amplitude, 16);
        assert_eq!(g1, g2, "amplitude=0 should disable overlay");
    }
}