threers 0.1.0

Drop-in three.js replacement for Rust and WebAssembly (wgpu) — THREE.* API, scene graph, PBR, post-fx, mesh BVH, CSG, an OpenSCAD front end with a watertight exact-CSG kernel, headless render, and native media codecs
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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
use crate::core::{BufferAttribute, BufferGeometry};
use crate::curves::{earcut, Shape};

pub struct ExtrudeGeometry;

impl ExtrudeGeometry {
    /// Simplified extrusion: sample the outline of `shape` and its holes
    /// into 2D contours and sweep them along Z by `depth`: earcut caps with
    /// the holes left open, and a wall round the outline and every hole.
    pub fn new(shape: &Shape, depth: f32, samples_per_segment: usize) -> BufferGeometry {
        let divisions = samples_per_segment.max(2);
        let signed_area = |c: &[crate::math::Vector2]| {
            let n = c.len();
            (0..n)
                .map(|i| c[i].x * c[(i + 1) % n].y - c[(i + 1) % n].x * c[i].y)
                .sum::<f32>()
        };
        // A closed contour, wound counter-clockwise for the outline and
        // clockwise for a hole, so every wall's normal points out of the
        // material. A sampled loop repeats its first point at the end.
        let contour = |path: &crate::curves::Path, ccw: bool| {
            // Per segment: `curve_path.get_points` would spread `divisions`
            // over the whole outline and cut its corners.
            let mut c = path.get_points(divisions);
            if c.len() > 1 && c.first() == c.last() {
                c.pop();
            }
            if (signed_area(&c) > 0.0) != ccw {
                c.reverse();
            }
            c
        };
        let outline = contour(&shape.outline, true);
        if outline.len() < 3 {
            return BufferGeometry::new();
        }
        let mut contours = vec![outline];
        contours.extend(
            shape
                .holes
                .iter()
                .map(|h| contour(h, false))
                .filter(|h| h.len() >= 3),
        );
        let pts2: Vec<crate::math::Vector2> = contours.iter().flatten().copied().collect();
        let mut hole_starts = vec![];
        let mut at = 0;
        for c in &contours[..contours.len() - 1] {
            at += c.len();
            hole_starts.push(at);
        }
        let n = pts2.len();
        let mut positions = Vec::with_capacity(2 * n * 3 + 12 * n);
        let mut normals = Vec::with_capacity(2 * n * 3 + 12 * n);
        let mut uvs = Vec::with_capacity(2 * n * 2 + 8 * n);
        let mut indices = Vec::new();

        // Bottom cap (z = 0).
        for p in &pts2 {
            positions.extend_from_slice(&[p.x, p.y, 0.0]);
            normals.extend_from_slice(&[0.0, 0.0, -1.0]);
            uvs.extend_from_slice(&[p.x, p.y]);
        }
        // Top cap (z = depth).
        for p in &pts2 {
            positions.extend_from_slice(&[p.x, p.y, depth]);
            normals.extend_from_slice(&[0.0, 0.0, 1.0]);
            uvs.extend_from_slice(&[p.x, p.y]);
        }
        // Earcut caps, counter-clockwise, holes left open.
        let tris = earcut::earcut(&pts2, &hole_starts);
        // Read only by the `brep` tagging below; without that feature nothing
        // consumes it, and it is not worth cfg-ing the arithmetic itself.
        #[cfg_attr(not(feature = "brep"), allow(unused_variables))]
        let cap_triangles = tris.len() / 3;
        for tri in tris.as_chunks::<3>().0 {
            indices.extend_from_slice(&[tri[0], tri[2], tri[1]]);
            let off = n as u32;
            indices.extend_from_slice(&[off + tri[0], off + tri[1], off + tri[2]]);
        }

        // Caps first, bottom and top triangles interleaved, so no cap is a run
        // of consecutive triangles: they stay separate polygons.
        let mut polygons = super::polygons::CellPolygons::new();
        polygons.triangles(indices.len() / 3);
        // Sides — each contour edge becomes a quad (4 unique vertices for flat shading).
        for c in &contours {
            let m = c.len();
            for i in 0..m {
                let a = c[i];
                let b = c[(i + 1) % m];
                // Per-quad normal (outward in XY plane).
                let edge_x = b.x - a.x;
                let edge_y = b.y - a.y;
                let nlen = (edge_y * edge_y + edge_x * edge_x).sqrt().max(1e-8);
                let nx = edge_y / nlen;
                let ny = -edge_x / nlen;
                let base = (positions.len() / 3) as u32;
                positions.extend_from_slice(&[a.x, a.y, 0.0]);
                positions.extend_from_slice(&[b.x, b.y, 0.0]);
                positions.extend_from_slice(&[b.x, b.y, depth]);
                positions.extend_from_slice(&[a.x, a.y, depth]);
                for _ in 0..4 {
                    normals.extend_from_slice(&[nx, ny, 0.0]);
                }
                uvs.extend_from_slice(&[0.0, 0.0, 1.0, 0.0, 1.0, 1.0, 0.0, 1.0]);
                indices.extend_from_slice(&[base, base + 1, base + 2, base, base + 2, base + 3]);
                polygons.quad(&positions, [base, base + 1, base + 2, base + 3]);
            }
        }

        let mut g = BufferGeometry::new();
        g.set_attribute("position", BufferAttribute::new(positions, 3));
        g.set_attribute("normal", BufferAttribute::new(normals, 3));
        g.set_attribute("uv", BufferAttribute::new(uvs, 2));
        g.set_index(indices);
        polygons.apply(&mut g);
        // The B-rep tags describe a prism over one contour.
        #[cfg(feature = "brep")]
        if contours.len() == 1 {
            crate::brep::primitives::tag_extrude(&mut g, &pts2, depth, cap_triangles);
        }
        g
    }
}

