From ec27d9df0a5d4380dab3a55beca4a6a505aa8786 Mon Sep 17 00:00:00 2001 From: notgiven688 Date: Fri, 22 Nov 2024 11:42:58 +0100 Subject: [PATCH] Adjust README --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 5d35a4c..9b8d8ac 100644 --- a/README.md +++ b/README.md @@ -9,7 +9,7 @@ The demo is written in C#, with [OpenTK](https://github.com/opentk/opentk) as on The implementation itself is contained in [UEPA.cs](src/UEPA.cs) with ~400 lines of code. The algorithm detects whether two convex objects are separated or colliding and returns the points of closest distance and deepest penetration, respectively. -A variant of the expanding polytope algorithm is used also for the separating case - simplifying +The expanding polytope algorithm is used also for the separating case - simplifying the algorithm for collision detection for the general case. ## Run the demo