Added comment for clarity in pixel perfect collision detection

Author: Penaz91

dynamic_listings/C++/default/collisiondetection/pixel_perfect.cpp

@@ -30,9 +30,11 @@ bool pixel_perfect_collision(Sprite A, Sprite B){
     int y1 = std::max(A.y, B.y);
     int y2 = std::min((A.y + A.height), (B.y + B.height));
 
-    // For each pixes in the intersecting rectangle, let's check
+    // For each pixel in the intersecting rectangle, let's check
     for (int y=y1; y < y2; y++){
         for (int x=x1; x < x2; x++){
+            // We're working in the intersecting triangle, so we'll need to
+            // rework our coordinates
             Color a = A.bitmask.getColor(x - A.x, y - A.y);
             Color b = B.bitmask.getColor(x - B.x, y - B.y);
             if (a.isWhite() && b.isWhite()){

dynamic_listings/javascript/default/collisiondetection/pixel_perfect.js

@@ -36,9 +36,11 @@ function pixel_perfect_collision(A, B){
     let y1 = max(A.y, B.y);
     let y2 = min((A.y + A.height), (B.y + B.height));
 
-    // For each pixes in the intersecting rectangle, let's check
+    // For each pixel in the intersecting rectangle, let's check
     for (let y = y1; y <= y2; y++){
         for (let x = x1; x <= x2; x++){
+            // We're working in the intersecting triangle, so we'll need to
+            // rework our coordinates
             let a = A.bitmask.getColor(x - A.x, y - A.y);
             let b = B.bitmask.getColor(x - B.x, y - B.y);
 

dynamic_listings/lua/default/collisiondetection/pixel_perfect.lua

@@ -50,9 +50,11 @@ local function pixel_perfect_collision(A, B)
     local y1 = math.max(A.y, B.y)
     local y2 = math.min((A.y + A.height), (B.y + B.height))
 
-    -- For each pixes in the intersecting rectangle, let's check
+    -- For each pixel in the intersecting rectangle, let's check
     for y = y1, y2 do
         for x = x1, x2 do
+            -- We're working in the intersecting triangle, so we'll need to
+            -- rework our coordinates
             local a = A.bitmask.getColor(x - A.x, y - A.y)
             local b = B.bitmask.getColor(x - B.x, y - B.y)
 

dynamic_listings/pseudocode/default/collisiondetection/pixel_perfect.txt

@@ -24,9 +24,11 @@ function pixel_perfect_collision(Sprite A, Sprite B) -> bool{
     int y1 = max(A.y, B.y);
     int y2 = min((A.y + A.height), (B.y + B.height));
 
-    // For each pixes in the intersecting rectangle, let's check
+    // For each pixel in the intersecting rectangle, let's check
     for (each y from y1 to y2){
         for (each x from x1 to x2){
+            // We're working in the intersecting rectangle, so we'll need to
+            // rework our coordinates
             a = A.bitmask.getColor(x - A.x, y - A.y);
             b = B.bitmask.getColor(x - B.x, y - B.y);
 

dynamic_listings/python/default/collisiondetection/pixel_perfect.py

@@ -62,6 +62,8 @@ def pixel_perfect_collision(A: Sprite, B: Sprite) -> bool:
     # For each pixel in the intersecting rectangle, let's check
     for y in range(y1, y2):
         for x in range(x1, x2):
+            # We're working in the intersecting rectangle, so we'll need to
+            # rework our coordinates
             a: Color = A.bitmask.get_color(x - A.x, y - A.y)
             b: Color = B.bitmask.get_color(x - B.x, y - B.y)