gjk: Gilbert-Johnson-Keerthi (GJK) collision detection algorithm

[ graphics, library, mit ] [ Propose Tags ]

This package implements the Gilbert-Johnson-Keerthi (GJK) collision detection algorithm for 2D convex objects. It is quite efficient, usually converging within one or two iterations.


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0.0.1, 0.0.0.2
Change log CHANGELOG.md
Dependencies base (>=4.9 && <5.0) [details]
License MIT
Author Firas Zaidan
Maintainer firas@zaidan.de
Category Graphics
Home page https://github.com/zaidan/gjk#readme
Bug tracker https://github.com/zaidan/gjk/issues
Source repo head: git clone https://github.com/zaidan/gjk
Uploaded by zaidan at 2020-03-24T16:21:26Z
Distributions NixOS:0.0.0.2
Reverse Dependencies 1 direct, 1 indirect [details]
Downloads 1279 total (11 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-03-24 [all 1 reports]

Readme for gjk-0.0.0.2

[back to package description]

Gilbert-Johnson-Keerthi (GJK) collision detection algorithm

Hackage Build Status

This package implements the Gilbert-Johnson-Keerthi (GJK) collision detection algorithm for 2D convex objects. It is quite efficient, usually converging within one or two iterations.

This project was ported from Elm to Haskell (see zaidan/elm-collision).

Credits

License

See LICENSE file.