/// Options of three.js r165's `ExtrudeGeometry` (and so of `TextGeometry`),
/// with three.js's defaults.
#[derive(Debug, Clone, PartialEq)]
pub struct ExtrudeOptions {
    /// Points per curve when the shapes are sampled. Default 12.
    pub curve_segments: usize,
    /// Layers along the extrusion (and samples of `extrude_path`). Default 1.
    pub steps: usize,
    /// Extrusion depth along +Z. Default 1. Ignored with `extrude_path`.
    pub depth: f64,
    /// Default true. Forced off with `extrude_path`, as in three.js.
    pub bevel_enabled: bool,
    /// How deep into the shape the bevel goes. Default 0.2.
    pub bevel_thickness: f64,
    /// How far from the outline the bevel reaches. Default
    /// `bevel_thickness - 0.1` (`None` means that default).
    pub bevel_size: Option<f64>,
    /// Where the bevel starts relative to the outline. Default 0.
    pub bevel_offset: f64,
    /// Bevel layers. Default 3.
    pub bevel_segments: usize,
    /// three.js's `extrudePath`, already sampled — see [`ExtrudePath`].
    pub extrude_path: Option<ExtrudePath>,
}

impl Default for ExtrudeOptions {
    fn default() -> Self {
        Self {
            curve_segments: 12,
            steps: 1,
            depth: 1.0,
            bevel_enabled: true,
            bevel_thickness: 0.2,
            bevel_size: None,
            bevel_offset: 0.0,
            bevel_segments: 3,
            extrude_path: None,
        }
    }
}

/// A curve to extrude along, given as three.js reads it: `steps + 1` points
/// from `extrudePath.getSpacedPoints(steps)` and as many tangents from
/// `extrudePath.getTangentAt(i / steps)`. Sampling is the caller's, so any
/// curve works — including one defined in JavaScript.
#[derive(Debug, Clone, PartialEq, Default)]
pub struct ExtrudePath {
    pub points: Vec<[f64; 3]>,
    pub tangents: Vec<[f64; 3]>,
}

impl ExtrudePath {
    /// Sample `extrudePath` as three.js does: `getSpacedPoints(steps)` and
    /// the tangents of `computeFrenetFrames(steps, false)` (`getTangentAt`).
    pub fn from_curve(curve: &crate::curves::ThreeCurve, steps: usize) -> ExtrudePath {
        let points = curve
            .get_spaced_points(steps)
            .into_iter()
            .map(|p| p.unwrap_or([f64::NAN; 3]))
            .collect();
        let tangents = curve.compute_frenet_frames(steps, false).tangents;
        ExtrudePath { points, tangents }
    }
}

