surfer2 0.1.0

Headless straight-skeleton engine: a source-derived Rust port of cgalab/surfer2
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
//! Refinement orchestration after kinetic events.
//!
//! Upstream: `KineticTriangulation::refine_triangulation` / `do_flip`
//! (rev c42f9a7). Copyright 2018, 2019 Peter Palfrader — GPL-3.0-or-later.

use crate::error::SkeletonError;
use crate::event::{CollapseType, EventQueue};
use crate::triangulation::kinetic::{KineticTriangulation, TriangleId};

/// Incomplete weighted leftover / flip / CH refine still loops or drops
/// oracle counts. Isolate that policy here instead of a per-event edge scan.
pub fn drain_refinement_after(spec: CollapseType, has_nonunit_weight: bool) -> bool {
    !has_nonunit_weight
        && matches!(
            spec,
            CollapseType::TriangleCollapse
                | CollapseType::ConstraintCollapse
                | CollapseType::SpokeCollapse
                | CollapseType::SplitOrFlipRefine
        )
}

pub fn apply_event_refinement(
    kt: &mut KineticTriangulation,
    queue: Option<&mut EventQueue>,
    spec: CollapseType,
    time: f64,
) -> Result<(), SkeletonError> {
    if drain_refinement_after(spec, kt.has_nonunit_weight) {
        process_check_refinement_queue(kt, queue, time)
    } else {
        while kt.check_refinement_pop().is_some() {}
        Ok(())
    }
}

pub fn mark_modified(
    kt: &mut KineticTriangulation,
    mut queue: Option<&mut EventQueue>,
    tid: TriangleId,
    front: bool,
) -> Result<(), SkeletonError> {
    use crate::triangulation::kinetic::ccw;

    kt.put_on_check_refinement(tid, front);
    let Some(t) = kt.triangles.get(tid) else {
        return Ok(());
    };
    let tidx = t.tidx;
    let live = t.live();
    let unbounded_neighbor = if t.is_unbounded {
        (0..3)
            .find(|&i| t.vertices[i] == kt.infinite_vertex)
            .and_then(|i| t.neighbors[ccw(i)])
    } else {
        None
    };
    if live {
        if let Some(q) = queue.as_deref_mut() {
            q.needs_update(tidx)?;
        }
    }
    // C++ `modified`: also invalidate unbounded neighbor(ccw(inf)).
    if let Some(nid) = unbounded_neighbor {
        if let Some(n) = kt.triangles.get_mut(nid) {
            if n.live() {
                n.invalidate_collapse();
                let ntidx = n.tidx;
                if let Some(q) = queue {
                    q.needs_update(ntidx)?;
                }
            }
        }
    }
    Ok(())
}

/// C++ `do_flip`: raw flip, then `modified(t, true)` and `modified(n)`.
pub fn do_flip(
    kt: &mut KineticTriangulation,
    mut queue: Option<&mut EventQueue>,
    tid: TriangleId,
    side: usize,
) -> Result<(), SkeletonError> {
    let ntid = kt.triangles[tid].neighbors[side].ok_or_else(|| {
        crate::error::PropagationError::TopologyInvariant {
            detail: "do_flip missing neighbor".into(),
        }
    })?;
    raw_flip(kt, tid, side, ntid)?;
    mark_modified(kt, queue.as_deref_mut(), tid, true)?;
    mark_modified(kt, queue, ntid, false)?;
    Ok(())
}

/// C++ `refine_triangulation`: at most one flip for a 1-reflex unconstrained corner.
pub fn refine_triangulation(
    kt: &mut KineticTriangulation,
    mut queue: Option<&mut EventQueue>,
    tid: TriangleId,
    _time: f64,
) -> Result<(), SkeletonError> {
    use crate::triangulation::kinetic::{ccw, cw};

    let Some(t) = kt.triangles.get(tid) else {
        return Ok(());
    };
    if !t.live() || t.is_unbounded {
        return Ok(());
    }
    let verts = match t.vertices {
        [Some(a), Some(b), Some(c)] => [a, b, c],
        _ => return Ok(()),
    };
    let reflex = [
        kt.vertices
            .get(verts[0])
            .is_some_and(|v| !v.is_convex_or_straight()),
        kt.vertices
            .get(verts[1])
            .is_some_and(|v| !v.is_convex_or_straight()),
        kt.vertices
            .get(verts[2])
            .is_some_and(|v| !v.is_convex_or_straight()),
    ];
    let n_reflex = reflex.iter().filter(|x| **x).count();
    if n_reflex != 1 {
        return Ok(());
    }
    let ri = reflex.iter().position(|&x| x).unwrap();
    if t.wavefronts[ri].is_some() {
        return Ok(());
    }
    let Some(nid) = t.neighbors[ri] else {
        return Ok(());
    };
    let Some(n) = kt.triangles.get(nid) else {
        return Ok(());
    };
    if n.is_unbounded || !n.live() {
        return Ok(());
    }
    let Some(idx_in_n) = kt.neighbor_side(nid, tid) else {
        return Ok(());
    };
    let Some(o) = n.vertices[idx_in_n] else {
        return Ok(());
    };
    let v = verts[ri];
    let va = verts[ccw(ri)];
    let vb = verts[cw(ri)];

    // C++: if a quadrilateral corner is reflex-or-straight, do not flip.
    // C++ asserts all four vertices have both wavefronts; missing → do not flip.
    if !all_quad_wavefronts_present(kt, v, va, vb, o) {
        return Ok(());
    }
    if adjacent_wavefront_is_reflex_or_straight(kt, v, va, vb, o) {
        return Ok(());
    }

    raw_flip(kt, tid, ri, nid)?;
    let ok = kt
        .triangles
        .get(tid)
        .map(|t| t.check_side_xor().is_ok())
        .unwrap_or(false)
        && kt
            .triangles
            .get(nid)
            .map(|t| t.check_side_xor().is_ok())
            .unwrap_or(false);
    if !ok {
        let _ = raw_flip(kt, tid, ri, nid);
        return Ok(());
    }
    mark_modified(kt, queue.as_deref_mut(), tid, true)?;
    mark_modified(kt, queue, nid, false)?;
    Ok(())
}

