cadmpeg-ir 0.2.0

CAD data model, validation, diffing, and codec API for cadmpeg.
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

// SPDX-License-Identifier: Apache-2.0
//! Validation for `SubD` cages and free-carrier source associations.
#![allow(clippy::wildcard_imports)]

use super::*;
use crate::math::Point3;
use crate::validate::geometry_payloads::bounds_err;

fn finite_point(point: &Point3) -> bool {
    point.x.is_finite() && point.y.is_finite() && point.z.is_finite()
}

fn check_source(
    source: Option<&crate::provenance::SourceObjectAssociation>,
    owner: &str,
    findings: &mut Vec<Finding>,
) {
    let Some(source) = source else { return };
    if source.format.is_empty() || source.object_id.is_empty() {
        bounds_err(
            findings,
            owner,
            "source association format and object_id must not be empty",
        );
    }
    if source.color.is_some_and(|color| {
        [color.r, color.g, color.b, color.a]
            .iter()
            .any(|v| !v.is_finite() || !(0.0..=1.0).contains(v))
    }) {
        bounds_err(
            findings,
            owner,
            "source association color is not finite or outside [0, 1]",
        );
    }
}

pub(super) fn check_source_associations(ir: &CadIr, findings: &mut Vec<Finding>) {
    for surface in &ir.model.surfaces {
        check_source(surface.source_object.as_ref(), &surface.id.0, findings);
    }
    for curve in &ir.model.curves {
        check_source(curve.source_object.as_ref(), &curve.id.0, findings);
    }
    for mesh in &ir.model.tessellations {
        check_source(mesh.source_object.as_ref(), &mesh.id, findings);
    }
    for subd in &ir.model.subds {
        check_source(subd.source_object.as_ref(), &subd.id.0, findings);
    }
}

pub(super) fn check_subds(ir: &CadIr, findings: &mut Vec<Finding>) {
    for subd in &ir.model.subds {
        let vertex_count = subd.vertices.len();
        let edge_count = subd.edges.len();
        for (index, vertex) in subd.vertices.iter().enumerate() {
            if !finite_point(&vertex.point) {
                bounds_err(
                    findings,
                    &subd.id.0,
                    &format!("SubD vertex {index} is not finite"),
                );
            }
        }
        for (index, edge) in subd.edges.iter().enumerate() {
            if edge.vertices[0] == edge.vertices[1]
                || edge.vertices.iter().any(|v| *v as usize >= vertex_count)
                || edge.sharpness.iter().any(|v| !v.is_finite() || *v < 0.0)
                || edge.sector_coefficients.iter().any(|v| !v.is_finite())
            {
                bounds_err(
                    findings,
                    &subd.id.0,
                    &format!("SubD edge {index} is invalid"),
                );
            }
        }
        for (face_index, face) in subd.faces.iter().enumerate() {
            if face.edges.len() < 3 {
                bounds_err(
                    findings,
                    &subd.id.0,
                    &format!("SubD face {face_index} has fewer than three edge uses"),
                );
                continue;
            }
            let endpoints = face
                .edges
                .iter()
                .filter_map(|use_| {
                    subd.edges.get(use_.edge as usize).map(|edge| {
                        if use_.reversed {
                            (edge.vertices[1], edge.vertices[0])
                        } else {
                            (edge.vertices[0], edge.vertices[1])
                        }
                    })
                })
                .collect::<Vec<_>>();
            if face
                .edges
                .iter()
                .any(|use_| use_.edge as usize >= edge_count)
                || endpoints.len() != face.edges.len()
                || endpoints
                    .iter()
                    .enumerate()
                    .any(|(i, (_, end))| *end != endpoints[(i + 1) % endpoints.len()].0)
            {
                bounds_err(
                    findings,
                    &subd.id.0,
                    &format!("SubD face {face_index} ring is not directed and closed"),
                );
            }
        }
    }
}

pub(super) fn check_procedural_surfaces(ir: &CadIr, findings: &mut Vec<Finding>) {
    for procedural in &ir.model.procedural_surfaces {
        if let crate::geometry::ProceduralSurfaceDefinition::Revolution {
            angular_interval,
            parameter_interval,
            ..
        } = &procedural.definition
        {
            let valid = [angular_interval, parameter_interval]
                .into_iter()
                .all(|interval| {
                    interval[0].is_finite() && interval[1].is_finite() && interval[0] < interval[1]
                });
            if !valid {
                bounds_err(
                    findings,
                    &procedural.id.0,
                    "revolution interval is not finite and ordered",
                );
            }
        }
        if let crate::geometry::ProceduralSurfaceDefinition::Sum { basepoint, .. } =
            &procedural.definition
        {
            if !basepoint.x.is_finite() || !basepoint.y.is_finite() || !basepoint.z.is_finite() {
                bounds_err(findings, &procedural.id.0, "sum basepoint is not finite");
            }
        }
    }
}