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
use crate::math::{Isometry, Point};
use crate::query::Contact;
use crate::shape::{Ball, FeatureId, Shape};
use na::{self, RealField, Unit};
#[inline]
pub fn contact_ball_convex_polyhedron<N: RealField>(
ball_center1: &Point<N>,
ball1: &Ball<N>,
m2: &Isometry<N>,
shape2: &(impl Shape<N> + ?Sized),
prediction: N,
) -> Option<Contact<N>> {
let poly2 = shape2
.as_convex_polyhedron()
.expect("The input shape does not implement the ConvexPolyhedron trait.");
let pt_query2 = shape2
.as_point_query()
.expect("The input shape does not implement the PointQuery trait.");
let (proj, f2) = pt_query2.project_point_with_feature(m2, &ball_center1);
let world2 = proj.point;
let dpt = world2 - ball_center1;
let depth;
let normal;
if let Some((dir, dist)) = Unit::try_new_and_get(dpt, N::default_epsilon()) {
if proj.is_inside {
depth = dist + ball1.radius;
normal = -dir;
} else {
depth = -dist + ball1.radius;
normal = dir;
}
} else {
if f2 == FeatureId::Unknown {
return None;
}
depth = ball1.radius;
normal = -poly2.feature_normal(f2);
}
if depth >= -prediction {
let world1 = ball_center1 + normal.into_inner() * ball1.radius;
return Some(Contact::new(world1, world2, normal, depth));
}
None
}
#[inline]
pub fn contact_convex_polyhedron_ball<N: RealField>(
m1: &Isometry<N>,
poly1: &(impl Shape<N> + ?Sized),
ball_center2: &Point<N>,
ball2: &Ball<N>,
prediction: N,
) -> Option<Contact<N>> {
let mut res = contact_ball_convex_polyhedron(ball_center2, ball2, m1, poly1, prediction);
if let Some(c) = &mut res {
c.flip()
}
res
}