Skip to content

Commit

Permalink
Adjust README
Browse files Browse the repository at this point in the history
  • Loading branch information
notgiven688 committed Nov 22, 2024
1 parent 7bb8f02 commit ec27d9d
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down

0 comments on commit ec27d9d

Please sign in to comment.