/// Which UV generator call made a run of vertices: a cap triangle (three
/// vertices, `generateTopUV`) or a side quad (six, `generateSideWallUV`).
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum ExtrudeFace {
    Top,
    Side,
}

/// What three.js's `ExtrudeGeometry` builds before it becomes buffers: the
/// non-indexed vertices and UVs in JavaScript precision, the material groups
/// (0 caps, 1 sides, per shape), and the face sequence — what a custom
/// `UVGenerator` is called on, in order.
#[derive(Debug, Clone, Default, PartialEq)]
pub struct ExtrudeBuffers {
    pub positions: Vec<f64>,
    pub uvs: Vec<f64>,
    pub groups: Vec<(u32, u32, u32)>,
    pub faces: Vec<ExtrudeFace>,
}

impl ExtrudeBuffers {
    /// The geometry three.js ends with: `position` and `uv` as `f32`, groups,
    /// and `computeVertexNormals()`'s face normals.
    pub fn into_geometry(self) -> BufferGeometry {
        let positions: Vec<f32> = self.positions.iter().map(|&v| v as f32).collect();
        let normals = non_indexed_vertex_normals(&positions);
        let mut g = BufferGeometry::new();
        g.set_attribute("position", BufferAttribute::new(positions, 3));
        g.set_attribute(
            "uv",
            BufferAttribute::new(self.uvs.iter().map(|&v| v as f32).collect(), 2),
        );
        g.set_attribute("normal", BufferAttribute::new(normals, 3));
        for (s, c, m) in self.groups {
            g.add_group(s, c, m);
        }
        g
    }
}

/// three.js `BufferGeometry.computeVertexNormals()` on non-indexed `f32`
/// positions: each triangle's `(c - b) × (a - b)` on its three vertices, then
/// `normalizeNormals()`, with the intermediate stored as `f32` as three.js
/// stores it.
pub(crate) fn non_indexed_vertex_normals(positions: &[f32]) -> Vec<f32> {
    let mut normals = vec![0.0f32; positions.len()];
    for (tri, out) in positions
        .as_chunks::<9>()
        .0
        .iter()
        .zip(normals.as_chunks_mut::<9>().0)
    {
        let p = |k: usize| {
            [
                tri[k * 3] as f64,
                tri[k * 3 + 1] as f64,
                tri[k * 3 + 2] as f64,
            ]
        };
        let (a, b, c) = (p(0), p(1), p(2));
        let cb = [c[0] - b[0], c[1] - b[1], c[2] - b[2]];
        let ab = [a[0] - b[0], a[1] - b[1], a[2] - b[2]];
        let n = [
            cb[1] * ab[2] - cb[2] * ab[1],
            cb[2] * ab[0] - cb[0] * ab[2],
            cb[0] * ab[1] - cb[1] * ab[0],
        ];
        for v in 0..3 {
            out[v * 3] = n[0] as f32;
            out[v * 3 + 1] = n[1] as f32;
            out[v * 3 + 2] = n[2] as f32;
        }
    }
    for n in normals.as_chunks_mut::<3>().0 {
        let (x, y, z) = (n[0] as f64, n[1] as f64, n[2] as f64);
        let l = (x * x + y * y + z * z).sqrt();
        let inv = 1.0 / if l == 0.0 { 1.0 } else { l };
        n[0] = (x * inv) as f32;
        n[1] = (y * inv) as f32;
        n[2] = (z * inv) as f32;
    }
    normals
}

type V2 = crate::curves::shapes::Vec2d;

