https://github.com/trajectoryjp/closest_go
Go module closest provides you calculating the closest points of two convex hulls.
https://github.com/trajectoryjp/closest_go
closest-points epa epa-algorithm gjk gjk-algorithm go go-lib go-library go-mod go-module go-package golang golang-library golang-module golang-package
Last synced: 5 months ago
JSON representation
Go module closest provides you calculating the closest points of two convex hulls.
- Host: GitHub
- URL: https://github.com/trajectoryjp/closest_go
- Owner: trajectoryjp
- License: mit
- Created: 2024-01-17T07:10:05.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2025-10-03T04:14:47.000Z (8 months ago)
- Last Synced: 2025-10-03T05:25:55.866Z (8 months ago)
- Topics: closest-points, epa, epa-algorithm, gjk, gjk-algorithm, go, go-lib, go-library, go-mod, go-module, go-package, golang, golang-library, golang-module, golang-package
- Language: Go
- Homepage: https://pkg.go.dev/github.com/trajectoryjp/closest_go
- Size: 47.9 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# closest
[](https://pkg.go.dev/github.com/trajectoryjp/closest_go)
[](https://goreportcard.com/report/github.com/trajectoryjp/closest_go)
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](https://go.dev)**: **1.18+**.
## Installation
Simply append the following import to your code, and then `go [build|run|test]`
will automatically fetch the necessary dependencies:
```go
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