From 52d43a63d02e973f28aa30b768eddc042a4f155b Mon Sep 17 00:00:00 2001 From: Matthew Kosarek Date: Sun, 27 Jun 2021 15:24:07 -0400 Subject: Some minor updates to SAT explanation, and made icons work everywhere --- 2d/_collisions/polygon_polygon.html.content | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) (limited to '2d/_collisions/polygon_polygon.html.content') diff --git a/2d/_collisions/polygon_polygon.html.content b/2d/_collisions/polygon_polygon.html.content index 7f29ae0..29c284d 100644 --- a/2d/_collisions/polygon_polygon.html.content +++ b/2d/_collisions/polygon_polygon.html.content @@ -107,13 +107,15 @@
  • If the projections overlap for each edge of both shapes, the shapes are intersecting. Return true.
    • - And that is all there is to finding the intersection between two convex polygons. + And that is all there is to finding the intersection between two convex polygons. Here is the code snippet that does this if you are interested: + + #SNIPPET polygon_polygon/snippet1.cpp

    SAT Collision Resolution

    - Now that we know our objects have intersecting, we want to be able to send them tumbling away from each other to simulate a collision. To do this, we will need to find the following things: + Now that we know our objects have intersected, we want to be able to send them tumbling away from each other to simulate a collision. To do this, we will need to find the following things: