csx 0.0.1

Pure Rust continuous-structure geometry and material modeling, compatible with CSXCAD and openEMS
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

//! One- and zero-dimensional primitives: curves, wires and points.

use crate::error::{Error, Result};
use crate::math::{BoundingBox, Vec3};
use crate::param::{ParameterSet, Scalar, ScalarPoint};

use super::geom::{dist_point_segment, tol};

fn polyline_dist(points: &[ScalarPoint], p: Vec3) -> f64 {
    let pts: Vec<Vec3> = points.iter().map(|q| q.value()).collect();
    match pts.len() {
        0 => f64::INFINITY,
        1 => (p - pts[0]).norm(),
        _ => pts
            .windows(2)
            .map(|w| dist_point_segment(p, w[0], w[1]))
            .fold(f64::INFINITY, f64::min),
    }
}

fn polyline_bbox(points: &[ScalarPoint]) -> BoundingBox {
    BoundingBox::from_points(points.iter().map(|q| q.value()))
}

fn polyline_scale(points: &[ScalarPoint]) -> f64 {
    points
        .iter()
        .flat_map(|q| q.value().0)
        .fold(0.0, |m, c| m.max(c.abs()))
}

/// A polyline through a list of points (1-D).
///
/// A point is "inside" a curve when it lies on it (within a tiny relative
/// tolerance).
#[derive(Debug, Clone, PartialEq, Default)]
pub struct Curve {
    /// Polyline vertices.
    pub points: Vec<ScalarPoint>,
}

impl Curve {
    /// Curve through `points`.
    pub fn new<P: Into<ScalarPoint>>(points: impl IntoIterator<Item = P>) -> Self {
        Curve {
            points: points.into_iter().map(Into::into).collect(),
        }
    }

    pub(crate) fn inside(&self, p: Vec3) -> bool {
        polyline_dist(&self.points, p) <= tol(polyline_scale(&self.points), 0.0)
    }

    pub(crate) fn bbox(&self) -> BoundingBox {
        polyline_bbox(&self.points)
    }

    pub(crate) fn dimension(&self) -> usize {
        if self.points.len() >= 2 { 1 } else { 0 }
    }

    pub(crate) fn update(&mut self, p: &ParameterSet) -> Result<()> {
        self.points.iter_mut().try_for_each(|q| q.update(p))
    }
}

/// A curve with a circular cross section of radius `radius`.
#[derive(Debug, Clone, PartialEq, Default)]
pub struct Wire {
    /// Polyline vertices.
    pub points: Vec<ScalarPoint>,
    /// Wire radius.
    pub radius: Scalar,
}

impl Wire {
    /// Wire through `points` with radius `radius`.
    pub fn new<P: Into<ScalarPoint>>(
        points: impl IntoIterator<Item = P>,
        radius: impl Into<Scalar>,
    ) -> Self {
        Wire {
            points: points.into_iter().map(Into::into).collect(),
            radius: radius.into(),
        }
    }

    pub(crate) fn inside(&self, p: Vec3) -> bool {
        let r = self.radius.value();
        polyline_dist(&self.points, p) <= r + tol(polyline_scale(&self.points), r)
    }

    pub(crate) fn bbox(&self) -> BoundingBox {
        let b = polyline_bbox(&self.points);
        if b.is_empty() {
            b
        } else {
            b.expanded(self.radius.value())
        }
    }

    pub(crate) fn dimension(&self) -> usize {
        if self.radius.value() > 0.0 {
            3
        } else if self.points.len() >= 2 {
            1
        } else {
            0
        }
    }

    pub(crate) fn update(&mut self, p: &ParameterSet) -> Result<()> {
        self.points.iter_mut().try_for_each(|q| q.update(p))?;
        self.radius.update(p)?;
        if self.radius.value() < 0.0 {
            return Err(Error::Invalid(format!(
                "negative wire radius {}",
                self.radius.value()
            )));
        }
        Ok(())
    }
}

/// A single point (0-D).
#[derive(Debug, Clone, PartialEq, Default)]
pub struct PointShape {
    /// Location.
    pub point: ScalarPoint,
}

impl PointShape {
    /// Point primitive at `p`.
    pub fn new(p: impl Into<ScalarPoint>) -> Self {
        PointShape { point: p.into() }
    }

    pub(crate) fn inside(&self, p: Vec3) -> bool {
        let q = self.point.value();
        (p - q).norm() <= tol(q.norm(), 0.0)
    }

    pub(crate) fn bbox(&self) -> BoundingBox {
        let q = self.point.value();
        BoundingBox::from_corners(q, q)
    }

    pub(crate) fn update(&mut self, p: &ParameterSet) -> Result<()> {
        self.point.update(p)
    }
}