/// `getBevelVec(inPt, inPrev, inNext)`.
fn bevel_vec(pt: V2, prev: V2, next: V2) -> V2 {
    let (v_trans_x, v_trans_y, shrink_by);
    let v_prev_x = pt.x - prev.x;
    let v_prev_y = pt.y - prev.y;
    let v_next_x = next.x - pt.x;
    let v_next_y = next.y - pt.y;
    let v_prev_lensq = v_prev_x * v_prev_x + v_prev_y * v_prev_y;
    let collinear0 = v_prev_x * v_next_y - v_prev_y * v_next_x;
    if collinear0.abs() > f64::EPSILON {
        let v_prev_len = v_prev_lensq.sqrt();
        let v_next_len = (v_next_x * v_next_x + v_next_y * v_next_y).sqrt();
        let pt_prev_shift_x = prev.x - v_prev_y / v_prev_len;
        let pt_prev_shift_y = prev.y + v_prev_x / v_prev_len;
        let pt_next_shift_x = next.x - v_next_y / v_next_len;
        let pt_next_shift_y = next.y + v_next_x / v_next_len;
        let sf = ((pt_next_shift_x - pt_prev_shift_x) * v_next_y
            - (pt_next_shift_y - pt_prev_shift_y) * v_next_x)
            / (v_prev_x * v_next_y - v_prev_y * v_next_x);
        v_trans_x = pt_prev_shift_x + v_prev_x * sf - pt.x;
        v_trans_y = pt_prev_shift_y + v_prev_y * sf - pt.y;
        let v_trans_lensq = v_trans_x * v_trans_x + v_trans_y * v_trans_y;
        if v_trans_lensq <= 2.0 {
            return V2::new(v_trans_x, v_trans_y);
        }
        shrink_by = (v_trans_lensq / 2.0).sqrt();
    } else {
        // `Math.sign` equality: 0 and -0 agree, NaN never does.
        let js_sign = |v: f64| {
            if v > 0.0 {
                1.0
            } else if v < 0.0 {
                -1.0
            } else {
                v
            }
        };
        let direction_eq = if v_prev_x > f64::EPSILON {
            v_next_x > f64::EPSILON
        } else if v_prev_x < -f64::EPSILON {
            v_next_x < -f64::EPSILON
        } else {
            js_sign(v_prev_y) == js_sign(v_next_y)
        };
        if direction_eq {
            v_trans_x = -v_prev_y;
            v_trans_y = v_prev_x;
            shrink_by = v_prev_lensq.sqrt();
        } else {
            v_trans_x = v_prev_x;
            v_trans_y = v_prev_y;
            shrink_by = (v_prev_lensq / 2.0).sqrt();
        }
    }
    V2::new(v_trans_x / shrink_by, v_trans_y / shrink_by)
}

fn movements(contour: &[V2]) -> Vec<V2> {
    let il = contour.len();
    (0..il)
        .map(|i| {
            let j = if i == 0 { il - 1 } else { i - 1 };
            let k = if i + 1 == il { 0 } else { i + 1 };
            bevel_vec(contour[i], contour[j], contour[k])
        })
        .collect()
}

/// `scalePt2(pt, vec, size)`: `pt.clone().addScaledVector(vec, size)`.
fn scale_pt2(pt: V2, vec: V2, size: f64) -> V2 {
    V2::new(pt.x + vec.x * size, pt.y + vec.y * size)
}

impl ExtrudeGeometry {
    /// three.js r165 `new ExtrudeGeometry(shapes, options)`: bevels, steps,
    /// holes, an extrusion path, world UVs, groups 0 (caps) and 1 (sides) per
    /// shape, unindexed with face normals — buffer for buffer what three.js
    /// builds.
    pub fn from_shapes(
        shapes: &[crate::curves::shapes::Shape],
        options: &ExtrudeOptions,
    ) -> BufferGeometry {
        Self::build(shapes, options).into_geometry()
    }

    /// [`from_shapes`](Self::from_shapes) stopped before the buffers: for a
    /// caller with its own UV generator to rewrite `uvs` over `faces`.
    pub fn build(
        shapes: &[crate::curves::shapes::Shape],
        options: &ExtrudeOptions,
    ) -> ExtrudeBuffers {
        let mut out = ExtrudeBuffers::default();
        for shape in shapes {
            add_shape(shape, options, &mut out);
        }
        out
    }
}

