symtropy-math 0.1.0

N-dimensional geometric algebra: const-generic points, bivectors, rotors, and collision shapes (2D/3D/4D+). Stack-allocated, zero-heap physics primitives.
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

// Copyright (C) 2024-2026 Tristan Stoltz / Luminous Dynamics
// SPDX-License-Identifier: AGPL-3.0-or-later
// Commercial licensing: see COMMERCIAL_LICENSE.md at repository root
use nalgebra::SVector;
use std::ops::{Add, Sub};

/// A point in D-dimensional space. Stack-allocated via nalgebra::SVector.
#[derive(Clone, Copy, Debug, PartialEq)]
pub struct Point<const D: usize>(pub SVector<f64, D>);

impl<const D: usize> Point<D> {
    /// Point at the origin.
    pub fn origin() -> Self {
        Self(SVector::zeros())
    }

    /// Create from a fixed-size array.
    pub fn new(coords: [f64; D]) -> Self {
        Self(SVector::from(coords))
    }

    /// Euclidean distance to another point.
    #[inline]
    pub fn distance(&self, other: &Self) -> f64 {
        (self.0 - other.0).norm()
    }

    /// Squared distance (avoids sqrt — use for comparisons).
    #[inline]
    pub fn distance_squared(&self, other: &Self) -> f64 {
        (self.0 - other.0).norm_squared()
    }

    /// Linear interpolation: self*(1-t) + other*t.
    #[inline]
    pub fn lerp(&self, other: &Self, t: f64) -> Self {
        Self(self.0 * (1.0 - t) + other.0 * t)
    }

    /// Access coordinate by index.
    #[inline]
    pub fn coord(&self, i: usize) -> f64 {
        self.0[i]
    }

    /// Mutable coordinate access.
    #[inline]
    pub fn coord_mut(&mut self, i: usize) -> &mut f64 {
        &mut self.0[i]
    }

    /// Convert to direction vector.
    #[inline]
    pub fn to_vector(&self) -> SVector<f64, D> {
        self.0
    }
}

impl<const D: usize> Add<SVector<f64, D>> for Point<D> {
    type Output = Point<D>;
    #[inline]
    fn add(self, rhs: SVector<f64, D>) -> Point<D> {
        Point(self.0 + rhs)
    }
}

impl<const D: usize> Sub for Point<D> {
    type Output = SVector<f64, D>;
    #[inline]
    fn sub(self, rhs: Point<D>) -> SVector<f64, D> {
        self.0 - rhs.0
    }
}

impl<const D: usize> Default for Point<D> {
    fn default() -> Self {
        Self::origin()
    }
}

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

    #[test]
    fn origin_is_zero() {
        let p = Point::<4>::origin();
        for i in 0..4 {
            assert_eq!(p.coord(i), 0.0);
        }
    }

    #[test]
    fn distance_2d() {
        let a = Point::new([0.0, 0.0]);
        let b = Point::new([3.0, 4.0]);
        assert!((a.distance(&b) - 5.0).abs() < 1e-12);
    }

    #[test]
    fn distance_4d() {
        let a = Point::new([1.0, 2.0, 3.0, 4.0]);
        let b = Point::new([5.0, 6.0, 7.0, 8.0]);
        assert!((a.distance(&b) - 8.0).abs() < 1e-12);
    }

    #[test]
    fn lerp_midpoint() {
        let a = Point::new([0.0, 0.0, 0.0]);
        let b = Point::new([10.0, 20.0, 30.0]);
        let mid = a.lerp(&b, 0.5);
        assert!((mid.coord(0) - 5.0).abs() < 1e-12);
        assert!((mid.coord(1) - 10.0).abs() < 1e-12);
    }

    #[test]
    fn subtraction() {
        let a = Point::new([1.0, 2.0]);
        let b = Point::new([4.0, 6.0]);
        let v = b - a;
        assert!((v[0] - 3.0).abs() < 1e-12);
        assert!((v[1] - 4.0).abs() < 1e-12);
    }

    #[test]
    fn is_copy() {
        let a = Point::new([1.0, 2.0]);
        let b = a;
        assert_eq!(a, b);
    }
}