Function ncollide2df64::narrow::algorithm::gjk::closest_points_without_margin_with_max_dist

pub fn closest_points_without_margin_with_max_dist<S: Simplex<AnnotatedPoint>, G1: Implicit<V, M>, G2: Implicit<V, M>>(m1: &M, g1: &G1, m2: &M, g2: &G2, max_dist: &N, simplex: &mut S) -> GJKResult<(V, V), V>

Computes the closest points between two convex geometries without their margins unsing the GJK algorithm.

Arguments:

g1 - first geometry.
g2 - second geometry.
simplex - the simplex to be used by the GJK algorithm. It must be already initialized with at least one point on the geometries CSO. See minkowski_sum::cso_support_point to compute such point.