fn add_shape(shape: &crate::curves::shapes::Shape, o: &ExtrudeOptions, out: &mut ExtrudeBuffers) {
    use crate::curves::shapes::shape_utils;
    let curve_segments = o.curve_segments;
    let steps = o.steps;
    let depth = o.depth;
    let mut bevel_enabled = o.bevel_enabled;
    let mut bevel_thickness = o.bevel_thickness;
    let mut bevel_size = o.bevel_size.unwrap_or(bevel_thickness - 0.1);
    let mut bevel_offset = o.bevel_offset;
    let mut bevel_segments = o.bevel_segments;

    let mut path_frames = None;
    if let Some(path) = &o.extrude_path {
        bevel_enabled = false;
        let frames = super::frenet::compute_frenet_frames(&path.tangents, false);
        path_frames = Some((path, frames));
    }
    if !bevel_enabled {
        bevel_segments = 0;
        bevel_thickness = 0.0;
        bevel_size = 0.0;
        bevel_offset = 0.0;
    }

    let points = shape.extract_points(curve_segments);
    let mut vertices = points.shape;
    let mut holes = points.holes;
    if !shape_utils::is_clock_wise(&vertices) {
        vertices.reverse();
        for h in holes.iter_mut() {
            if shape_utils::is_clock_wise(h) {
                h.reverse();
            }
        }
    }
    let faces = shape_utils::triangulate_shape(&mut vertices, &mut holes);
    let contour = vertices.clone();
    for h in &holes {
        vertices.extend_from_slice(h);
    }
    let vlen = vertices.len();
    let flen = faces.len();

    let contour_movements = movements(&contour);
    let holes_movements: Vec<Vec<V2>> = holes.iter().map(|h| movements(h)).collect();
    let mut vertices_movements = contour_movements.clone();
    for m in &holes_movements {
        vertices_movements.extend_from_slice(m);
    }

    let mut placeholder: Vec<f64> = Vec::new();
    let mut v = |x: f64, y: f64, z: f64| placeholder.extend_from_slice(&[x, y, z]);

    let half_pi_of = |b: usize| (b as f64 / bevel_segments as f64) * std::f64::consts::PI / 2.0;

    // Back bevel.
    for b in 0..bevel_segments {
        let a = half_pi_of(b);
        let z = bevel_thickness * a.cos();
        let bs = bevel_size * a.sin() + bevel_offset;
        for (i, &c) in contour.iter().enumerate() {
            let vert = scale_pt2(c, contour_movements[i], bs);
            v(vert.x, vert.y, -z);
        }
        for (h, hole) in holes.iter().enumerate() {
            for (i, &p) in hole.iter().enumerate() {
                let vert = scale_pt2(p, holes_movements[h][i], bs);
                v(vert.x, vert.y, -z);
            }
        }
    }

    let bs = bevel_size + bevel_offset;
    let path_vertex = |s: usize, vert: V2| -> [f64; 3] {
        let (path, frames) = path_frames.as_ref().unwrap();
        let n = frames.normals[s];
        let bn = frames.binormals[s];
        let p = path.points[s];
        let nx = [n[0] * vert.x, n[1] * vert.x, n[2] * vert.x];
        let by = [bn[0] * vert.y, bn[1] * vert.y, bn[2] * vert.y];
        [
            p[0] + nx[0] + by[0],
            p[1] + nx[1] + by[1],
            p[2] + nx[2] + by[2],
        ]
    };
    for i in 0..vlen {
        let vert = if bevel_enabled {
            scale_pt2(vertices[i], vertices_movements[i], bs)
        } else {
            vertices[i]
        };
        if path_frames.is_none() {
            v(vert.x, vert.y, 0.0);
        } else {
            let p = path_vertex(0, vert);
            v(p[0], p[1], p[2]);
        }
    }
    for s in 1..=steps {
        for i in 0..vlen {
            let vert = if bevel_enabled {
                scale_pt2(vertices[i], vertices_movements[i], bs)
            } else {
                vertices[i]
            };
            if path_frames.is_none() {
                v(vert.x, vert.y, depth / steps as f64 * s as f64);
            } else {
                let p = path_vertex(s, vert);
                v(p[0], p[1], p[2]);
            }
        }
    }

    // Front bevel. (three.js's extrude-path branch for holes here is
    // unreachable: a path turns bevels off.)
    for b in (0..bevel_segments).rev() {
        let a = half_pi_of(b);
        let z = bevel_thickness * a.cos();
        let bs = bevel_size * a.sin() + bevel_offset;
        for (i, &c) in contour.iter().enumerate() {
            let vert = scale_pt2(c, contour_movements[i], bs);
            v(vert.x, vert.y, depth + z);
        }
        for (h, hole) in holes.iter().enumerate() {
            for (i, &p) in hole.iter().enumerate() {
                let vert = scale_pt2(p, holes_movements[h][i], bs);
                v(vert.x, vert.y, depth + z);
            }
        }
    }

    let positions = &mut out.positions;
    let uvs = &mut out.uvs;
    let face_log = &mut out.faces;
    let add_vertex = |positions: &mut Vec<f64>, index: usize| {
        positions.extend_from_slice(&placeholder[index * 3..index * 3 + 3]);
    };
    let mut f3 = |positions: &mut Vec<f64>, uvs: &mut Vec<f64>, a: usize, b: usize, c: usize| {
        add_vertex(positions, a);
        add_vertex(positions, b);
        add_vertex(positions, c);
        let n = positions.len() / 3;
        for k in [n - 3, n - 2, n - 1] {
            uvs.extend_from_slice(&[positions[k * 3], positions[k * 3 + 1]]);
        }
        face_log.push(ExtrudeFace::Top);
    };

    // Lids.
    let start = (positions.len() / 3) as u32;
    if bevel_enabled {
        for f in &faces {
            f3(positions, uvs, f[2] as usize, f[1] as usize, f[0] as usize);
        }
        let offset = vlen * (steps + bevel_segments * 2);
        for f in &faces {
            f3(
                positions,
                uvs,
                f[0] as usize + offset,
                f[1] as usize + offset,
                f[2] as usize + offset,
            );
        }
    } else {
        for f in &faces {
            f3(positions, uvs, f[2] as usize, f[1] as usize, f[0] as usize);
        }
        let offset = vlen * steps;
        for f in &faces {
            f3(
                positions,
                uvs,
                f[0] as usize + offset,
                f[1] as usize + offset,
                f[2] as usize + offset,
            );
        }
    }
    let _ = flen;
    let end = (positions.len() / 3) as u32;
    out.groups.push((start, end - start, 0));

    // Sides.
    let start = end;
    let mut layer_offset = 0;
    let mut sidewalls =
        |positions: &mut Vec<f64>, uvs: &mut Vec<f64>, len: usize, layer_offset: usize| {
            let mut i = len as isize;
            loop {
                i -= 1;
                if i < 0 {
                    break;
                }
                let j = i as usize;
                let k = if i == 0 { len - 1 } else { j - 1 };
                for s in 0..(steps + bevel_segments * 2) {
                    let slen1 = vlen * s;
                    let slen2 = vlen * (s + 1);
                    let a = layer_offset + j + slen1;
                    let b = layer_offset + k + slen1;
                    let c = layer_offset + k + slen2;
                    let d = layer_offset + j + slen2;
                    for idx in [a, b, d, b, c, d] {
                        add_vertex(positions, idx);
                    }
                    let n = positions.len() / 3;
                    let uv = side_wall_uv(positions, n - 6, n - 3, n - 2, n - 1);
                    for q in [0, 1, 3, 1, 2, 3] {
                        uvs.extend_from_slice(&uv[q]);
                    }
                    face_log.push(ExtrudeFace::Side);
                }
            }
        };
    sidewalls(positions, uvs, contour.len(), layer_offset);
    layer_offset += contour.len();
    for h in &holes {
        sidewalls(positions, uvs, h.len(), layer_offset);
        layer_offset += h.len();
    }
    let end = (positions.len() / 3) as u32;
    out.groups.push((start, end - start, 1));
}