fn all_quad_wavefronts_present(
    kt: &KineticTriangulation,
    v: crate::wavefront::vertex::VertexId,
    va: crate::wavefront::vertex::VertexId,
    vb: crate::wavefront::vertex::VertexId,
    o: crate::wavefront::vertex::VertexId,
) -> bool {
    [v, va, vb, o].iter().all(|id| {
        kt.vertices.get(*id).is_some_and(|vert| {
            vert.incident_edges[0].is_some() && vert.incident_edges[1].is_some()
        })
    })
}

fn adjacent_wavefront_is_reflex_or_straight(
    kt: &KineticTriangulation,
    v: crate::wavefront::vertex::VertexId,
    va: crate::wavefront::vertex::VertexId,
    vb: crate::wavefront::vertex::VertexId,
    o: crate::wavefront::vertex::VertexId,
) -> bool {
    let Some(vv) = kt.vertices.get(v) else {
        return false;
    };
    let Some(oo) = kt.vertices.get(o) else {
        return false;
    };
    if let Some(e) = vv.incident_edges[1] {
        if kt.edges.get(e).is_some_and(|ed| ed.endpoints[1] == va)
            && kt
                .vertices
                .get(va)
                .is_some_and(|x| x.is_reflex_or_straight())
        {
            return true;
        }
    }
    if let Some(e) = vv.incident_edges[0] {
        if kt.edges.get(e).is_some_and(|ed| ed.endpoints[0] == vb)
            && kt
                .vertices
                .get(vb)
                .is_some_and(|x| x.is_reflex_or_straight())
        {
            return true;
        }
    }
    if let Some(e) = oo.incident_edges[0] {
        if kt.edges.get(e).is_some_and(|ed| ed.endpoints[0] == va)
            && kt
                .vertices
                .get(va)
                .is_some_and(|x| x.is_reflex_or_straight())
        {
            return true;
        }
    }
    if let Some(e) = oo.incident_edges[1] {
        if kt.edges.get(e).is_some_and(|ed| ed.endpoints[1] == vb)
            && kt
                .vertices
                .get(vb)
                .is_some_and(|x| x.is_reflex_or_straight())
        {
            return true;
        }
    }
    false
}

pub fn process_check_refinement_queue(
    kt: &mut KineticTriangulation,
    mut queue: Option<&mut EventQueue>,
    time: f64,
) -> Result<(), SkeletonError> {
    let mut guard = 0u32;
    while let Some(tid) = kt.check_refinement_pop() {
        guard += 1;
        if guard > 100_000 {
            return Err(crate::error::PropagationError::NonAdvancingLoop {
                component: kt
                    .triangles
                    .get(tid)
                    .map(|t| t.component as usize)
                    .unwrap_or(0),
                time,
            }
            .into());
        }
        refine_triangulation(kt, queue.as_deref_mut(), tid, time)?;
    }
    Ok(())
}

