Libraries.Game.Collision.Narrowphase.ConvexConvexPenetrationSolver

This class contains actions that will help solve how much one shape has penetrated into another shape.

This action builds a polytope that will be used to calculate the direction that we will need to separate the two colliding objects (penetration direction).

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 deletes a face of a polyhedron.

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 finds how much did one object has penetrated into another object.

This action finds how much did one object has penetrated into another object.

This action returns whether if the penetration solver has successfully found a direction that you should push the two objects so that they are not penetrating anymore.

This action returns the face that is closest to a point of interest.

This action finds where the point of interest is relative to a face.

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode()

This action returns how many iterations did this solver run for.

This action returns the vertices that makes up a face of a polyhedron that is closest to the origin.

This action returns the direction that you need to push the two objects away to separate the two objects.

This action links two faces of a polyhedron together.

This action creates a new face using the 3 vertices that is passed in.

This action connects this ConvexConvexPenetrationSolver to a ConvexConvexDistanceSolver.

This action sets up the convex face that is made up of the 3 vertices that you passed in and returning if these 3 vertices can actually make up a face.

This action finds the support for w.