/// `WorldUVGenerator.generateSideWallUV`.
fn side_wall_uv(v: &[f64], a: usize, b: usize, c: usize, d: usize) -> [[f64; 2]; 4] {
    let p = |i: usize| (v[i * 3], v[i * 3 + 1], v[i * 3 + 2]);
    let (ax, ay, az) = p(a);
    let (bx, by, bz) = p(b);
    let (cx, cy, cz) = p(c);
    let (dx, dy, dz) = p(d);
    if (ay - by).abs() < (ax - bx).abs() {
        [
            [ax, 1.0 - az],
            [bx, 1.0 - bz],
            [cx, 1.0 - cz],
            [dx, 1.0 - dz],
        ]
    } else {
        [
            [ay, 1.0 - az],
            [by, 1.0 - bz],
            [cy, 1.0 - cz],
            [dy, 1.0 - dz],
        ]
    }
}

#[cfg(test)]
mod hole_tests {
    use super::ExtrudeGeometry;
    use crate::curves::{Path, Shape};
    use crate::math::Vector2;

    fn square(path: &mut Path, x: f32, y: f32, size: f32) {
        path.move_to(Vector2::new(x, y))
            .line_to(Vector2::new(x + size, y))
            .line_to(Vector2::new(x + size, y + size))
            .line_to(Vector2::new(x, y + size))
            .line_to(Vector2::new(x, y));
    }

