delaunay 0.8.3

D-dimensional Delaunay triangulations and convex hulls in Rust, with exact predicates, deterministic degeneracy handling, explicit topology validation, and bistellar flips for finite point sets.
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
//! Internal generic-triangulation publication state.

#![forbid(unsafe_code)]

use crate::core::tds::Tds;
use crate::geometry::kernel::Kernel;
use crate::refinement::RefinementError;
use crate::topology::traits::topological_space::GlobalTopology;
use crate::triangulation::Triangulation;
use crate::triangulation::builder::{
    TriangulationBuildFailure, TriangulationBuildMode, TriangulationBuildWithTopologyEvidence,
    TriangulationBuilderError,
};
use crate::triangulation::model::UnverifiedTriangulation;
use crate::triangulation::realization::{
    TriangulationCertificationError, TriangulationRealizationValidationError,
};
use crate::triangulation::validation::{
    TopologyCertificationEvidence, TopologyConstructionProvenance, TopologyGuarantee,
    ValidationPolicy,
};

/// Crate-internal unpublished Levels 3–4 candidate for a [Triangulation].
///
/// This type is implementation state shared by [`TriangulationBuilder`] and
/// higher-layer drafts; it is not a separate caller-facing construction API.
/// A proof-bearing [Tds] already owns complete explicit connectivity, so there
/// is no generic staged mutation to expose between the builder and publication.
/// Delaunay, constrained-Delaunay, and other geometry-specific algorithms own
/// any policy that infers or modifies connectivity.
///
/// [`TriangulationBuilder`]: crate::TriangulationBuilder
#[derive(Clone, Debug)]
pub struct TriangulationDraft<K, U, V, const D: usize> {
    triangulation: UnverifiedTriangulation<K, U, V, D>,
    selected_validation_policy: Option<ValidationPolicy>,
}

impl<K, U, V, const D: usize> TriangulationDraft<K, U, V, D> {
    /// Creates an unpublished candidate with explicit topology context.
    #[must_use]
    pub(crate) const fn with_topology_context(
        tds: Tds<U, V, D>,
        kernel: K,
        topology_guarantee: TopologyGuarantee,
        global_topology: GlobalTopology<D>,
    ) -> Self {
        Self {
            triangulation: UnverifiedTriangulation::with_topology_context(
                tds,
                kernel,
                topology_guarantee,
                global_topology,
                TopologyConstructionProvenance::Unproven,
            ),
            selected_validation_policy: None,
        }
    }

    /// Selects the validation cadence retained by the published triangulation.
    ///
    /// Compatibility with the topology guarantee is checked by
    /// [finish](Self::finish).
    #[must_use]
    pub(crate) const fn validation_policy(mut self, validation_policy: ValidationPolicy) -> Self {
        self.selected_validation_policy = Some(validation_policy);
        self
    }

    /// Attaches construction evidence available only to crate-owned workflows.
    #[must_use]
    pub(crate) const fn construction_provenance(
        mut self,
        provenance: TopologyConstructionProvenance,
    ) -> Self {
        self.triangulation.storage.topology_construction_provenance = provenance;
        self
    }
}

