Externalize the proximity code (renamed intersection).
This commit is contained in:
@@ -1,6 +1,6 @@
|
|||||||
use na::Point3;
|
use na::Point3;
|
||||||
use rapier3d::dynamics::{JointSet, RigidBodyBuilder, RigidBodySet};
|
use rapier3d::dynamics::{JointSet, RigidBodyBuilder, RigidBodySet};
|
||||||
use rapier3d::geometry::{ColliderBuilder, ColliderSet, Proximity};
|
use rapier3d::geometry::{ColliderBuilder, ColliderSet};
|
||||||
use rapier_testbed3d::Testbed;
|
use rapier_testbed3d::Testbed;
|
||||||
|
|
||||||
pub fn init_world(testbed: &mut Testbed) {
|
pub fn init_world(testbed: &mut Testbed) {
|
||||||
@@ -74,10 +74,11 @@ pub fn init_world(testbed: &mut Testbed) {
|
|||||||
|
|
||||||
// Callback that will be executed on the main loop to handle proximities.
|
// Callback that will be executed on the main loop to handle proximities.
|
||||||
testbed.add_callback(move |_, physics, events, graphics, _| {
|
testbed.add_callback(move |_, physics, events, graphics, _| {
|
||||||
while let Ok(prox) = events.proximity_events.try_recv() {
|
while let Ok(prox) = events.intersection_events.try_recv() {
|
||||||
let color = match prox.new_status {
|
let color = if prox.intersecting {
|
||||||
Proximity::WithinMargin | Proximity::Intersecting => Point3::new(1.0, 1.0, 0.0),
|
Point3::new(1.0, 1.0, 0.0)
|
||||||
Proximity::Disjoint => Point3::new(0.5, 0.5, 1.0),
|
} else {
|
||||||
|
Point3::new(0.5, 0.5, 1.0)
|
||||||
};
|
};
|
||||||
|
|
||||||
let parent_handle1 = physics.colliders.get(prox.collider1).unwrap().parent();
|
let parent_handle1 = physics.colliders.get(prox.collider1).unwrap().parent();
|
||||||
|
|||||||
@@ -79,6 +79,19 @@ impl<T> InteractionGraph<T> {
|
|||||||
self.graph.raw_edges().iter().map(move |edge| &edge.weight)
|
self.graph.raw_edges().iter().map(move |edge| &edge.weight)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// All the interactions on this graph with the corresponding endpoint weights.
|
||||||
|
pub fn interactions_with_endpoints(
|
||||||
|
&self,
|
||||||
|
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, &T)> {
|
||||||
|
self.graph.raw_edges().iter().map(move |edge| {
|
||||||
|
(
|
||||||
|
self.graph.raw_nodes()[edge.source().index()].weight,
|
||||||
|
self.graph.raw_nodes()[edge.target().index()].weight,
|
||||||
|
&edge.weight,
|
||||||
|
)
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
/// The interaction between the two collision objects identified by their graph index.
|
/// The interaction between the two collision objects identified by their graph index.
|
||||||
pub fn interaction_pair(
|
pub fn interaction_pair(
|
||||||
&self,
|
&self,
|
||||||
|
|||||||
@@ -11,10 +11,7 @@ pub use self::interaction_graph::{
|
|||||||
};
|
};
|
||||||
pub use self::narrow_phase::NarrowPhase;
|
pub use self::narrow_phase::NarrowPhase;
|
||||||
pub use self::polygon::Polygon;
|
pub use self::polygon::Polygon;
|
||||||
pub use self::proximity_detector::{DefaultProximityDispatcher, ProximityDispatcher};
|
|
||||||
pub use self::proximity_pair::ProximityPair;
|
|
||||||
pub use self::user_callbacks::{ContactPairFilter, PairFilterContext, ProximityPairFilter};
|
pub use self::user_callbacks::{ContactPairFilter, PairFilterContext, ProximityPairFilter};
|
||||||
pub use eagl::query::Proximity;
|
|
||||||
|
|
||||||
pub use eagl::query::{KinematicsCategory, TrackedContact};
|
pub use eagl::query::{KinematicsCategory, TrackedContact};
|
||||||
|
|
||||||
@@ -62,36 +59,24 @@ pub enum ContactEvent {
|
|||||||
|
|
||||||
#[derive(Copy, Clone, Debug)]
|
#[derive(Copy, Clone, Debug)]
|
||||||
/// Events occurring when two collision objects start or stop being in close proximity, contact, or disjoint.
|
/// Events occurring when two collision objects start or stop being in close proximity, contact, or disjoint.
|
||||||
pub struct ProximityEvent {
|
pub struct IntersectionEvent {
|
||||||
/// The first collider to which the proximity event applies.
|
/// The first collider to which the proximity event applies.
|
||||||
pub collider1: ColliderHandle,
|
pub collider1: ColliderHandle,
|
||||||
/// The second collider to which the proximity event applies.
|
/// The second collider to which the proximity event applies.
|
||||||
pub collider2: ColliderHandle,
|
pub collider2: ColliderHandle,
|
||||||
/// The previous state of proximity between the two collision objects.
|
/// Are the two colliders intersecting?
|
||||||
pub prev_status: Proximity,
|
pub intersecting: bool,
|
||||||
/// The new state of proximity between the two collision objects.
|
|
||||||
pub new_status: Proximity,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
impl ProximityEvent {
|
impl IntersectionEvent {
|
||||||
/// Instantiates a new proximity event.
|
/// Instantiates a new proximity event.
|
||||||
///
|
///
|
||||||
/// Panics if `prev_status` is equal to `new_status`.
|
/// Panics if `prev_status` is equal to `new_status`.
|
||||||
pub fn new(
|
pub fn new(collider1: ColliderHandle, collider2: ColliderHandle, intersecting: bool) -> Self {
|
||||||
collider1: ColliderHandle,
|
|
||||||
collider2: ColliderHandle,
|
|
||||||
prev_status: Proximity,
|
|
||||||
new_status: Proximity,
|
|
||||||
) -> Self {
|
|
||||||
assert_ne!(
|
|
||||||
prev_status, new_status,
|
|
||||||
"The previous and new status of a proximity event must not be the same."
|
|
||||||
);
|
|
||||||
Self {
|
Self {
|
||||||
collider1,
|
collider1,
|
||||||
collider2,
|
collider2,
|
||||||
prev_status,
|
intersecting,
|
||||||
new_status,
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -117,8 +102,6 @@ mod contact_pair;
|
|||||||
mod interaction_graph;
|
mod interaction_graph;
|
||||||
mod narrow_phase;
|
mod narrow_phase;
|
||||||
mod polygon;
|
mod polygon;
|
||||||
mod proximity_detector;
|
|
||||||
mod proximity_pair;
|
|
||||||
pub(crate) mod sat;
|
pub(crate) mod sat;
|
||||||
//mod z_order;
|
//mod z_order;
|
||||||
mod interaction_groups;
|
mod interaction_groups;
|
||||||
|
|||||||
@@ -2,26 +2,22 @@
|
|||||||
use rayon::prelude::*;
|
use rayon::prelude::*;
|
||||||
|
|
||||||
use crate::dynamics::RigidBodySet;
|
use crate::dynamics::RigidBodySet;
|
||||||
use crate::geometry::proximity_detector::{
|
use eagl::query::{DefaultQueryDispatcher, PersistentQueryDispatcher, QueryDispatcher};
|
||||||
DefaultProximityDispatcher, ProximityDetectionContext, ProximityDispatcher,
|
|
||||||
};
|
|
||||||
use eagl::query::{DefaultQueryDispatcher, PersistentQueryDispatcher};
|
|
||||||
//#[cfg(feature = "simd-is-enabled")]
|
//#[cfg(feature = "simd-is-enabled")]
|
||||||
//use crate::geometry::{
|
//use crate::geometry::{
|
||||||
// contact_generator::ContactGenerationContextSimd,
|
// contact_generator::ContactGenerationContextSimd,
|
||||||
// proximity_detector::ProximityDetectionContextSimd, WBall,
|
// intersection_detector::ProximityDetectionContextSimd, WBall,
|
||||||
//};
|
//};
|
||||||
use crate::geometry::{
|
use crate::geometry::{
|
||||||
BroadPhasePairEvent, ColliderGraphIndex, ColliderHandle, ContactEvent, ContactManifoldData,
|
BroadPhasePairEvent, ColliderGraphIndex, ColliderHandle, ContactEvent, ContactManifoldData,
|
||||||
ContactPairFilter, PairFilterContext, ProximityEvent, ProximityPair, ProximityPairFilter,
|
ContactPairFilter, IntersectionEvent, PairFilterContext, ProximityPairFilter, RemovedCollider,
|
||||||
RemovedCollider, SolverFlags,
|
SolverFlags,
|
||||||
};
|
};
|
||||||
use crate::geometry::{ColliderSet, ContactManifold, ContactPair, InteractionGraph};
|
use crate::geometry::{ColliderSet, ContactManifold, ContactPair, InteractionGraph};
|
||||||
//#[cfg(feature = "simd-is-enabled")]
|
//#[cfg(feature = "simd-is-enabled")]
|
||||||
//use crate::math::{SimdReal, SIMD_WIDTH};
|
//use crate::math::{SimdReal, SIMD_WIDTH};
|
||||||
use crate::data::pubsub::Subscription;
|
use crate::data::pubsub::Subscription;
|
||||||
use crate::data::Coarena;
|
use crate::data::Coarena;
|
||||||
use crate::eagl::query::Proximity;
|
|
||||||
use crate::pipeline::EventHandler;
|
use crate::pipeline::EventHandler;
|
||||||
use std::collections::HashMap;
|
use std::collections::HashMap;
|
||||||
//use simba::simd::SimdValue;
|
//use simba::simd::SimdValue;
|
||||||
@@ -30,14 +26,14 @@ use std::collections::HashMap;
|
|||||||
#[derive(Copy, Clone, Debug, PartialEq, Eq)]
|
#[derive(Copy, Clone, Debug, PartialEq, Eq)]
|
||||||
struct ColliderGraphIndices {
|
struct ColliderGraphIndices {
|
||||||
contact_graph_index: ColliderGraphIndex,
|
contact_graph_index: ColliderGraphIndex,
|
||||||
proximity_graph_index: ColliderGraphIndex,
|
intersection_graph_index: ColliderGraphIndex,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl ColliderGraphIndices {
|
impl ColliderGraphIndices {
|
||||||
fn invalid() -> Self {
|
fn invalid() -> Self {
|
||||||
Self {
|
Self {
|
||||||
contact_graph_index: InteractionGraph::<ContactPair>::invalid_graph_index(),
|
contact_graph_index: InteractionGraph::<ContactPair>::invalid_graph_index(),
|
||||||
proximity_graph_index: InteractionGraph::<ProximityPair>::invalid_graph_index(),
|
intersection_graph_index: InteractionGraph::<bool>::invalid_graph_index(),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -47,13 +43,13 @@ impl ColliderGraphIndices {
|
|||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
pub struct NarrowPhase {
|
pub struct NarrowPhase {
|
||||||
contact_graph: InteractionGraph<ContactPair>,
|
contact_graph: InteractionGraph<ContactPair>,
|
||||||
proximity_graph: InteractionGraph<ProximityPair>,
|
intersection_graph: InteractionGraph<bool>,
|
||||||
graph_indices: Coarena<ColliderGraphIndices>,
|
graph_indices: Coarena<ColliderGraphIndices>,
|
||||||
removed_colliders: Option<Subscription<RemovedCollider>>,
|
removed_colliders: Option<Subscription<RemovedCollider>>,
|
||||||
// ball_ball: Vec<usize>, // Workspace: Vec<*mut ContactPair>,
|
// ball_ball: Vec<usize>, // Workspace: Vec<*mut ContactPair>,
|
||||||
// shape_shape: Vec<usize>, // Workspace: Vec<*mut ContactPair>,
|
// shape_shape: Vec<usize>, // Workspace: Vec<*mut ContactPair>,
|
||||||
// ball_ball_prox: Vec<usize>, // Workspace: Vec<*mut ProximityPair>,
|
// ball_ball_prox: Vec<usize>, // Workspace: Vec<*mut bool>,
|
||||||
// shape_shape_prox: Vec<usize>, // Workspace: Vec<*mut ProximityPair>,
|
// shape_shape_prox: Vec<usize>, // Workspace: Vec<*mut bool>,
|
||||||
}
|
}
|
||||||
|
|
||||||
pub(crate) type ContactManifoldIndex = usize;
|
pub(crate) type ContactManifoldIndex = usize;
|
||||||
@@ -63,7 +59,7 @@ impl NarrowPhase {
|
|||||||
pub fn new() -> Self {
|
pub fn new() -> Self {
|
||||||
Self {
|
Self {
|
||||||
contact_graph: InteractionGraph::new(),
|
contact_graph: InteractionGraph::new(),
|
||||||
proximity_graph: InteractionGraph::new(),
|
intersection_graph: InteractionGraph::new(),
|
||||||
graph_indices: Coarena::new(),
|
graph_indices: Coarena::new(),
|
||||||
removed_colliders: None,
|
removed_colliders: None,
|
||||||
// ball_ball: Vec::new(),
|
// ball_ball: Vec::new(),
|
||||||
@@ -78,9 +74,9 @@ impl NarrowPhase {
|
|||||||
&self.contact_graph
|
&self.contact_graph
|
||||||
}
|
}
|
||||||
|
|
||||||
/// The proximity graph containing all proximity pairs and their proximity information.
|
/// The intersection graph containing all intersection pairs and their intersection information.
|
||||||
pub fn proximity_graph(&self) -> &InteractionGraph<ProximityPair> {
|
pub fn intersection_graph(&self) -> &InteractionGraph<bool> {
|
||||||
&self.proximity_graph
|
&self.intersection_graph
|
||||||
}
|
}
|
||||||
|
|
||||||
/// All the contacts involving the given collider.
|
/// All the contacts involving the given collider.
|
||||||
@@ -92,15 +88,16 @@ impl NarrowPhase {
|
|||||||
Some(self.contact_graph.interactions_with(id.contact_graph_index))
|
Some(self.contact_graph.interactions_with(id.contact_graph_index))
|
||||||
}
|
}
|
||||||
|
|
||||||
/// All the proximities involving the given collider.
|
/// All the intersections involving the given collider.
|
||||||
pub fn proximities_with(
|
pub fn intersections_with<'a>(
|
||||||
&self,
|
&'a self,
|
||||||
collider: ColliderHandle,
|
collider: ColliderHandle,
|
||||||
) -> Option<impl Iterator<Item = (ColliderHandle, ColliderHandle, &ProximityPair)>> {
|
) -> Option<impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + 'a> {
|
||||||
let id = self.graph_indices.get(collider)?;
|
let id = self.graph_indices.get(collider)?;
|
||||||
Some(
|
Some(
|
||||||
self.proximity_graph
|
self.intersection_graph
|
||||||
.interactions_with(id.proximity_graph_index),
|
.interactions_with(id.intersection_graph_index)
|
||||||
|
.map(|e| (e.0, e.1, *e.2)),
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -121,21 +118,20 @@ impl NarrowPhase {
|
|||||||
.map(|c| c.2)
|
.map(|c| c.2)
|
||||||
}
|
}
|
||||||
|
|
||||||
/// The proximity pair involving two specific colliders.
|
/// The intersection pair involving two specific colliders.
|
||||||
///
|
///
|
||||||
/// If this returns `None`, there is no intersection between the two colliders.
|
/// If this returns `None` or `Some(false)`, then there is no intersection between the two colliders.
|
||||||
/// If this returns `Some`, then there may be an intersection between the two colliders. Check the
|
/// If this returns `Some(true)`, then there may be an intersection between the two colliders.
|
||||||
/// value of [`ProximityPair::proximity`] method to see if there is an actual intersection.
|
pub fn intersection_pair(
|
||||||
pub fn proximity_pair(
|
|
||||||
&self,
|
&self,
|
||||||
collider1: ColliderHandle,
|
collider1: ColliderHandle,
|
||||||
collider2: ColliderHandle,
|
collider2: ColliderHandle,
|
||||||
) -> Option<&ProximityPair> {
|
) -> Option<bool> {
|
||||||
let id1 = self.graph_indices.get(collider1)?;
|
let id1 = self.graph_indices.get(collider1)?;
|
||||||
let id2 = self.graph_indices.get(collider2)?;
|
let id2 = self.graph_indices.get(collider2)?;
|
||||||
self.proximity_graph
|
self.intersection_graph
|
||||||
.interaction_pair(id1.proximity_graph_index, id2.proximity_graph_index)
|
.interaction_pair(id1.intersection_graph_index, id2.intersection_graph_index)
|
||||||
.map(|c| c.2)
|
.map(|c| *c.2)
|
||||||
}
|
}
|
||||||
|
|
||||||
/// All the contact pairs maintained by this narrow-phase.
|
/// All the contact pairs maintained by this narrow-phase.
|
||||||
@@ -143,9 +139,13 @@ impl NarrowPhase {
|
|||||||
self.contact_graph.interactions()
|
self.contact_graph.interactions()
|
||||||
}
|
}
|
||||||
|
|
||||||
/// All the proximity pairs maintained by this narrow-phase.
|
/// All the intersection pairs maintained by this narrow-phase.
|
||||||
pub fn proximity_pairs(&self) -> impl Iterator<Item = &ProximityPair> {
|
pub fn intersection_pairs<'a>(
|
||||||
self.proximity_graph.interactions()
|
&'a self,
|
||||||
|
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + 'a {
|
||||||
|
self.intersection_graph
|
||||||
|
.interactions_with_endpoints()
|
||||||
|
.map(|e| (e.0, e.1, *e.2))
|
||||||
}
|
}
|
||||||
|
|
||||||
// #[cfg(feature = "parallel")]
|
// #[cfg(feature = "parallel")]
|
||||||
@@ -164,7 +164,7 @@ impl NarrowPhase {
|
|||||||
|
|
||||||
// TODO: avoid these hash-maps.
|
// TODO: avoid these hash-maps.
|
||||||
// They are necessary to handle the swap-remove done internally
|
// They are necessary to handle the swap-remove done internally
|
||||||
// by the contact/proximity graphs when a node is removed.
|
// by the contact/intersection graphs when a node is removed.
|
||||||
let mut prox_id_remap = HashMap::new();
|
let mut prox_id_remap = HashMap::new();
|
||||||
let mut contact_id_remap = HashMap::new();
|
let mut contact_id_remap = HashMap::new();
|
||||||
let mut i = 0;
|
let mut i = 0;
|
||||||
@@ -173,17 +173,17 @@ impl NarrowPhase {
|
|||||||
// NOTE: if the collider does not have any graph indices currently, there is nothing
|
// NOTE: if the collider does not have any graph indices currently, there is nothing
|
||||||
// to remove in the narrow-phase for this collider.
|
// to remove in the narrow-phase for this collider.
|
||||||
if let Some(graph_idx) = self.graph_indices.get(collider.handle) {
|
if let Some(graph_idx) = self.graph_indices.get(collider.handle) {
|
||||||
let proximity_graph_id = prox_id_remap
|
let intersection_graph_id = prox_id_remap
|
||||||
.get(&collider.handle)
|
.get(&collider.handle)
|
||||||
.copied()
|
.copied()
|
||||||
.unwrap_or(graph_idx.proximity_graph_index);
|
.unwrap_or(graph_idx.intersection_graph_index);
|
||||||
let contact_graph_id = contact_id_remap
|
let contact_graph_id = contact_id_remap
|
||||||
.get(&collider.handle)
|
.get(&collider.handle)
|
||||||
.copied()
|
.copied()
|
||||||
.unwrap_or(graph_idx.contact_graph_index);
|
.unwrap_or(graph_idx.contact_graph_index);
|
||||||
|
|
||||||
self.remove_collider(
|
self.remove_collider(
|
||||||
proximity_graph_id,
|
intersection_graph_id,
|
||||||
contact_graph_id,
|
contact_graph_id,
|
||||||
colliders,
|
colliders,
|
||||||
bodies,
|
bodies,
|
||||||
@@ -201,7 +201,7 @@ impl NarrowPhase {
|
|||||||
|
|
||||||
pub(crate) fn remove_collider<'a>(
|
pub(crate) fn remove_collider<'a>(
|
||||||
&mut self,
|
&mut self,
|
||||||
proximity_graph_id: ColliderGraphIndex,
|
intersection_graph_id: ColliderGraphIndex,
|
||||||
contact_graph_id: ColliderGraphIndex,
|
contact_graph_id: ColliderGraphIndex,
|
||||||
colliders: &mut ColliderSet,
|
colliders: &mut ColliderSet,
|
||||||
bodies: &mut RigidBodySet,
|
bodies: &mut RigidBodySet,
|
||||||
@@ -221,11 +221,11 @@ impl NarrowPhase {
|
|||||||
|
|
||||||
// We have to manage the fact that one other collider will
|
// We have to manage the fact that one other collider will
|
||||||
// have its graph index changed because of the node's swap-remove.
|
// have its graph index changed because of the node's swap-remove.
|
||||||
if let Some(replacement) = self.proximity_graph.remove_node(proximity_graph_id) {
|
if let Some(replacement) = self.intersection_graph.remove_node(intersection_graph_id) {
|
||||||
if let Some(replacement) = self.graph_indices.get_mut(replacement) {
|
if let Some(replacement) = self.graph_indices.get_mut(replacement) {
|
||||||
replacement.proximity_graph_index = proximity_graph_id;
|
replacement.intersection_graph_index = intersection_graph_id;
|
||||||
} else {
|
} else {
|
||||||
prox_id_remap.insert(replacement, proximity_graph_id);
|
prox_id_remap.insert(replacement, intersection_graph_id);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -265,35 +265,33 @@ impl NarrowPhase {
|
|||||||
if co1.is_sensor() || co2.is_sensor() {
|
if co1.is_sensor() || co2.is_sensor() {
|
||||||
// NOTE: the collider won't have a graph index as long
|
// NOTE: the collider won't have a graph index as long
|
||||||
// as it does not interact with anything.
|
// as it does not interact with anything.
|
||||||
if !InteractionGraph::<ProximityPair>::is_graph_index_valid(
|
if !InteractionGraph::<bool>::is_graph_index_valid(
|
||||||
gid1.proximity_graph_index,
|
gid1.intersection_graph_index,
|
||||||
) {
|
) {
|
||||||
gid1.proximity_graph_index =
|
gid1.intersection_graph_index =
|
||||||
self.proximity_graph.graph.add_node(pair.collider1);
|
self.intersection_graph.graph.add_node(pair.collider1);
|
||||||
}
|
}
|
||||||
|
|
||||||
if !InteractionGraph::<ProximityPair>::is_graph_index_valid(
|
if !InteractionGraph::<bool>::is_graph_index_valid(
|
||||||
gid2.proximity_graph_index,
|
gid2.intersection_graph_index,
|
||||||
) {
|
) {
|
||||||
gid2.proximity_graph_index =
|
gid2.intersection_graph_index =
|
||||||
self.proximity_graph.graph.add_node(pair.collider2);
|
self.intersection_graph.graph.add_node(pair.collider2);
|
||||||
}
|
}
|
||||||
|
|
||||||
if self
|
if self
|
||||||
.proximity_graph
|
.intersection_graph
|
||||||
.graph
|
.graph
|
||||||
.find_edge(gid1.proximity_graph_index, gid2.proximity_graph_index)
|
.find_edge(
|
||||||
|
gid1.intersection_graph_index,
|
||||||
|
gid2.intersection_graph_index,
|
||||||
|
)
|
||||||
.is_none()
|
.is_none()
|
||||||
{
|
{
|
||||||
let dispatcher = DefaultProximityDispatcher;
|
let _ = self.intersection_graph.add_edge(
|
||||||
let generator = dispatcher
|
gid1.intersection_graph_index,
|
||||||
.dispatch(co1.shape().shape_type(), co2.shape().shape_type());
|
gid2.intersection_graph_index,
|
||||||
let interaction =
|
false,
|
||||||
ProximityPair::new(*pair, generator.0, generator.1);
|
|
||||||
let _ = self.proximity_graph.add_edge(
|
|
||||||
gid1.proximity_graph_index,
|
|
||||||
gid2.proximity_graph_index,
|
|
||||||
interaction,
|
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
@@ -343,22 +341,19 @@ impl NarrowPhase {
|
|||||||
self.graph_indices.get(pair.collider2),
|
self.graph_indices.get(pair.collider2),
|
||||||
) {
|
) {
|
||||||
if co1.is_sensor() || co2.is_sensor() {
|
if co1.is_sensor() || co2.is_sensor() {
|
||||||
let prox_pair = self.proximity_graph.remove_edge(
|
let was_intersecting = self.intersection_graph.remove_edge(
|
||||||
gid1.proximity_graph_index,
|
gid1.intersection_graph_index,
|
||||||
gid2.proximity_graph_index,
|
gid2.intersection_graph_index,
|
||||||
);
|
);
|
||||||
|
|
||||||
// Emit a proximity lost event if we had a proximity before removing the edge.
|
// Emit an intersection lost event if we had an intersection before removing the edge.
|
||||||
if let Some(prox) = prox_pair {
|
if Some(true) == was_intersecting {
|
||||||
if prox.proximity != Proximity::Disjoint {
|
let prox_event = IntersectionEvent::new(
|
||||||
let prox_event = ProximityEvent::new(
|
pair.collider1,
|
||||||
pair.collider1,
|
pair.collider2,
|
||||||
pair.collider2,
|
false,
|
||||||
prox.proximity,
|
);
|
||||||
Proximity::Disjoint,
|
events.handle_intersection_event(prox_event)
|
||||||
);
|
|
||||||
events.handle_proximity_event(prox_event)
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
let contact_pair = self.contact_graph.remove_edge(
|
let contact_pair = self.contact_graph.remove_edge(
|
||||||
@@ -387,7 +382,7 @@ impl NarrowPhase {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub(crate) fn compute_proximities(
|
pub(crate) fn compute_intersections(
|
||||||
&mut self,
|
&mut self,
|
||||||
prediction_distance: f32,
|
prediction_distance: f32,
|
||||||
bodies: &RigidBodySet,
|
bodies: &RigidBodySet,
|
||||||
@@ -395,10 +390,12 @@ impl NarrowPhase {
|
|||||||
pair_filter: Option<&dyn ProximityPairFilter>,
|
pair_filter: Option<&dyn ProximityPairFilter>,
|
||||||
events: &dyn EventHandler,
|
events: &dyn EventHandler,
|
||||||
) {
|
) {
|
||||||
par_iter_mut!(&mut self.proximity_graph.graph.edges).for_each(|edge| {
|
let nodes = &self.intersection_graph.graph.nodes;
|
||||||
let pair = &mut edge.weight;
|
par_iter_mut!(&mut self.intersection_graph.graph.edges).for_each(|edge| {
|
||||||
let co1 = &colliders[pair.pair.collider1];
|
let handle1 = nodes[edge.source().index()].weight;
|
||||||
let co2 = &colliders[pair.pair.collider2];
|
let handle2 = nodes[edge.target().index()].weight;
|
||||||
|
let co1 = &colliders[handle1];
|
||||||
|
let co2 = &colliders[handle2];
|
||||||
|
|
||||||
// FIXME: avoid lookup into bodies.
|
// FIXME: avoid lookup into bodies.
|
||||||
let rb1 = &bodies[co1.parent];
|
let rb1 = &bodies[co1.parent];
|
||||||
@@ -408,17 +405,17 @@ impl NarrowPhase {
|
|||||||
|| (rb2.is_sleeping() && rb1.is_static())
|
|| (rb2.is_sleeping() && rb1.is_static())
|
||||||
|| (rb1.is_sleeping() && rb2.is_sleeping())
|
|| (rb1.is_sleeping() && rb2.is_sleeping())
|
||||||
{
|
{
|
||||||
// No need to update this proximity because nothing moved.
|
// No need to update this intersection because nothing moved.
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if !co1.collision_groups.test(co2.collision_groups) {
|
if !co1.collision_groups.test(co2.collision_groups) {
|
||||||
// The proximity is not allowed.
|
// The intersection is not allowed.
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if pair_filter.is_none() && !rb1.is_dynamic() && !rb2.is_dynamic() {
|
if pair_filter.is_none() && !rb1.is_dynamic() && !rb2.is_dynamic() {
|
||||||
// Default filtering rule: no proximity between two non-dynamic bodies.
|
// Default filtering rule: no intersection between two non-dynamic bodies.
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -430,34 +427,26 @@ impl NarrowPhase {
|
|||||||
collider2: co2,
|
collider2: co2,
|
||||||
};
|
};
|
||||||
|
|
||||||
if !filter.filter_proximity_pair(&context) {
|
if !filter.filter_intersection_pair(&context) {
|
||||||
// No proximity allowed.
|
// No intersection allowed.
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
let dispatcher = DefaultProximityDispatcher;
|
let pos12 = co1.position().inverse() * co2.position();
|
||||||
if pair.detector.is_none() {
|
let dispatcher = DefaultQueryDispatcher;
|
||||||
// We need a redispatch for this detector.
|
|
||||||
// This can happen, e.g., after restoring a snapshot of the narrow-phase.
|
if let Ok(intersection) = dispatcher.intersection_test(&pos12, co1.shape(), co2.shape())
|
||||||
let (detector, workspace) =
|
{
|
||||||
dispatcher.dispatch(co1.shape().shape_type(), co2.shape().shape_type());
|
if intersection != edge.weight {
|
||||||
pair.detector = Some(detector);
|
edge.weight = intersection;
|
||||||
pair.detector_workspace = workspace;
|
events.handle_intersection_event(IntersectionEvent::new(
|
||||||
|
handle1,
|
||||||
|
handle2,
|
||||||
|
intersection,
|
||||||
|
));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
let context = ProximityDetectionContext {
|
|
||||||
dispatcher: &dispatcher,
|
|
||||||
prediction_distance,
|
|
||||||
colliders,
|
|
||||||
pair,
|
|
||||||
};
|
|
||||||
|
|
||||||
context
|
|
||||||
.pair
|
|
||||||
.detector
|
|
||||||
.unwrap()
|
|
||||||
.detect_proximity(context, events);
|
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -1,68 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::PrimitiveProximityDetectionContext;
|
|
||||||
|
|
||||||
use crate::geometry::Proximity;
|
|
||||||
use crate::math::Point;
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
use {
|
|
||||||
crate::geometry::{proximity_detector::PrimitiveProximityDetectionContextSimd, WBall},
|
|
||||||
crate::math::{SimdReal, SIMD_WIDTH},
|
|
||||||
simba::simd::SimdValue,
|
|
||||||
};
|
|
||||||
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
fn ball_distance_simd(ball1: &WBall, ball2: &WBall) -> SimdReal {
|
|
||||||
let dcenter = ball2.center - ball1.center;
|
|
||||||
let center_dist = dcenter.magnitude();
|
|
||||||
center_dist - ball1.radius - ball2.radius
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub fn detect_proximity_ball_ball_simd(
|
|
||||||
ctxt: &mut PrimitiveProximityDetectionContextSimd,
|
|
||||||
) -> [Proximity; SIMD_WIDTH] {
|
|
||||||
let pos_ba = ctxt.positions2.inverse() * ctxt.positions1;
|
|
||||||
let radii_a =
|
|
||||||
SimdReal::from(array![|ii| ctxt.shapes1[ii].as_ball().unwrap().radius; SIMD_WIDTH]);
|
|
||||||
let radii_b =
|
|
||||||
SimdReal::from(array![|ii| ctxt.shapes2[ii].as_ball().unwrap().radius; SIMD_WIDTH]);
|
|
||||||
|
|
||||||
let wball_a = WBall::new(Point::origin(), radii_a);
|
|
||||||
let wball_b = WBall::new(pos_ba.inverse_transform_point(&Point::origin()), radii_b);
|
|
||||||
let distances = ball_distance_simd(&wball_a, &wball_b);
|
|
||||||
let mut proximities = [Proximity::Disjoint; SIMD_WIDTH];
|
|
||||||
|
|
||||||
for i in 0..SIMD_WIDTH {
|
|
||||||
// FIXME: compare the dist before computing the proximity.
|
|
||||||
let dist = distances.extract(i);
|
|
||||||
if dist > ctxt.prediction_distance {
|
|
||||||
proximities[i] = Proximity::Disjoint;
|
|
||||||
} else if dist > 0.0 {
|
|
||||||
proximities[i] = Proximity::WithinMargin;
|
|
||||||
} else {
|
|
||||||
proximities[i] = Proximity::Intersecting
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
proximities
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn detect_proximity_ball_ball(ctxt: &mut PrimitiveProximityDetectionContext) -> Proximity {
|
|
||||||
let pos_ba = ctxt.position2.inverse() * ctxt.position1;
|
|
||||||
let radius_a = ctxt.shape1.as_ball().unwrap().radius;
|
|
||||||
let radius_b = ctxt.shape2.as_ball().unwrap().radius;
|
|
||||||
|
|
||||||
let center_a = Point::origin();
|
|
||||||
let center_b = pos_ba.inverse_transform_point(&Point::origin());
|
|
||||||
|
|
||||||
let dcenter = center_b - center_a;
|
|
||||||
let center_dist = dcenter.magnitude();
|
|
||||||
let dist = center_dist - radius_a - radius_b;
|
|
||||||
|
|
||||||
if dist > ctxt.prediction_distance {
|
|
||||||
Proximity::Disjoint
|
|
||||||
} else if dist > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,42 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::PrimitiveProximityDetectionContext;
|
|
||||||
use crate::geometry::{Ball, Proximity};
|
|
||||||
use crate::math::Isometry;
|
|
||||||
use eagl::query::PointQuery;
|
|
||||||
|
|
||||||
pub fn detect_proximity_ball_convex(ctxt: &mut PrimitiveProximityDetectionContext) -> Proximity {
|
|
||||||
if let Some(ball1) = ctxt.shape1.as_ball() {
|
|
||||||
do_detect_proximity(ctxt.shape2, ball1, &ctxt)
|
|
||||||
} else if let Some(ball2) = ctxt.shape2.as_ball() {
|
|
||||||
do_detect_proximity(ctxt.shape1, ball2, &ctxt)
|
|
||||||
} else {
|
|
||||||
panic!("Invalid shape types provide.")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn do_detect_proximity<P: ?Sized + PointQuery>(
|
|
||||||
point_query1: &P,
|
|
||||||
ball2: &Ball,
|
|
||||||
ctxt: &PrimitiveProximityDetectionContext,
|
|
||||||
) -> Proximity {
|
|
||||||
let local_p2_1 = ctxt
|
|
||||||
.position1
|
|
||||||
.inverse_transform_point(&ctxt.position2.translation.vector.into());
|
|
||||||
|
|
||||||
let proj = point_query1.project_local_point(&local_p2_1, cfg!(feature = "dim3"));
|
|
||||||
let dpos = local_p2_1 - proj.local_point;
|
|
||||||
let dist = dpos.norm();
|
|
||||||
|
|
||||||
if proj.is_inside {
|
|
||||||
return Proximity::Intersecting;
|
|
||||||
}
|
|
||||||
|
|
||||||
if dist <= ball2.radius + ctxt.prediction_distance {
|
|
||||||
if dist <= ball2.radius {
|
|
||||||
Proximity::Intersecting
|
|
||||||
} else {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
Proximity::Disjoint
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,78 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::PrimitiveProximityDetectionContext;
|
|
||||||
use crate::geometry::Proximity;
|
|
||||||
use crate::math::Isometry;
|
|
||||||
use eagl::query::sat;
|
|
||||||
use eagl::shape::Cuboid;
|
|
||||||
|
|
||||||
pub fn detect_proximity_cuboid_cuboid(ctxt: &mut PrimitiveProximityDetectionContext) -> Proximity {
|
|
||||||
if let (Some(cube1), Some(cube2)) = (ctxt.shape1.as_cuboid(), ctxt.shape2.as_cuboid()) {
|
|
||||||
detect_proximity(
|
|
||||||
ctxt.prediction_distance,
|
|
||||||
cube1,
|
|
||||||
ctxt.position1,
|
|
||||||
cube2,
|
|
||||||
ctxt.position2,
|
|
||||||
)
|
|
||||||
} else {
|
|
||||||
unreachable!()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn detect_proximity<'a>(
|
|
||||||
prediction_distance: f32,
|
|
||||||
cube1: &'a Cuboid,
|
|
||||||
pos1: &'a Isometry<f32>,
|
|
||||||
cube2: &'a Cuboid,
|
|
||||||
pos2: &'a Isometry<f32>,
|
|
||||||
) -> Proximity {
|
|
||||||
let pos12 = pos1.inverse() * pos2;
|
|
||||||
let pos21 = pos12.inverse();
|
|
||||||
|
|
||||||
/*
|
|
||||||
*
|
|
||||||
* Point-Face
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
let sep1 = sat::cuboid_cuboid_find_local_separating_normal_oneway(cube1, cube2, &pos12).0;
|
|
||||||
if sep1 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
let sep2 = sat::cuboid_cuboid_find_local_separating_normal_oneway(cube2, cube1, &pos21).0;
|
|
||||||
if sep2 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
*
|
|
||||||
* Edge-Edge cases
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
#[cfg(feature = "dim2")]
|
|
||||||
let sep3 = -f32::MAX; // This case does not exist in 2D.
|
|
||||||
#[cfg(feature = "dim3")]
|
|
||||||
let sep3 = sat::cuboid_cuboid_find_local_separating_edge_twoway(cube1, cube2, &pos12).0;
|
|
||||||
if sep3 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
if sep2 > sep1 && sep2 > sep3 {
|
|
||||||
if sep2 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
} else if sep3 > sep1 {
|
|
||||||
if sep3 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if sep1 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,90 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::PrimitiveProximityDetectionContext;
|
|
||||||
use crate::geometry::{Cuboid, Proximity, Triangle};
|
|
||||||
use crate::math::Isometry;
|
|
||||||
use eagl::query::sat;
|
|
||||||
|
|
||||||
pub fn detect_proximity_cuboid_triangle(
|
|
||||||
ctxt: &mut PrimitiveProximityDetectionContext,
|
|
||||||
) -> Proximity {
|
|
||||||
if let (Some(cube1), Some(triangle2)) = (ctxt.shape1.as_cuboid(), ctxt.shape2.as_triangle()) {
|
|
||||||
detect_proximity(
|
|
||||||
ctxt.prediction_distance,
|
|
||||||
cube1,
|
|
||||||
ctxt.position1,
|
|
||||||
triangle2,
|
|
||||||
ctxt.position2,
|
|
||||||
)
|
|
||||||
} else if let (Some(triangle1), Some(cube2)) =
|
|
||||||
(ctxt.shape1.as_triangle(), ctxt.shape2.as_cuboid())
|
|
||||||
{
|
|
||||||
detect_proximity(
|
|
||||||
ctxt.prediction_distance,
|
|
||||||
cube2,
|
|
||||||
ctxt.position2,
|
|
||||||
triangle1,
|
|
||||||
ctxt.position1,
|
|
||||||
)
|
|
||||||
} else {
|
|
||||||
panic!("Invalid shape types")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn detect_proximity<'a>(
|
|
||||||
prediction_distance: f32,
|
|
||||||
cube1: &'a Cuboid,
|
|
||||||
pos1: &'a Isometry<f32>,
|
|
||||||
triangle2: &'a Triangle,
|
|
||||||
pos2: &'a Isometry<f32>,
|
|
||||||
) -> Proximity {
|
|
||||||
let pos12 = pos1.inverse() * pos2;
|
|
||||||
let pos21 = pos12.inverse();
|
|
||||||
|
|
||||||
/*
|
|
||||||
*
|
|
||||||
* Point-Face cases.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
let sep1 =
|
|
||||||
sat::cuboid_support_map_find_local_separating_normal_oneway(cube1, triangle2, &pos12).0;
|
|
||||||
if sep1 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
let sep2 = sat::triangle_cuboid_find_local_separating_normal_oneway(triangle2, cube1, &pos21).0;
|
|
||||||
if sep2 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
*
|
|
||||||
* Edge-Edge cases.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
#[cfg(feature = "dim2")]
|
|
||||||
let sep3 = -f32::MAX; // This case does not exist in 2D.
|
|
||||||
#[cfg(feature = "dim3")]
|
|
||||||
let sep3 = sat::cuboid_triangle_find_local_separating_edge_twoway(cube1, triangle2, &pos12).0;
|
|
||||||
if sep3 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
if sep2 > sep1 && sep2 > sep3 {
|
|
||||||
if sep2 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
} else if sep3 > sep1 {
|
|
||||||
if sep3 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if sep1 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,30 +0,0 @@
|
|||||||
pub use self::ball_ball_proximity_detector::detect_proximity_ball_ball;
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub use self::ball_ball_proximity_detector::detect_proximity_ball_ball_simd;
|
|
||||||
pub use self::ball_convex_proximity_detector::detect_proximity_ball_convex;
|
|
||||||
pub use self::cuboid_cuboid_proximity_detector::detect_proximity_cuboid_cuboid;
|
|
||||||
pub use self::cuboid_triangle_proximity_detector::detect_proximity_cuboid_triangle;
|
|
||||||
pub use self::polygon_polygon_proximity_detector::detect_proximity_polygon_polygon;
|
|
||||||
pub use self::proximity_detector::{
|
|
||||||
PrimitiveProximityDetectionContext, PrimitiveProximityDetector, ProximityDetectionContext,
|
|
||||||
ProximityDetector, ProximityPhase,
|
|
||||||
};
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub use self::proximity_detector::{
|
|
||||||
PrimitiveProximityDetectionContextSimd, ProximityDetectionContextSimd,
|
|
||||||
};
|
|
||||||
pub use self::proximity_dispatcher::{DefaultProximityDispatcher, ProximityDispatcher};
|
|
||||||
pub use self::trimesh_shape_proximity_detector::{
|
|
||||||
detect_proximity_trimesh_shape, TriMeshShapeProximityDetectorWorkspace,
|
|
||||||
};
|
|
||||||
|
|
||||||
mod ball_ball_proximity_detector;
|
|
||||||
mod ball_convex_proximity_detector;
|
|
||||||
mod ball_polygon_proximity_detector;
|
|
||||||
mod cuboid_cuboid_proximity_detector;
|
|
||||||
mod cuboid_polygon_proximity_detector;
|
|
||||||
mod cuboid_triangle_proximity_detector;
|
|
||||||
mod polygon_polygon_proximity_detector;
|
|
||||||
mod proximity_detector;
|
|
||||||
mod proximity_dispatcher;
|
|
||||||
mod trimesh_shape_proximity_detector;
|
|
||||||
@@ -1,57 +0,0 @@
|
|||||||
#![allow(dead_code)]
|
|
||||||
|
|
||||||
use crate::geometry::proximity_detector::PrimitiveProximityDetectionContext;
|
|
||||||
use crate::geometry::{sat, Polygon, Proximity};
|
|
||||||
use crate::math::Isometry;
|
|
||||||
|
|
||||||
pub fn detect_proximity_polygon_polygon(
|
|
||||||
_ctxt: &mut PrimitiveProximityDetectionContext,
|
|
||||||
) -> Proximity {
|
|
||||||
unimplemented!()
|
|
||||||
// if let (Some(polygon1), Some(polygon2)) = (ctxt.shape1.as_polygon(), ctxt.shape2.as_polygon()) {
|
|
||||||
// detect_proximity(
|
|
||||||
// ctxt.prediction_distance,
|
|
||||||
// polygon1,
|
|
||||||
// &ctxt.position1,
|
|
||||||
// polygon2,
|
|
||||||
// &ctxt.position2,
|
|
||||||
// )
|
|
||||||
// } else {
|
|
||||||
// unreachable!()
|
|
||||||
// }
|
|
||||||
}
|
|
||||||
|
|
||||||
fn detect_proximity<'a>(
|
|
||||||
prediction_distance: f32,
|
|
||||||
p1: &'a Polygon,
|
|
||||||
m1: &'a Isometry<f32>,
|
|
||||||
p2: &'a Polygon,
|
|
||||||
m2: &'a Isometry<f32>,
|
|
||||||
) -> Proximity {
|
|
||||||
let m12 = m1.inverse() * m2;
|
|
||||||
let m21 = m12.inverse();
|
|
||||||
|
|
||||||
let sep1 = sat::polygon_polygon_compute_separation_features(p1, p2, &m12);
|
|
||||||
if sep1.0 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
let sep2 = sat::polygon_polygon_compute_separation_features(p2, p1, &m21);
|
|
||||||
if sep2.0 > prediction_distance {
|
|
||||||
return Proximity::Disjoint;
|
|
||||||
}
|
|
||||||
|
|
||||||
if sep2.0 > sep1.0 {
|
|
||||||
if sep2.0 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if sep1.0 > 0.0 {
|
|
||||||
Proximity::WithinMargin
|
|
||||||
} else {
|
|
||||||
Proximity::Intersecting
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,212 +0,0 @@
|
|||||||
use crate::geometry::{
|
|
||||||
Collider, ColliderSet, Proximity, ProximityDispatcher, ProximityEvent, ProximityPair, Shape,
|
|
||||||
};
|
|
||||||
use crate::math::Isometry;
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
use crate::math::{SimdReal, SIMD_WIDTH};
|
|
||||||
use crate::pipeline::EventHandler;
|
|
||||||
use std::any::Any;
|
|
||||||
|
|
||||||
#[derive(Copy, Clone)]
|
|
||||||
pub enum ProximityPhase {
|
|
||||||
NearPhase(ProximityDetector),
|
|
||||||
ExactPhase(PrimitiveProximityDetector),
|
|
||||||
}
|
|
||||||
|
|
||||||
impl ProximityPhase {
|
|
||||||
#[inline]
|
|
||||||
pub fn detect_proximity(
|
|
||||||
self,
|
|
||||||
mut context: ProximityDetectionContext,
|
|
||||||
events: &dyn EventHandler,
|
|
||||||
) {
|
|
||||||
let proximity = match self {
|
|
||||||
Self::NearPhase(gen) => (gen.detect_proximity)(&mut context),
|
|
||||||
Self::ExactPhase(gen) => {
|
|
||||||
// Build the primitive context from the non-primitive context and dispatch.
|
|
||||||
let collider1 = &context.colliders[context.pair.pair.collider1];
|
|
||||||
let collider2 = &context.colliders[context.pair.pair.collider2];
|
|
||||||
|
|
||||||
let mut context2 = PrimitiveProximityDetectionContext {
|
|
||||||
prediction_distance: context.prediction_distance,
|
|
||||||
collider1,
|
|
||||||
collider2,
|
|
||||||
shape1: collider1.shape(),
|
|
||||||
shape2: collider2.shape(),
|
|
||||||
position1: collider1.position(),
|
|
||||||
position2: collider2.position(),
|
|
||||||
workspace: context.pair.detector_workspace.as_mut().map(|w| &mut **w),
|
|
||||||
};
|
|
||||||
|
|
||||||
(gen.detect_proximity)(&mut context2)
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
if context.pair.proximity != proximity {
|
|
||||||
events.handle_proximity_event(ProximityEvent::new(
|
|
||||||
context.pair.pair.collider1,
|
|
||||||
context.pair.pair.collider2,
|
|
||||||
context.pair.proximity,
|
|
||||||
proximity,
|
|
||||||
))
|
|
||||||
}
|
|
||||||
|
|
||||||
context.pair.proximity = proximity;
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
#[inline]
|
|
||||||
pub fn detect_proximity_simd(
|
|
||||||
self,
|
|
||||||
mut context: ProximityDetectionContextSimd,
|
|
||||||
events: &dyn EventHandler,
|
|
||||||
) {
|
|
||||||
let proximities = match self {
|
|
||||||
Self::NearPhase(gen) => (gen.detect_proximity_simd)(&mut context),
|
|
||||||
Self::ExactPhase(gen) => {
|
|
||||||
// Build the primitive context from the non-primitive context and dispatch.
|
|
||||||
use arrayvec::ArrayVec;
|
|
||||||
let mut colliders_arr: ArrayVec<[(&Collider, &Collider); SIMD_WIDTH]> =
|
|
||||||
ArrayVec::new();
|
|
||||||
let mut workspace_arr: ArrayVec<
|
|
||||||
[Option<&mut (dyn Any + Send + Sync)>; SIMD_WIDTH],
|
|
||||||
> = ArrayVec::new();
|
|
||||||
|
|
||||||
for pair in context.pairs.iter_mut() {
|
|
||||||
let collider1 = &context.colliders[pair.pair.collider1];
|
|
||||||
let collider2 = &context.colliders[pair.pair.collider2];
|
|
||||||
colliders_arr.push((collider1, collider2));
|
|
||||||
workspace_arr.push(pair.detector_workspace.as_mut().map(|w| &mut **w));
|
|
||||||
}
|
|
||||||
|
|
||||||
let max_index = colliders_arr.len() - 1;
|
|
||||||
let colliders1 = array![|ii| colliders_arr[ii.min(max_index)].0; SIMD_WIDTH];
|
|
||||||
let colliders2 = array![|ii| colliders_arr[ii.min(max_index)].1; SIMD_WIDTH];
|
|
||||||
|
|
||||||
let mut context2 = PrimitiveProximityDetectionContextSimd {
|
|
||||||
prediction_distance: context.prediction_distance,
|
|
||||||
colliders1,
|
|
||||||
colliders2,
|
|
||||||
shapes1: array![|ii| colliders1[ii].shape(); SIMD_WIDTH],
|
|
||||||
shapes2: array![|ii| colliders2[ii].shape(); SIMD_WIDTH],
|
|
||||||
positions1: &Isometry::from(
|
|
||||||
array![|ii| *colliders1[ii].position(); SIMD_WIDTH],
|
|
||||||
),
|
|
||||||
positions2: &Isometry::from(
|
|
||||||
array![|ii| *colliders2[ii].position(); SIMD_WIDTH],
|
|
||||||
),
|
|
||||||
workspaces: workspace_arr.as_mut_slice(),
|
|
||||||
};
|
|
||||||
|
|
||||||
(gen.detect_proximity_simd)(&mut context2)
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
for (i, pair) in context.pairs.iter_mut().enumerate() {
|
|
||||||
if pair.proximity != proximities[i] {
|
|
||||||
events.handle_proximity_event(ProximityEvent::new(
|
|
||||||
pair.pair.collider1,
|
|
||||||
pair.pair.collider2,
|
|
||||||
pair.proximity,
|
|
||||||
proximities[i],
|
|
||||||
))
|
|
||||||
}
|
|
||||||
pair.proximity = proximities[i];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub struct PrimitiveProximityDetectionContext<'a> {
|
|
||||||
pub prediction_distance: f32,
|
|
||||||
pub collider1: &'a Collider,
|
|
||||||
pub collider2: &'a Collider,
|
|
||||||
pub shape1: &'a dyn Shape,
|
|
||||||
pub shape2: &'a dyn Shape,
|
|
||||||
pub position1: &'a Isometry<f32>,
|
|
||||||
pub position2: &'a Isometry<f32>,
|
|
||||||
pub workspace: Option<&'a mut (dyn Any + Send + Sync)>,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub struct PrimitiveProximityDetectionContextSimd<'a, 'b> {
|
|
||||||
pub prediction_distance: f32,
|
|
||||||
pub colliders1: [&'a Collider; SIMD_WIDTH],
|
|
||||||
pub colliders2: [&'a Collider; SIMD_WIDTH],
|
|
||||||
pub shapes1: [&'a dyn Shape; SIMD_WIDTH],
|
|
||||||
pub shapes2: [&'a dyn Shape; SIMD_WIDTH],
|
|
||||||
pub positions1: &'a Isometry<SimdReal>,
|
|
||||||
pub positions2: &'a Isometry<SimdReal>,
|
|
||||||
pub workspaces: &'a mut [Option<&'b mut (dyn Any + Send + Sync)>],
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Copy, Clone)]
|
|
||||||
pub struct PrimitiveProximityDetector {
|
|
||||||
pub detect_proximity: fn(&mut PrimitiveProximityDetectionContext) -> Proximity,
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub detect_proximity_simd:
|
|
||||||
fn(&mut PrimitiveProximityDetectionContextSimd) -> [Proximity; SIMD_WIDTH],
|
|
||||||
}
|
|
||||||
|
|
||||||
impl PrimitiveProximityDetector {
|
|
||||||
fn unimplemented_fn(_ctxt: &mut PrimitiveProximityDetectionContext) -> Proximity {
|
|
||||||
Proximity::Disjoint
|
|
||||||
}
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
fn unimplemented_simd_fn(
|
|
||||||
_ctxt: &mut PrimitiveProximityDetectionContextSimd,
|
|
||||||
) -> [Proximity; SIMD_WIDTH] {
|
|
||||||
[Proximity::Disjoint; SIMD_WIDTH]
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Default for PrimitiveProximityDetector {
|
|
||||||
fn default() -> Self {
|
|
||||||
Self {
|
|
||||||
detect_proximity: Self::unimplemented_fn,
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
detect_proximity_simd: Self::unimplemented_simd_fn,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub struct ProximityDetectionContext<'a> {
|
|
||||||
pub dispatcher: &'a dyn ProximityDispatcher,
|
|
||||||
pub prediction_distance: f32,
|
|
||||||
pub colliders: &'a ColliderSet,
|
|
||||||
pub pair: &'a mut ProximityPair,
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub struct ProximityDetectionContextSimd<'a, 'b> {
|
|
||||||
pub dispatcher: &'a dyn ProximityDispatcher,
|
|
||||||
pub prediction_distance: f32,
|
|
||||||
pub colliders: &'a ColliderSet,
|
|
||||||
pub pairs: &'a mut [&'b mut ProximityPair],
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Copy, Clone)]
|
|
||||||
pub struct ProximityDetector {
|
|
||||||
pub detect_proximity: fn(&mut ProximityDetectionContext) -> Proximity,
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
pub detect_proximity_simd: fn(&mut ProximityDetectionContextSimd) -> [Proximity; SIMD_WIDTH],
|
|
||||||
}
|
|
||||||
|
|
||||||
impl ProximityDetector {
|
|
||||||
fn unimplemented_fn(_ctxt: &mut ProximityDetectionContext) -> Proximity {
|
|
||||||
Proximity::Disjoint
|
|
||||||
}
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
fn unimplemented_simd_fn(_ctxt: &mut ProximityDetectionContextSimd) -> [Proximity; SIMD_WIDTH] {
|
|
||||||
[Proximity::Disjoint; SIMD_WIDTH]
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Default for ProximityDetector {
|
|
||||||
fn default() -> Self {
|
|
||||||
Self {
|
|
||||||
detect_proximity: Self::unimplemented_fn,
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
detect_proximity_simd: Self::unimplemented_simd_fn,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,136 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::{
|
|
||||||
PrimitiveProximityDetector, ProximityDetector, ProximityPhase,
|
|
||||||
TriMeshShapeProximityDetectorWorkspace,
|
|
||||||
};
|
|
||||||
use crate::geometry::ShapeType;
|
|
||||||
use std::any::Any;
|
|
||||||
|
|
||||||
/// Trait implemented by structures responsible for selecting a collision-detection algorithm
|
|
||||||
/// for a given pair of shapes.
|
|
||||||
pub trait ProximityDispatcher {
|
|
||||||
/// Select the proximity detection algorithm for the given pair of primitive shapes.
|
|
||||||
fn dispatch_primitives(
|
|
||||||
&self,
|
|
||||||
shape1: ShapeType,
|
|
||||||
shape2: ShapeType,
|
|
||||||
) -> (
|
|
||||||
PrimitiveProximityDetector,
|
|
||||||
Option<Box<dyn Any + Send + Sync>>,
|
|
||||||
);
|
|
||||||
/// Select the proximity detection algorithm for the given pair of non-primitive shapes.
|
|
||||||
fn dispatch(
|
|
||||||
&self,
|
|
||||||
shape1: ShapeType,
|
|
||||||
shape2: ShapeType,
|
|
||||||
) -> (ProximityPhase, Option<Box<dyn Any + Send + Sync>>);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// The default proximity dispatcher used by Rapier.
|
|
||||||
pub struct DefaultProximityDispatcher;
|
|
||||||
|
|
||||||
impl ProximityDispatcher for DefaultProximityDispatcher {
|
|
||||||
fn dispatch_primitives(
|
|
||||||
&self,
|
|
||||||
shape1: ShapeType,
|
|
||||||
shape2: ShapeType,
|
|
||||||
) -> (
|
|
||||||
PrimitiveProximityDetector,
|
|
||||||
Option<Box<dyn Any + Send + Sync>>,
|
|
||||||
) {
|
|
||||||
match (shape1, shape2) {
|
|
||||||
(ShapeType::Ball, ShapeType::Ball) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
#[cfg(feature = "simd-is-enabled")]
|
|
||||||
detect_proximity_simd: super::detect_proximity_ball_ball_simd,
|
|
||||||
detect_proximity: super::detect_proximity_ball_ball,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Cuboid, ShapeType::Cuboid) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_cuboid_cuboid,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Polygon, ShapeType::Polygon) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_polygon_polygon,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Triangle, ShapeType::Ball) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_ball_convex,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Ball, ShapeType::Triangle) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_ball_convex,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Cuboid, ShapeType::Ball) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_ball_convex,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Ball, ShapeType::Cuboid) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_ball_convex,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Triangle, ShapeType::Cuboid) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_cuboid_triangle,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
(ShapeType::Cuboid, ShapeType::Triangle) => (
|
|
||||||
PrimitiveProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_cuboid_triangle,
|
|
||||||
..PrimitiveProximityDetector::default()
|
|
||||||
},
|
|
||||||
None,
|
|
||||||
),
|
|
||||||
_ => (PrimitiveProximityDetector::default(), None),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn dispatch(
|
|
||||||
&self,
|
|
||||||
shape1: ShapeType,
|
|
||||||
shape2: ShapeType,
|
|
||||||
) -> (ProximityPhase, Option<Box<dyn Any + Send + Sync>>) {
|
|
||||||
match (shape1, shape2) {
|
|
||||||
(ShapeType::TriMesh, _) => (
|
|
||||||
ProximityPhase::NearPhase(ProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_trimesh_shape,
|
|
||||||
..ProximityDetector::default()
|
|
||||||
}),
|
|
||||||
Some(Box::new(TriMeshShapeProximityDetectorWorkspace::new())),
|
|
||||||
),
|
|
||||||
(_, ShapeType::TriMesh) => (
|
|
||||||
ProximityPhase::NearPhase(ProximityDetector {
|
|
||||||
detect_proximity: super::detect_proximity_trimesh_shape,
|
|
||||||
..ProximityDetector::default()
|
|
||||||
}),
|
|
||||||
Some(Box::new(TriMeshShapeProximityDetectorWorkspace::new())),
|
|
||||||
),
|
|
||||||
_ => {
|
|
||||||
let (gen, workspace) = self.dispatch_primitives(shape1, shape2);
|
|
||||||
(ProximityPhase::ExactPhase(gen), workspace)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,135 +0,0 @@
|
|||||||
use crate::eagl::bounding_volume::{BoundingVolume, AABB};
|
|
||||||
use crate::geometry::proximity_detector::{
|
|
||||||
PrimitiveProximityDetectionContext, ProximityDetectionContext,
|
|
||||||
};
|
|
||||||
use crate::geometry::{Collider, Proximity, ShapeType, TriMesh};
|
|
||||||
|
|
||||||
pub struct TriMeshShapeProximityDetectorWorkspace {
|
|
||||||
interferences: Vec<u32>,
|
|
||||||
local_aabb2: AABB,
|
|
||||||
old_interferences: Vec<u32>,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl TriMeshShapeProximityDetectorWorkspace {
|
|
||||||
pub fn new() -> Self {
|
|
||||||
Self {
|
|
||||||
interferences: Vec::new(),
|
|
||||||
local_aabb2: AABB::new_invalid(),
|
|
||||||
old_interferences: Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn detect_proximity_trimesh_shape(ctxt: &mut ProximityDetectionContext) -> Proximity {
|
|
||||||
let collider1 = &ctxt.colliders[ctxt.pair.pair.collider1];
|
|
||||||
let collider2 = &ctxt.colliders[ctxt.pair.pair.collider2];
|
|
||||||
|
|
||||||
if let Some(trimesh1) = collider1.shape().as_trimesh() {
|
|
||||||
do_detect_proximity(trimesh1, collider1, collider2, ctxt)
|
|
||||||
} else if let Some(trimesh2) = collider2.shape().as_trimesh() {
|
|
||||||
do_detect_proximity(trimesh2, collider2, collider1, ctxt)
|
|
||||||
} else {
|
|
||||||
panic!("Invalid shape types provided.")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn do_detect_proximity(
|
|
||||||
trimesh1: &TriMesh,
|
|
||||||
collider1: &Collider,
|
|
||||||
collider2: &Collider,
|
|
||||||
ctxt: &mut ProximityDetectionContext,
|
|
||||||
) -> Proximity {
|
|
||||||
let workspace: &mut TriMeshShapeProximityDetectorWorkspace = ctxt
|
|
||||||
.pair
|
|
||||||
.detector_workspace
|
|
||||||
.as_mut()
|
|
||||||
.expect("The TriMeshShapeProximityDetectorWorkspace is missing.")
|
|
||||||
.downcast_mut()
|
|
||||||
.expect("Invalid workspace type, expected a TriMeshShapeProximityDetectorWorkspace.");
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Compute interferences.
|
|
||||||
*/
|
|
||||||
let pos12 = collider1.position.inverse() * collider2.position;
|
|
||||||
// TODO: somehow precompute the AABB and reuse it?
|
|
||||||
let mut new_local_aabb2 = collider2
|
|
||||||
.shape()
|
|
||||||
.compute_aabb(&pos12)
|
|
||||||
.loosened(ctxt.prediction_distance);
|
|
||||||
let same_local_aabb2 = workspace.local_aabb2.contains(&new_local_aabb2);
|
|
||||||
|
|
||||||
if !same_local_aabb2 {
|
|
||||||
let extra_margin =
|
|
||||||
(new_local_aabb2.maxs - new_local_aabb2.mins).map(|e| (e / 10.0).min(0.1));
|
|
||||||
new_local_aabb2.mins -= extra_margin;
|
|
||||||
new_local_aabb2.maxs += extra_margin;
|
|
||||||
|
|
||||||
let local_aabb2 = new_local_aabb2; // .loosened(ctxt.prediction_distance * 2.0); // FIXME: what would be the best value?
|
|
||||||
std::mem::swap(
|
|
||||||
&mut workspace.old_interferences,
|
|
||||||
&mut workspace.interferences,
|
|
||||||
);
|
|
||||||
|
|
||||||
workspace.interferences.clear();
|
|
||||||
trimesh1
|
|
||||||
.quadtree()
|
|
||||||
.intersect_aabb(&local_aabb2, &mut workspace.interferences);
|
|
||||||
workspace.local_aabb2 = local_aabb2;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Dispatch to the specific solver by keeping the previous manifold if we already had one.
|
|
||||||
*/
|
|
||||||
let new_interferences = &workspace.interferences;
|
|
||||||
let mut old_inter_it = workspace.old_interferences.drain(..).peekable();
|
|
||||||
let mut best_proximity = Proximity::Disjoint;
|
|
||||||
let shape_type2 = collider2.shape().shape_type();
|
|
||||||
|
|
||||||
for triangle_id in new_interferences.iter() {
|
|
||||||
if *triangle_id >= trimesh1.num_triangles() as u32 {
|
|
||||||
// Because of SIMD padding, the broad-phase may return triangle indices greater
|
|
||||||
// than the max.
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if !same_local_aabb2 {
|
|
||||||
loop {
|
|
||||||
match old_inter_it.peek() {
|
|
||||||
Some(old_triangle_id) if *old_triangle_id < *triangle_id => {
|
|
||||||
old_inter_it.next();
|
|
||||||
}
|
|
||||||
_ => break,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if old_inter_it.peek() != Some(triangle_id) {
|
|
||||||
} else {
|
|
||||||
old_inter_it.next();
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
let triangle1 = trimesh1.triangle(*triangle_id);
|
|
||||||
let (proximity_detector, mut workspace2) = ctxt
|
|
||||||
.dispatcher
|
|
||||||
.dispatch_primitives(ShapeType::Triangle, shape_type2);
|
|
||||||
|
|
||||||
let mut ctxt2 = PrimitiveProximityDetectionContext {
|
|
||||||
prediction_distance: ctxt.prediction_distance,
|
|
||||||
collider1,
|
|
||||||
collider2,
|
|
||||||
shape1: &triangle1,
|
|
||||||
shape2: collider2.shape(),
|
|
||||||
position1: collider1.position(),
|
|
||||||
position2: collider2.position(),
|
|
||||||
workspace: workspace2.as_mut().map(|w| &mut **w),
|
|
||||||
};
|
|
||||||
|
|
||||||
match (proximity_detector.detect_proximity)(&mut ctxt2) {
|
|
||||||
Proximity::Intersecting => return Proximity::Intersecting,
|
|
||||||
Proximity::WithinMargin => best_proximity = Proximity::WithinMargin,
|
|
||||||
Proximity::Disjoint => {}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
best_proximity
|
|
||||||
}
|
|
||||||
@@ -1,43 +0,0 @@
|
|||||||
use crate::geometry::proximity_detector::ProximityPhase;
|
|
||||||
use crate::geometry::{ColliderPair, Proximity};
|
|
||||||
use std::any::Any;
|
|
||||||
|
|
||||||
#[cfg_attr(feature = "serde-serialize", derive(Serialize, Deserialize))]
|
|
||||||
/// The description of the proximity of two colliders.
|
|
||||||
pub struct ProximityPair {
|
|
||||||
/// The pair of collider involved.
|
|
||||||
pub pair: ColliderPair,
|
|
||||||
/// The state of proximity between the two colliders.
|
|
||||||
pub proximity: Proximity,
|
|
||||||
#[cfg_attr(feature = "serde-serialize", serde(skip))]
|
|
||||||
pub(crate) detector: Option<ProximityPhase>,
|
|
||||||
#[cfg_attr(feature = "serde-serialize", serde(skip))]
|
|
||||||
pub(crate) detector_workspace: Option<Box<dyn Any + Send + Sync>>,
|
|
||||||
}
|
|
||||||
|
|
||||||
// TODO: use the `derive(Clone)` instead?
|
|
||||||
impl Clone for ProximityPair {
|
|
||||||
fn clone(&self) -> Self {
|
|
||||||
ProximityPair {
|
|
||||||
pair: self.pair.clone(),
|
|
||||||
proximity: self.proximity.clone(),
|
|
||||||
detector: None,
|
|
||||||
detector_workspace: None,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl ProximityPair {
|
|
||||||
pub(crate) fn new(
|
|
||||||
pair: ColliderPair,
|
|
||||||
detector: ProximityPhase,
|
|
||||||
detector_workspace: Option<Box<dyn Any + Send + Sync>>,
|
|
||||||
) -> Self {
|
|
||||||
Self {
|
|
||||||
pair,
|
|
||||||
proximity: Proximity::Disjoint,
|
|
||||||
detector: Some(detector),
|
|
||||||
detector_workspace,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -37,21 +37,21 @@ pub trait ContactPairFilter: Send + Sync {
|
|||||||
fn filter_contact_pair(&self, context: &PairFilterContext) -> Option<SolverFlags>;
|
fn filter_contact_pair(&self, context: &PairFilterContext) -> Option<SolverFlags>;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// User-defined filter for potential proximity pairs detected by the broad-phase.
|
/// User-defined filter for potential intersection pairs detected by the broad-phase.
|
||||||
///
|
///
|
||||||
/// This can be used to apply custom logic in order to decide whether two colliders
|
/// This can be used to apply custom logic in order to decide whether two colliders
|
||||||
/// should have their proximity computed by the narrow-phase.
|
/// should have their intersection computed by the narrow-phase.
|
||||||
pub trait ProximityPairFilter: Send + Sync {
|
pub trait ProximityPairFilter: Send + Sync {
|
||||||
/// Applies the proximity pair filter.
|
/// Applies the intersection pair filter.
|
||||||
///
|
///
|
||||||
/// Note that using a proximity pair filter will replace the default proximity filtering
|
/// Note that using an intersection pair filter will replace the default intersection filtering
|
||||||
/// which consists of preventing proximity computation between two non-dynamic bodies.
|
/// which consists of preventing intersection computation between two non-dynamic bodies.
|
||||||
///
|
///
|
||||||
/// This filtering method is called after taking into account the colliders collision groups.
|
/// This filtering method is called after taking into account the colliders collision groups.
|
||||||
///
|
///
|
||||||
/// If this returns `false`, then the narrow-phase will ignore this pair and
|
/// If this returns `false`, then the narrow-phase will ignore this pair and
|
||||||
/// not compute any proximity information for it.
|
/// not compute any intersection information for it.
|
||||||
/// If this return `true` then the narrow-phase will compute proximity
|
/// If this return `true` then the narrow-phase will compute intersection
|
||||||
/// information for this pair.
|
/// information for this pair.
|
||||||
fn filter_proximity_pair(&self, context: &PairFilterContext) -> bool;
|
fn filter_intersection_pair(&self, context: &PairFilterContext) -> bool;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -64,7 +64,7 @@ impl CollisionPipeline {
|
|||||||
contact_pair_filter,
|
contact_pair_filter,
|
||||||
events,
|
events,
|
||||||
);
|
);
|
||||||
narrow_phase.compute_proximities(
|
narrow_phase.compute_intersections(
|
||||||
prediction_distance,
|
prediction_distance,
|
||||||
bodies,
|
bodies,
|
||||||
colliders,
|
colliders,
|
||||||
|
|||||||
@@ -1,14 +1,14 @@
|
|||||||
use crate::geometry::{ContactEvent, ProximityEvent};
|
use crate::geometry::{ContactEvent, IntersectionEvent};
|
||||||
use crossbeam::channel::Sender;
|
use crossbeam::channel::Sender;
|
||||||
|
|
||||||
/// Trait implemented by structures responsible for handling events generated by the physics engine.
|
/// Trait implemented by structures responsible for handling events generated by the physics engine.
|
||||||
///
|
///
|
||||||
/// Implementors of this trait will typically collect these events for future processing.
|
/// Implementors of this trait will typically collect these events for future processing.
|
||||||
pub trait EventHandler: Send + Sync {
|
pub trait EventHandler: Send + Sync {
|
||||||
/// Handle a proximity event.
|
/// Handle an intersection event.
|
||||||
///
|
///
|
||||||
/// A proximity event is emitted when the state of proximity between two colliders changes.
|
/// A intersection event is emitted when the state of intersection between two colliders changes.
|
||||||
fn handle_proximity_event(&self, event: ProximityEvent);
|
fn handle_intersection_event(&self, event: IntersectionEvent);
|
||||||
/// Handle a contact event.
|
/// Handle a contact event.
|
||||||
///
|
///
|
||||||
/// A contact event is emitted when two collider start or stop touching, independently from the
|
/// A contact event is emitted when two collider start or stop touching, independently from the
|
||||||
@@ -17,32 +17,32 @@ pub trait EventHandler: Send + Sync {
|
|||||||
}
|
}
|
||||||
|
|
||||||
impl EventHandler for () {
|
impl EventHandler for () {
|
||||||
fn handle_proximity_event(&self, _event: ProximityEvent) {}
|
fn handle_intersection_event(&self, _event: IntersectionEvent) {}
|
||||||
fn handle_contact_event(&self, _event: ContactEvent) {}
|
fn handle_contact_event(&self, _event: ContactEvent) {}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// A physics event handler that collects events into a crossbeam channel.
|
/// A physics event handler that collects events into a crossbeam channel.
|
||||||
pub struct ChannelEventCollector {
|
pub struct ChannelEventCollector {
|
||||||
proximity_event_sender: Sender<ProximityEvent>,
|
intersection_event_sender: Sender<IntersectionEvent>,
|
||||||
contact_event_sender: Sender<ContactEvent>,
|
contact_event_sender: Sender<ContactEvent>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl ChannelEventCollector {
|
impl ChannelEventCollector {
|
||||||
/// Initialize a new physics event handler from crossbeam channel senders.
|
/// Initialize a new physics event handler from crossbeam channel senders.
|
||||||
pub fn new(
|
pub fn new(
|
||||||
proximity_event_sender: Sender<ProximityEvent>,
|
intersection_event_sender: Sender<IntersectionEvent>,
|
||||||
contact_event_sender: Sender<ContactEvent>,
|
contact_event_sender: Sender<ContactEvent>,
|
||||||
) -> Self {
|
) -> Self {
|
||||||
Self {
|
Self {
|
||||||
proximity_event_sender,
|
intersection_event_sender,
|
||||||
contact_event_sender,
|
contact_event_sender,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl EventHandler for ChannelEventCollector {
|
impl EventHandler for ChannelEventCollector {
|
||||||
fn handle_proximity_event(&self, event: ProximityEvent) {
|
fn handle_intersection_event(&self, event: IntersectionEvent) {
|
||||||
let _ = self.proximity_event_sender.send(event);
|
let _ = self.intersection_event_sender.send(event);
|
||||||
}
|
}
|
||||||
|
|
||||||
fn handle_contact_event(&self, event: ContactEvent) {
|
fn handle_contact_event(&self, event: ContactEvent) {
|
||||||
|
|||||||
@@ -118,7 +118,7 @@ impl PhysicsPipeline {
|
|||||||
contact_pair_filter,
|
contact_pair_filter,
|
||||||
events,
|
events,
|
||||||
);
|
);
|
||||||
narrow_phase.compute_proximities(
|
narrow_phase.compute_intersections(
|
||||||
integration_parameters.prediction_distance,
|
integration_parameters.prediction_distance,
|
||||||
bodies,
|
bodies,
|
||||||
colliders,
|
colliders,
|
||||||
|
|||||||
@@ -202,11 +202,11 @@ impl Testbed {
|
|||||||
};
|
};
|
||||||
|
|
||||||
let contact_channel = crossbeam::channel::unbounded();
|
let contact_channel = crossbeam::channel::unbounded();
|
||||||
let proximity_channel = crossbeam::channel::unbounded();
|
let intersection_channel = crossbeam::channel::unbounded();
|
||||||
let event_handler = ChannelEventCollector::new(proximity_channel.0, contact_channel.0);
|
let event_handler = ChannelEventCollector::new(intersection_channel.0, contact_channel.0);
|
||||||
let events = PhysicsEvents {
|
let events = PhysicsEvents {
|
||||||
contact_events: contact_channel.1,
|
contact_events: contact_channel.1,
|
||||||
proximity_events: proximity_channel.1,
|
intersection_events: intersection_channel.1,
|
||||||
};
|
};
|
||||||
let physics = PhysicsState::new();
|
let physics = PhysicsState::new();
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user