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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
use crate::math::Isometry;
#[cfg(feature = "dim2")]
use crate::query;
use crate::query::{Ray, RayCast, RayIntersection};
#[cfg(feature = "dim2")]
use crate::shape::FeatureId;
use crate::shape::HeightField;
use na::RealField;
#[cfg(feature = "dim2")]
impl<N: RealField> RayCast<N> for HeightField<N> {
#[inline]
fn toi_and_normal_with_ray(
&self,
m: &Isometry<N>,
ray: &Ray<N>,
max_toi: N,
_: bool,
) -> Option<RayIntersection<N>> {
let aabb = self.aabb();
let ls_ray = ray.inverse_transform_by(m);
let (min_t, mut max_t) = aabb.clip_ray_parameters(&ls_ray)?;
if min_t > max_toi {
return None;
}
max_t = max_t.min(max_toi);
let clip_ray_a = ls_ray.point_at(min_t);
let mut curr = self.cell_at_point(&clip_ray_a).unwrap_or_else(|| {
if ls_ray.origin.x > N::zero() {
self.num_cells() - 1
} else {
0_usize
}
});
if let Some(seg) = self.segment_at(curr) {
let (s, t) = query::closest_points_line_line_parameters(
&ray.origin,
&ray.dir,
&seg.a,
&seg.scaled_direction(),
);
if s >= N::zero() && t >= N::zero() && t <= N::one() {
let n = seg.normal().unwrap().into_inner();
let fid = if n.dot(&ls_ray.dir) > N::zero() {
curr + self.num_cells()
} else {
curr
};
return Some(RayIntersection::new(s, m * n, FeatureId::Face(fid)));
}
}
if ls_ray.dir.x == N::zero() {
return None;
}
let right = ls_ray.dir.x > N::zero();
let cell_width = self.cell_width();
let start_x = self.start_x();
while (right && curr < self.num_cells()) || (!right && curr > 0) {
let curr_param;
if right {
curr += 1;
curr_param = (cell_width * na::convert(curr as f64) + start_x - ls_ray.origin.x)
/ ls_ray.dir.x;
} else {
curr_param = (ls_ray.origin.x - cell_width * na::convert(curr as f64) - start_x)
/ ls_ray.dir.x;
curr -= 1;
}
if curr_param >= max_t {
return None;
}
if let Some(seg) = self.segment_at(curr) {
let (s, t) = query::closest_points_line_line_parameters(
&ray.origin,
&ray.dir,
&seg.a,
&seg.scaled_direction(),
);
if t >= N::zero() && t <= N::one() && s <= max_toi {
let n = seg.normal().unwrap().into_inner();
let fid = if n.dot(&ls_ray.dir) > N::zero() {
curr + self.num_cells()
} else {
curr
};
return Some(RayIntersection::new(s, m * n, FeatureId::Face(fid)));
}
}
}
None
}
}
#[cfg(feature = "dim3")]
impl<N: RealField> RayCast<N> for HeightField<N> {
#[inline]
fn toi_and_normal_with_ray(
&self,
m: &Isometry<N>,
ray: &Ray<N>,
max_toi: N,
solid: bool,
) -> Option<RayIntersection<N>> {
let aabb = self.aabb();
let ls_ray = ray.inverse_transform_by(m);
let (min_t, mut max_t) = aabb.clip_ray_parameters(&ls_ray)?;
max_t = max_t.min(max_toi);
let clip_ray_a = ls_ray.point_at(min_t);
let mut cell = match self.cell_at_point(&clip_ray_a) {
Some(cell) => cell,
None => {
let i = if ls_ray.origin.z > N::zero() {
self.nrows() - 1
} else {
0
};
let j = if ls_ray.origin.x > N::zero() {
self.ncols() - 1
} else {
0
};
(i, j)
}
};
loop {
let tris = self.triangles_at(cell.0, cell.1);
let inter1 = tris
.0
.and_then(|tri| tri.toi_and_normal_with_ray(m, ray, max_toi, solid));
let inter2 = tris
.1
.and_then(|tri| tri.toi_and_normal_with_ray(m, ray, max_toi, solid));
match (inter1, inter2) {
(Some(mut inter1), Some(mut inter2)) => {
if inter1.toi < inter2.toi {
inter1.feature =
self.convert_triangle_feature_id(cell.0, cell.1, true, inter1.feature);
return Some(inter1);
} else {
inter2.feature =
self.convert_triangle_feature_id(cell.0, cell.1, false, inter2.feature);
return Some(inter2);
}
}
(Some(mut inter), None) => {
inter.feature =
self.convert_triangle_feature_id(cell.0, cell.1, true, inter.feature);
return Some(inter);
}
(None, Some(mut inter)) => {
inter.feature =
self.convert_triangle_feature_id(cell.0, cell.1, false, inter.feature);
return Some(inter);
}
(None, None) => {}
}
let (toi_x, right) = if ls_ray.dir.x > N::zero() {
let x = self.x_at(cell.1 + 1);
((x - ls_ray.origin.x) / ls_ray.dir.x, true)
} else if ls_ray.dir.x < N::zero() {
let x = self.x_at(cell.1 + 0);
((x - ls_ray.origin.x) / ls_ray.dir.x, false)
} else {
(N::max_value(), false)
};
let (toi_z, down) = if ls_ray.dir.z > N::zero() {
let z = self.z_at(cell.0 + 1);
((z - ls_ray.origin.z) / ls_ray.dir.z, true)
} else if ls_ray.dir.z < N::zero() {
let z = self.z_at(cell.0 + 0);
((z - ls_ray.origin.z) / ls_ray.dir.z, false)
} else {
(N::max_value(), false)
};
if toi_x > max_t && toi_z > max_t {
break;
}
if toi_x >= N::zero() && toi_x < toi_z {
if right {
cell.1 += 1
} else if cell.1 > 0 {
cell.1 -= 1
} else {
break;
}
} else if toi_z >= N::zero() {
if down {
cell.0 += 1
} else if cell.0 > 0 {
cell.0 -= 1
} else {
break;
}
} else {
break;
}
if cell.0 >= self.nrows() || cell.1 >= self.ncols() {
break;
}
}
None
}
}