pub fn refine_triangulation_initial(kt: &mut KineticTriangulation) -> Result<(), SkeletonError> {
    // Keep the pre-queue multi-pass at t=0: C++ one-pass+guard drops
    // weighted/srpg_octo0000035-random-2 131→130. Per-event drain uses
    // refine_triangulation (reflex-or-straight guard).
    let mut guard = 0;
    loop {
        guard += 1;
        if guard > 10_000 {
            break;
        }
        let mut flipped = false;
        let tids: Vec<_> = kt.triangles.keys().collect();
        for tid in tids {
            let t = match kt.triangles.get(tid) {
                Some(t) if t.live() && !t.is_unbounded => t,
                _ => continue,
            };
            let mut reflex_idx = None;
            let mut n_reflex = 0;
            for i in 0..3 {
                if let Some(vid) = t.vertices[i] {
                    if let Some(v) = kt.vertices.get(vid) {
                        if !v.is_convex_or_straight() {
                            n_reflex += 1;
                            reflex_idx = Some(i);
                        }
                    }
                }
            }
            if n_reflex != 1 {
                continue;
            }
            let ri = reflex_idx.unwrap();
            if t.wavefronts[ri].is_some() {
                continue;
            }
            let Some(nid) = t.neighbors[ri] else { continue };
            if kt
                .triangles
                .get(nid)
                .map(|n| n.is_unbounded || !n.live())
                .unwrap_or(true)
            {
                continue;
            }
            if raw_flip(kt, tid, ri, nid).is_err() {
                continue;
            }
            let ok = kt
                .triangles
                .get(tid)
                .map(|t| t.check_side_xor().is_ok())
                .unwrap_or(false)
                && kt
                    .triangles
                    .get(nid)
                    .map(|t| t.check_side_xor().is_ok())
                    .unwrap_or(false);
            if !ok {
                let _ = raw_flip(kt, tid, ri, nid);
                continue;
            }
            flipped = true;
        }
        if !flipped {
            break;
        }
    }
    Ok(())
}

pub fn raw_flip(
    kt: &mut KineticTriangulation,
    tid: TriangleId,
    side: usize,
    ntid: TriangleId,
) -> Result<(), SkeletonError> {
    use crate::triangulation::kinetic::{ccw, cw};

    kt.triangles
        .get(ntid)
        .ok_or_else(|| crate::error::PropagationError::TopologyInvariant {
            detail: "flip missing neighbor".into(),
        })?;
    let nidx = kt.neighbor_side(ntid, tid).ok_or_else(|| {
        crate::error::PropagationError::TopologyInvariant {
            detail: "flip: neighbor does not point back".into(),
        }
    })?;

    let (v, o) = {
        let t = &kt.triangles[tid];
        let n = &kt.triangles[ntid];
        (t.vertices[side].unwrap(), n.vertices[nidx].unwrap())
    };

    // C++ do_raw_flip_inner assigns vertices[] directly — not set_vertex,
    // which rewrites wavefront endpoints on sides that are about to move.
    let inf = kt.infinite_vertex;
    {
        let t = kt.triangles.get_mut(tid).unwrap();
        t.vertices[ccw(side)] = Some(o);
        t.is_unbounded = inf.is_some() && t.vertices.contains(&inf);
        t.invalidate_collapse();
    }
    {
        let n = kt.triangles.get_mut(ntid).unwrap();
        n.vertices[ccw(nidx)] = Some(v);
        n.is_unbounded = inf.is_some() && n.vertices.contains(&inf);
        n.invalidate_collapse();
    }

    let (t_nb_cw, t_wf_cw, n_nb_cw, n_wf_cw) = {
        let t = &kt.triangles[tid];
        let n = &kt.triangles[ntid];
        (
            t.neighbors[cw(side)],
            t.wavefronts[cw(side)],
            n.neighbors[cw(nidx)],
            n.wavefronts[cw(nidx)],
        )
    };

    {
        let t = kt.triangles.get_mut(tid).unwrap();
        t.neighbors[side] = n_nb_cw;
        t.wavefronts[side] = n_wf_cw;
        t.invalidate_collapse();
    }
    {
        let n = kt.triangles.get_mut(ntid).unwrap();
        n.neighbors[nidx] = t_nb_cw;
        n.wavefronts[nidx] = t_wf_cw;
        n.invalidate_collapse();
    }

    // pair t and n
    {
        let n = kt.triangles.get_mut(ntid).unwrap();
        n.neighbors[cw(nidx)] = Some(tid);
        n.wavefronts[cw(nidx)] = None;
        n.invalidate_collapse();
    }
    {
        let t = kt.triangles.get_mut(tid).unwrap();
        t.neighbors[cw(side)] = Some(ntid);
        t.wavefronts[cw(side)] = None;
        t.invalidate_collapse();
    }

    // outer back-pointers
    {
        let wf = kt.triangles[tid].wavefronts[side];
        let nb = kt.triangles[tid].neighbors[side];
        if let Some(eid) = wf {
            if let Some(e) = kt.edges.get_mut(eid) {
                e.incident_triangle = Some(tid);
            }
        } else if let Some(other_id) = nb {
            if let Some(s) = kt.neighbor_side(other_id, ntid) {
                if let Some(other) = kt.triangles.get_mut(other_id) {
                    other.neighbors[s] = Some(tid);
                    other.invalidate_collapse();
                }
            }
        }
    }
    {
        let wf = kt.triangles[ntid].wavefronts[nidx];
        let nb = kt.triangles[ntid].neighbors[nidx];
        if let Some(eid) = wf {
            if let Some(e) = kt.edges.get_mut(eid) {
                e.incident_triangle = Some(ntid);
            }
        } else if let Some(other_id) = nb {
            if let Some(s) = kt.neighbor_side(other_id, tid) {
                if let Some(other) = kt.triangles.get_mut(other_id) {
                    other.neighbors[s] = Some(ntid);
                    other.invalidate_collapse();
                }
            }
        }
    }

    Ok(())
}