Geometric Algorithms implemented for Java Processing v3
-
Updated
Jun 12, 2022 - Processing
Geometric Algorithms implemented for Java Processing v3
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
Robust and simple implementation of the Gilbert-Johnson-Keerthi (GJK) distance and the Expanding Polytope Algorithm (EPA)
Fast and robust GJK algorithm for real-time collision detection
C# implementation of GJK and EPA algorithms for 3D collision detection, intersection point and output vector calculation. Fast and stable, with minimal external references.
Deterministic collision system written in C#
Asteroid game minimal working physics using GJK Algorithm on Java Processing v3.5
Very simple and small Rockfall 3D engine based on OpenTK library to demonstrate how GJKEPA library works. Written in pure C#, with minimum external references.
This project aims at creating a realtime physics engine to be used in games
A basic implementation of the GJK algorithm using Raylib rendering
Go module closest provides you calculating the closest points of two convex hulls.
SGJK is a C++11 library for collision detection using the Gilbert-Johnson-Kirti (GJK) algorithm. This library allows you to detect collisions between convex shapes in both 2D and 3D spaces.
A simple rigid body engine written in OpenGL
Implementation of GJK (3D) algorithm in Unity (C#)
Игровой движок
Add a description, image, and links to the gjk-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the gjk-algorithm topic, visit your repo's landing page and select "manage topics."