nsys-math-utils 0.1.0

Math types and traits
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
153
154
155
156
157
158
159
160
161

//! Intersection of Aabbs over Integers.
//!
//! Note that unlike Aabbs over Scalars, Aabbs over Integers are *closed* (they
//! include their boundaries).

use crate::*;
use crate::geometry::primitive::integer::*;

/// Discrete intersection test of 1D axis-aligned bounding boxes (intervals).
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Interval::from_points ( 0, 1);
/// let b = Interval::from_points (-1, 0);
/// assert!(discrete_interval (&a, &b));
/// ```
#[inline]
pub fn discrete_interval <I : Integer> (a : &Interval <I>, b : &Interval <I>)
  -> bool
{
  let (min_a, max_a) = (a.min(), a.max());
  let (min_b, max_b) = (b.min(), b.max());
  // intersection if intervals overlap
  max_a >= min_b && min_a <= max_b
}

/// Continuous intersection test of 1D axis-aligned bounding boxes (intervals).
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Interval::from_points ( 0, 1);
/// let b = Interval::from_points (-1, 0);
/// assert_eq!(
///   continuous_interval (&a, &b).unwrap(),
///   Interval::from_points (0, 0));
/// ```
#[inline]
pub fn continuous_interval <I> (a : &Interval <I>, b : &Interval <I>)
  -> Option <Interval <I>>
where
  I : Integer + std::fmt::Debug
{
  if discrete_interval (a, b) {
    Some (Interval::with_minmax (
      Ord::max (a.min(), b.min()),
      Ord::min (a.max(), b.max())
    ))
  } else {
    None
  }
}

/// Discrete intersection test of 2D axis-aligned bounding boxes.
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Aabb2::from_points ([ 0, 0].into(), [1, 1].into());
/// let b = Aabb2::from_points ([-1, 0].into(), [0, 1].into());
/// assert!(discrete_aabb2_aabb2 (&a, &b));
/// ```
#[inline]
pub fn discrete_aabb2_aabb2 <I : Integer> (a : &Aabb2 <I>, b : &Aabb2 <I>)
  -> bool
{
  let (min_a, max_a) = (a.min(), a.max());
  let (min_b, max_b) = (b.min(), b.max());
  // intersection if overlap exists on both axes
  max_a.0.x >= min_b.0.x && min_a.0.x <= max_b.0.x &&
  max_a.0.y >= min_b.0.y && min_a.0.y <= max_b.0.y
}

/// Continuous intersection test of 2D axis-aligned bounding boxes.
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Aabb2::from_points ([ 0, 0].into(), [1, 1].into());
/// let b = Aabb2::from_points ([-1, 0].into(), [0, 1].into());
/// assert_eq!(
///   continuous_aabb2_aabb2 (&a, &b).unwrap(),
///   Aabb2::from_points ([0,0].into(), [0, 1].into()));
/// ```
#[inline]
pub fn continuous_aabb2_aabb2 <I> (a : &Aabb2 <I>, b : &Aabb2 <I>)
  -> Option <Aabb2 <I>>
where
  I : Integer + std::fmt::Debug
{
  if discrete_aabb2_aabb2 (a, b) {
    Some (Aabb2::with_minmax (
      point2_max (a.min(), b.min()),
      point2_min (a.max(), b.max())
    ))
  } else {
    None
  }
}

/// Discrete intersection test of 3D axis-aligned bounding boxes.
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Aabb3::from_points ([ 0, 0,  0].into(), [1, 1, 1].into());
/// let b = Aabb3::from_points ([-1, 0,  0].into(), [0, 1, 1].into());
/// assert!(discrete_aabb3_aabb3 (&a, &b));
/// ```
#[inline]
pub fn discrete_aabb3_aabb3 <I : Integer> (a : &Aabb3 <I>, b : &Aabb3 <I>)
  -> bool
{
  let (min_a, max_a) = (a.min(), a.max());
  let (min_b, max_b) = (b.min(), b.max());
  // intersection if overlap exists on all three axes
  max_a.0.x >= min_b.0.x && min_a.0.x <= max_b.0.x &&
  max_a.0.y >= min_b.0.y && min_a.0.y <= max_b.0.y &&
  max_a.0.z >= min_b.0.z && min_a.0.z <= max_b.0.z
}

/// Continuous intersection test of 3D axis-aligned bounding boxes.
///
/// Shared boundary points will return intersection:
///
/// ```
/// # use math_utils::geometry::integer::*;
/// # use math_utils::geometry::intersect::integer::*;
/// let a = Aabb3::from_points ([ 0, 0,  0].into(), [1, 1, 1].into());
/// let b = Aabb3::from_points ([-1, 0,  0].into(), [0, 1, 1].into());
/// assert_eq!(
///   continuous_aabb3_aabb3 (&a, &b).unwrap(),
///   Aabb3::from_points ([0, 0, 0].into(), [0, 1, 1].into()));
/// ```
#[inline]
pub fn continuous_aabb3_aabb3 <I> (a : &Aabb3 <I>, b : &Aabb3 <I>)
  -> Option <Aabb3 <I>>
where
  I : Integer + std::fmt::Debug
{
  if discrete_aabb3_aabb3 (a, b) {
    Some (Aabb3::with_minmax (
      point3_max (a.min(), b.min()),
      point3_min (a.max(), b.max())
    ))
  } else {
    None
  }
}