cgar 0.2.0

CGAL-like computational geometry library in Rust
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

// SPDX-License-Identifier: MIT
//
// Copyright (c) 2025 Alexandre Severino
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

use std::ops::{Index, IndexMut};

use smallvec::SmallVec;

use crate::{geometry::segment::Segment, numeric::scalar::Scalar};

#[derive(Debug, Clone)]
pub struct IntersectionEndPoint<T: Scalar, const N: usize> {
    pub vertex_hint: Option<[usize; 2]>,
    pub half_edge_hint: Option<usize>,
    pub half_edge_u_hint: Option<T>,
    pub faces_hint: Option<[usize; 2]>,
    pub barycentric_hint: Option<(T, T, T)>,
    pub resulting_vertex: Option<usize>,
}

impl<T: Scalar, const N: usize> IntersectionEndPoint<T, N> {
    pub fn new(
        // point: Point<T, N>,
        vertex_hint: Option<[usize; 2]>,
        half_edge_hint: Option<usize>,
        half_edge_u_hint: Option<T>,
        faces_hint: Option<[usize; 2]>,
        barycentric_hint: Option<(T, T, T)>,
        resulting_vertex: Option<usize>,
    ) -> Self {
        Self {
            // point,
            vertex_hint,
            half_edge_hint,
            half_edge_u_hint,
            faces_hint: faces_hint,
            barycentric_hint,
            resulting_vertex,
        }
    }
    pub fn new_default() -> Self {
        Self {
            // point: Point::default(),
            vertex_hint: None,
            half_edge_hint: None,
            half_edge_u_hint: None,
            faces_hint: None,
            barycentric_hint: None,
            resulting_vertex: None,
        }
    }
}

impl<T: Scalar, const N: usize> Default for IntersectionEndPoint<T, N> {
    fn default() -> Self {
        Self::new_default()
    }
}

#[derive(Debug, Clone)]
pub struct IntersectionSegment<T: Scalar, const N: usize> {
    pub a: IntersectionEndPoint<T, N>,
    pub b: IntersectionEndPoint<T, N>,
    pub segment: Segment<T, N>,
    pub initial_face_reference: usize,
    pub links: SmallVec<[usize; 2]>,
    pub coplanar: bool,
    pub invalidated: bool,
    pub split: bool,
}

impl<T: Scalar, const N: usize> Index<usize> for IntersectionSegment<T, N> {
    type Output = IntersectionEndPoint<T, N>;
    fn index(&self, i: usize) -> &Self::Output {
        if i == 0 {
            &self.a
        } else if i == 1 {
            &self.b
        } else {
            panic!("Index out of bounds for Segment: {}", i);
        }
    }
}
impl<T: Scalar, const N: usize> IndexMut<usize> for IntersectionSegment<T, N> {
    fn index_mut(&mut self, i: usize) -> &mut Self::Output {
        if i == 0 {
            &mut self.a
        } else if i == 1 {
            &mut self.b
        } else {
            panic!("Index out of bounds for Segment: {}", i);
        }
    }
}

impl<T: Scalar, const N: usize> IntersectionSegment<T, N> {
    pub fn new(
        a: IntersectionEndPoint<T, N>,
        b: IntersectionEndPoint<T, N>,
        segment: &Segment<T, N>,
        initial_face_reference: usize,
        coplanar: bool,
    ) -> Self {
        Self {
            a: a,
            b: b,
            segment: segment.clone(),
            initial_face_reference,
            links: SmallVec::new(),
            coplanar,
            invalidated: false,
            split: true,
        }
    }
    pub fn new_default(
        a: IntersectionEndPoint<T, N>,
        b: IntersectionEndPoint<T, N>,
        segment: &Segment<T, N>,
        initial_face_reference: usize,
    ) -> Self {
        Self::new(a, b, segment, initial_face_reference, false)
    }
}

impl<T: Scalar, const N: usize> Default for IntersectionSegment<T, N> {
    fn default() -> Self {
        Self::new_default(
            IntersectionEndPoint::default(),
            IntersectionEndPoint::default(),
            &Segment::default(),
            usize::MAX,
        )
    }
}