    /// A 4 × 4 plate with a 2 × 2 window, 1 deep.
    fn plate(hole_clockwise: bool) -> Shape {
        let mut shape = Shape::new();
        square(&mut shape.outline, 0.0, 0.0, 4.0);
        let mut hole = Path::new();
        if hole_clockwise {
            hole.move_to(Vector2::new(1.0, 1.0))
                .line_to(Vector2::new(1.0, 3.0))
                .line_to(Vector2::new(3.0, 3.0))
                .line_to(Vector2::new(3.0, 1.0))
                .line_to(Vector2::new(1.0, 1.0));
        } else {
            square(&mut hole, 1.0, 1.0, 2.0);
        }
        shape.add_hole(hole);
        shape
    }

    fn triangles(g: &crate::core::BufferGeometry) -> Vec<[[f32; 3]; 3]> {
        let pos = &g.get_attribute("position").unwrap().array;
        let v = |i: u32| [pos[i as usize * 3], pos[i as usize * 3 + 1], pos[i as usize * 3 + 2]];
        let n = (pos.len() / 3) as u32;
        let idx = g.index.clone().unwrap_or_else(|| (0..n).collect());
        assert!(!idx.is_empty(), "something was built");
        idx.chunks(3).map(|t| [v(t[0]), v(t[1]), v(t[2])]).collect()
    }

    #[test]
    fn caps_leave_the_hole_open_and_it_is_walled() {
        for clockwise in [false, true] {
            let tris = triangles(&ExtrudeGeometry::new(&plate(clockwise), 1.0, 2));
            let mut top = 0.0;
            let mut volume = 0.0;
            for [a, b, c] in &tris {
                let cross = |u: [f32; 3], w: [f32; 3]| [u[1] * w[2] - u[2] * w[1], u[2] * w[0] - u[0] * w[2], u[0] * w[1] - u[1] * w[0]];
                let d = |p: [f32; 3], q: [f32; 3]| [q[0] - p[0], q[1] - p[1], q[2] - p[2]];
                let n = cross(d(*a, *b), d(*a, *c));
                if a[2] == 1.0 && b[2] == 1.0 && c[2] == 1.0 {
                    assert!(n[2] > 0.0, "the top faces up");
                    top += n[2] / 2.0;
                }
                let bc = cross(*b, *c);
                volume += (a[0] * bc[0] + a[1] * bc[1] + a[2] * bc[2]) / 6.0;
            }
            assert!((top - 12.0).abs() < 1e-4, "top cap area {top}");
            // Outward everywhere: the volume of the plate less its window.
            assert!((volume - 12.0).abs() < 1e-4, "volume {volume}");
        }
    }

    #[test]
    fn closed_round_the_hole() {
        // Every edge, by position, shared by one triangle each way.
        let tris = triangles(&ExtrudeGeometry::new(&plate(false), 1.0, 2));
        let key = |p: [f32; 3]| p.map(|v| (v * 1e4).round() as i64);
        let mut edges = std::collections::HashMap::new();
        for t in &tris {
            for e in 0..3 {
                *edges.entry((key(t[e]), key(t[(e + 1) % 3]))).or_insert(0) += 1;
            }
        }
        for (&(a, b), &n) in &edges {
            assert_eq!((n, edges.get(&(b, a)).copied()), (1, Some(1)), "edge {a:?} {b:?}");
        }
    }
}