impl<K, U, V, const D: usize> TriangulationDraft<K, U, V, D>
where
    K: Kernel<D, Scalar = f64>,
    U: Clone,
    V: Clone,
{
    /// Publishes already-normalized TDS storage without a canonicalizing clone.
    pub(crate) fn finish_strict(
        self,
    ) -> Result<Triangulation<K, U, V, D>, TriangulationBuildFailure<U, V, D>> {
        self.finish(TriangulationBuildMode::Strict)
    }

    /// Canonicalizes inside a caller-owned TDS rollback journal.
    ///
    /// Failure returns the mutated TDS so the caller can restore its journal.
    /// This avoids the detached full-TDS before-image required by the ordinary
    /// canonicalizing builder boundary.
    pub(crate) fn finish_canonicalizing_in_transaction(
        mut self,
    ) -> Result<Triangulation<K, U, V, D>, TriangulationBuildFailure<U, V, D>> {
        let validation_policy = self.selected_validation_policy.unwrap_or_else(|| {
            self.triangulation
                .topology_guarantee
                .default_validation_policy()
        });

        if let Err(source) = self
            .triangulation
            .try_set_validation_policy(validation_policy)
        {
            return Err(RefinementError::new(
                self.triangulation.into_tds(),
                TriangulationBuilderError::ValidationConfiguration { source },
            ));
        }

        let publication = (|| {
            self.triangulation
                .normalize_and_promote_positive_orientation()
                .map_err(
                    |source| TriangulationBuilderError::OrientationNormalization {
                        source: Box::new(source),
                    },
                )?;
            self.triangulation
                .validate_geometric_nondegeneracy()
                .map_err(|source| TriangulationBuilderError::GeometricNondegeneracy {
                    source: Box::new(source),
                })?;
            self.triangulation
                .certify_levels_three_four()
                .map_err(map_certification_error)?;
            Ok(())
        })();

        if let Err(source) = publication {
            return Err(RefinementError::new(self.triangulation.into_tds(), source));
        }
        Ok(self.triangulation.into_verified())
    }

    /// Consumes the candidate and publishes it only after Levels 1–4 validation.
    ///
    /// # Errors
    ///
    /// Returns [`TriangulationBuildFailure`] if configuration is incompatible,
    /// orientation cannot be normalized, or any cumulative validation layer
    /// through Level 4 rejects the candidate. The failure retains the original
    /// TDS exactly as it was supplied to the draft.
    pub(super) fn finish(
        self,
        build_mode: TriangulationBuildMode,
    ) -> Result<Triangulation<K, U, V, D>, TriangulationBuildFailure<U, V, D>> {
        self.finish_with_topology_evidence(build_mode)
            .map(|(triangulation, _evidence)| triangulation)
    }

    /// Publishes Levels 3–4 and retains owner-bound topology metrics.
    pub(super) fn finish_with_topology_evidence(
        mut self,
        build_mode: TriangulationBuildMode,
    ) -> TriangulationBuildWithTopologyEvidence<K, U, V, D> {
        let validation_policy = self.selected_validation_policy.unwrap_or_else(|| {
            self.triangulation
                .topology_guarantee
                .default_validation_policy()
        });

        if let Err(source) = self
            .triangulation
            .try_set_validation_policy(validation_policy)
        {
            return Err(RefinementError::new(
                self.triangulation.into_tds(),
                TriangulationBuilderError::ValidationConfiguration { source },
            ));
        }

        if build_mode == TriangulationBuildMode::Strict {
            let topology_evidence = match self
                .triangulation
                .certify_levels_three_four()
                .map_err(map_certification_error)
            {
                Ok(evidence) => evidence,
                Err(source) => {
                    return Err(RefinementError::new(self.triangulation.into_tds(), source));
                }
            };
            return Ok((self.triangulation.into_verified(), topology_evidence));
        }

        let original_tds = self.triangulation.tds.clone_for_rollback();
        let publication: Result<TopologyCertificationEvidence, TriangulationBuilderError> =
            (|| {
                self.triangulation
                    .normalize_and_promote_positive_orientation()
                    .map_err(
                        |source| TriangulationBuilderError::OrientationNormalization {
                            source: Box::new(source),
                        },
                    )?;
                self.triangulation
                    .validate_geometric_nondegeneracy()
                    .map_err(|source| TriangulationBuilderError::GeometricNondegeneracy {
                        source: Box::new(source),
                    })?;
                let topology_evidence = self
                    .triangulation
                    .certify_levels_three_four()
                    .map_err(map_certification_error)?;
                Ok(topology_evidence)
            })();

        let topology_evidence =
            publication.map_err(|source| RefinementError::new(original_tds, source))?;

        Ok((self.triangulation.into_verified(), topology_evidence))
    }
}

