Browse Source

Check collision point polygon (#2685)

* Update raylib.h

* CheckCollisionPointPolygon()

* typo
pull/2687/head
Jacek 2 years ago
committed by GitHub
parent
commit
aff98d7f2a
No known key found for this signature in database GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 23 additions and 0 deletions
  1. +1
    -0
      src/raylib.h
  2. +22
    -0
      src/rshapes.c

+ 1
- 0
src/raylib.h View File

@ -1213,6 +1213,7 @@ RLAPI bool CheckCollisionCircleRec(Vector2 center, float radius, Rectangle rec);
RLAPI bool CheckCollisionPointRec(Vector2 point, Rectangle rec); // Check if point is inside rectangle
RLAPI bool CheckCollisionPointCircle(Vector2 point, Vector2 center, float radius); // Check if point is inside circle
RLAPI bool CheckCollisionPointTriangle(Vector2 point, Vector2 p1, Vector2 p2, Vector2 p3); // Check if point is inside a triangle
RLAPI bool CheckCollisionPointPolygon(Vector2 point, Vector2* vertices, int verticesCount); // Check if point is within a polygon described by array of vertices
RLAPI bool CheckCollisionLines(Vector2 startPos1, Vector2 endPos1, Vector2 startPos2, Vector2 endPos2, Vector2 *collisionPoint); // Check the collision between two lines defined by two points each, returns collision point by reference
RLAPI bool CheckCollisionPointLine(Vector2 point, Vector2 p1, Vector2 p2, int threshold); // Check if point belongs to line created between two points [p1] and [p2] with defined margin in pixels [threshold]
RLAPI Rectangle GetCollisionRec(Rectangle rec1, Rectangle rec2); // Get collision rectangle for two rectangles collision

+ 22
- 0
src/rshapes.c View File

@ -1631,6 +1631,28 @@ bool CheckCollisionPointTriangle(Vector2 point, Vector2 p1, Vector2 p2, Vector2
return collision;
}
// Check if point is within a polygon described by array of vertices
bool CheckCollisionPointPolygon(Vector2 point, Vector2* vertices, int verticesCount)
{
// http://jeffreythompson.org/collision-detection/poly-point.php
bool collision = false;
if (verticesCount > 2)
{
for (int i = 0; i < verticesCount; i++)
{
Vector2 vc = vertices[i];
Vector2 vn = vertices[i + 1];
if ((((vc.y >= point.y) && (vn.y < point.y)) || ((vc.y < point.y) && (vn.y >= point.y))) &&
(point.x < ((vn.x - vc.x)*(point.y - vc.y)/(vn.y - vc.y) + vc.x))) collision = !collision;
}
}
return collision;
}
// Check collision between two rectangles
bool CheckCollisionRecs(Rectangle rec1, Rectangle rec2)
{

Loading…
Cancel
Save