Libraries.Game.Collision.Narrowphase.ConvexConvexSimplexSolver

This action finds the closest point on a object to the origin.

This action updates the simplex.

This action saves the closest vertex to the origin inside the "Vector3 v."

This action temporarily stores a vertex on the current simplex that is closest to the origin.

This action compares two object hash codes and returns an integer. The result is larger if this hash code is larger than the object passed as a parameter, smaller, or equal. In this case, -1 means smaller, 0 means equal, and 1 means larger. This action was changed in Quorum 7 to return an integer, instead of a CompareResult object, because the previous implementation was causing efficiency issues.

Example Code

Object o
        Object t
        integer result = o:Compare(t) //1 (larger), 0 (equal), or -1 (smaller)

This action calls the action UpdateClosestVectorAndPoints and stores two different points temporarily to be used later. These two points can be anything that you know you will need later.

This action returns whether you have a simplex currently or not.

This action determines if two objects are equal based on their hash code values.

Example Code

use Libraries.Language.Object
        use Libraries.Language.Types.Text
        Object o
        Text t
        boolean result = o:Equals(t)

This action returns whether you have a tetrahedron as your current simplex.

This action returns whether you have a simplex currently or not.

This action tests whether a vertex is inside the current simplex.

This action returns the maximum distance from the origin to a vertex in the simplex.

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode()

This action updates the simplex.

This action returns the number of vertices there is in a simplex.

This action returns the number of vertices there is in a simplex.

This action calls the action UpdateClosestVectorAndPoints and stores two different points temporarily to be used later. These two points can be anything that you know you will need later.

This action sets the number of vertices there is in a simplex.

This action tests whether a vertex is inside the current simplex.

if they are on opposite sides of the pla

This action returns the maximum distance from the origin to a vertex in the simplex.

This action updates the vertex on the current simplex that is closest to the origin and also updates the closest point from the current simplex to the origin.

This action ignores the vertices that are unused inside a ConvexConvesSubSimplexClosestResult class, which can hold up to 4 vertices.

This action removes a vertex from a simplex (which is the umbrella term for a point, a line, a triangle, or a tetrahedron).

This action resets the ConvexConvexSimplexSolver.

This action saves the closest vertex to the origin inside the "Vector3 v."

This action returns whether you have a tetrahedron as your current simplex.

if they are both on the pla

This action temporarily stores a vertex on the current simplex that is closest to the origin.

This action resets the ConvexConvexSimplexSolver.

This action ignores the vertices that are unused inside a ConvexConvesSubSimplexClosestResult class, which can hold up to 4 vertices.

This action sets the number of vertices there is in a simplex.

This action updates the vertex on the current simplex that is closest to the origin and also updates the closest point from the current simplex to the origin.