fn map_certification_error(source: TriangulationCertificationError) -> TriangulationBuilderError {
    match source {
        TriangulationCertificationError::IncompleteConstruction { vertex_count } => {
            TriangulationBuilderError::RealizationValidation {
                source: Box::new(
                    TriangulationRealizationValidationError::IncompleteConstruction {
                        vertex_count,
                    },
                ),
            }
        }
        TriangulationCertificationError::Topology { source } => {
            TriangulationBuilderError::TopologyValidation {
                source: Box::new(source),
            }
        }
        TriangulationCertificationError::Realization { source } => {
            TriangulationBuilderError::RealizationValidation {
                source: Box::new(source),
            }
        }
    }
}

#[cfg(test)]
mod test_support {
    use super::*;

    impl<K, U, V, const D: usize> TriangulationDraft<K, U, V, D> {
        /// Consumes this layer's marker while a higher unpublished test fixture retains it.
        #[must_use]
        pub(in crate::triangulation) fn into_unpublished_triangulation(
            self,
        ) -> UnverifiedTriangulation<K, U, V, D> {
            self.triangulation
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::core::tds::TdsBuilder;
    use crate::geometry::kernel::AdaptiveKernel;
    use crate::topology::traits::topological_space::TopologyKind;
    use crate::triangulation::validation::TriangulationValidationError;
    use crate::validation_report::InvariantError;
    use crate::vertex;
    use std::assert_matches;

    #[test]
    fn explicit_connectivity_publishes_without_selecting_delaunay_connectivity() {
        let vertices = [
            vertex![0.0, 0.0].unwrap(),
            vertex![1.0, 0.0].unwrap(),
            vertex![0.0, 1.0].unwrap(),
        ];
        let simplices = [vec![0, 1, 2]];
        let tds = TdsBuilder::new(&vertices, &simplices).build().unwrap();
        let draft = TriangulationDraft::with_topology_context(
            tds,
            AdaptiveKernel::new(),
            TopologyGuarantee::DEFAULT,
            GlobalTopology::DEFAULT,
        );

        let triangulation = draft
            .finish(TriangulationBuildMode::Canonicalizing)
            .unwrap();
        assert!(triangulation.validate_realization().is_ok());
    }

    #[test]
    fn empty_draft_publishes_as_the_verified_empty_triangulation() {
        let draft: TriangulationDraft<AdaptiveKernel<f64>, (), (), 2> =
            TriangulationDraft::with_topology_context(
                Tds::empty(),
                AdaptiveKernel::new(),
                TopologyGuarantee::DEFAULT,
                GlobalTopology::DEFAULT,
            );

        let triangulation = draft
            .finish(TriangulationBuildMode::Canonicalizing)
            .unwrap();
        assert_eq!(triangulation.number_of_vertices(), 0);
        assert!(triangulation.validate_realization().is_ok());
    }

    #[test]
    fn geometrically_degenerate_connectivity_cannot_publish() {
        let vertices = [
            vertex![0.0, 0.0].unwrap(),
            vertex![1.0, 0.0].unwrap(),
            vertex![2.0, 0.0].unwrap(),
        ];
        let simplices = [vec![0, 1, 2]];
        let tds = TdsBuilder::new(&vertices, &simplices).build().unwrap();
        let draft = TriangulationDraft::with_topology_context(
            tds,
            AdaptiveKernel::new(),
            TopologyGuarantee::DEFAULT,
            GlobalTopology::DEFAULT,
        );

        assert!(
            draft
                .finish(TriangulationBuildMode::Canonicalizing)
                .is_err()
        );
    }

    #[test]
    fn transactional_publication_rejects_degeneracy_and_retains_the_journal() {
        let vertices = [
            vertex![0.0, 0.0].unwrap(),
            vertex![1.0, 0.0].unwrap(),
            vertex![2.0, 0.0].unwrap(),
        ];
        let mut tds = TdsBuilder::new(&vertices, &[vec![0, 1, 2]])
            .build()
            .unwrap();
        let expected_snapshot = serde_json::to_value(&tds).unwrap();
        let expected_owner = tds.topology_owner_id();
        let expected_generation = tds.generation();
        let savepoint = tds.begin_rollback_savepoint();

        let failure = TriangulationDraft::with_topology_context(
            tds,
            AdaptiveKernel::new(),
            TopologyGuarantee::DEFAULT,
            GlobalTopology::DEFAULT,
        )
        .finish_canonicalizing_in_transaction()
        .expect_err("a zero-area simplex must fail geometric publication");
        assert_matches!(
            failure.reason(),
            TriangulationBuilderError::GeometricNondegeneracy { source }
                if matches!(source.as_ref(), TriangulationRealizationValidationError::DegenerateSimplex { dimension: 2, .. })
        );

        let mut recovered = failure.into_owner();
        recovered.rollback_savepoint(savepoint);
        assert_eq!(recovered.topology_owner_id(), expected_owner);
        assert_eq!(recovered.generation(), expected_generation);
        assert_eq!(serde_json::to_value(&recovered).unwrap(), expected_snapshot);
        recovered.validate().unwrap();
    }

    #[test]
    fn transactional_publication_rolls_back_late_failure_and_can_retry() {
        let vertices = [
            vertex![0.0, 0.0].unwrap(),
            vertex![1.0, 0.0].unwrap(),
            vertex![0.0, 1.0].unwrap(),
        ];
        let mut tds = TdsBuilder::new(&vertices, &[vec![0, 2, 1]])
            .build()
            .unwrap();
        let expected_snapshot = serde_json::to_value(&tds).unwrap();
        let expected_owner = tds.topology_owner_id();
        let expected_generation = tds.generation();
        let expected_vertex_keys: Vec<_> = tds.vertex_keys().collect();
        let (simplex_key, simplex) = tds.simplices().next().unwrap();
        let simplex_uuid = simplex.uuid();
        let savepoint = tds.begin_rollback_savepoint();

        let failure = TriangulationDraft::with_topology_context(
            tds,
            AdaptiveKernel::new(),
            TopologyGuarantee::DEFAULT,
            GlobalTopology::Spherical,
        )
        .finish_canonicalizing_in_transaction()
        .expect_err("an open triangle cannot publish as a closed sphere");
        assert_matches!(
            failure.reason(),
            TriangulationBuilderError::TopologyValidation { source }
                if matches!(source.as_ref(), InvariantError::Triangulation {
                    source: TriangulationValidationError::BoundaryFacetInClosedTopology {
                        topology: TopologyKind::Spherical,
                        simplex_key: key,
                        simplex_uuid: uuid,
                        ..
                    },
                } if *key == simplex_key && *uuid == simplex_uuid)
        );

        let mut recovered = failure.into_owner();
        assert_ne!(recovered.generation(), expected_generation);
        assert_ne!(serde_json::to_value(&recovered).unwrap(), expected_snapshot);
        recovered.rollback_savepoint(savepoint);
        assert_eq!(recovered.topology_owner_id(), expected_owner);
        assert_eq!(recovered.generation(), expected_generation);
        assert_eq!(
            recovered.vertex_keys().collect::<Vec<_>>(),
            expected_vertex_keys
        );
        assert_eq!(recovered.simplex_keys().collect::<Vec<_>>(), [simplex_key]);
        assert_eq!(serde_json::to_value(&recovered).unwrap(), expected_snapshot);
        recovered.validate().unwrap();

        let retry_savepoint = recovered.begin_rollback_savepoint();
        let triangulation = TriangulationDraft::with_topology_context(
            recovered,
            AdaptiveKernel::new(),
            TopologyGuarantee::DEFAULT,
            GlobalTopology::Euclidean,
        )
        .finish_canonicalizing_in_transaction()
        .expect("the recovered triangle should publish with Euclidean topology");
        assert_eq!(
            triangulation.validation_policy(),
            TopologyGuarantee::DEFAULT.default_validation_policy()
        );
        triangulation.validate_realization().unwrap();
        let mut published = triangulation.into_tds();
        published.commit_savepoint(retry_savepoint);
        assert_eq!(published.topology_owner_id(), expected_owner);
        assert_eq!(
            published.vertex_keys().collect::<Vec<_>>(),
            expected_vertex_keys
        );
        assert_eq!(published.simplex_keys().collect::<Vec<_>>(), [simplex_key]);
        assert_eq!(published.simplex(simplex_key).unwrap().uuid(), simplex_uuid);
    }
}