closest

Go module closest provides calculating the closest points of two convex hulls. You get the distance or the depth between them in passing. This uses Gilbert-Johnson-Keerthi (GJK) algorithm and Expanding Polytope Algorithm (EPA).

Prerequisites

• Go: 1.18+.

Installation

Simply append the following import to your code, and then go [build|run|test] will automatically fetch the necessary dependencies:

import "github.com/trajectoryjp/closest_go"

Contribution

You are very welcome to:

• Create pull requests of any kind
• Let me know if you are using this library and find it useful
• Open issues with request for support because they will help you and many others