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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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]

Properties

Versions 0.0.0.1, 0.0.0.2, 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:13:18Z

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


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.