1
0
Fork 0
mirror of https://git.coom.tech/drummyfish/raycastlib.git synced 2024-11-20 20:19:57 +01:00
raycastlib/raycastlib.h

246 lines
5.3 KiB
C
Raw Normal View History

2018-08-23 02:46:40 +02:00
#ifndef RAYCASTLIB_H
#define RAYCASTLIB_H
2018-08-21 13:49:45 +02:00
#include <stdint.h>
/**
author: Miloslav "drummyfish" Ciz
license: CC0
- Game field's bottom left corner is at [0,0].
- X axis goes right.
- Y axis goes up.
- Each game square is UNITS_PER_SQUARE * UNITS_PER_SQUARE.
*/
#define UNITS_PER_SQUARE 1024
2018-08-23 00:50:19 +02:00
typedef int32_t Unit; /**< Smallest spatial unit, there is UNITS_PER_SQUARE
2018-08-21 13:49:45 +02:00
units in a square's length. */
/// Position in 2D space.
typedef struct
{
2018-08-23 00:50:19 +02:00
int32_t y;
int32_t x;
2018-08-21 13:49:45 +02:00
} Vector2D;
typedef struct
{
Vector2D start;
Vector2D direction;
} Ray;
2018-08-22 08:21:38 +02:00
typedef struct
{
Vector2D square; ///< Collided square coordinates.
Vector2D position; ///< Exact collision position in Units.
Unit distance; /**< Euclidean distance to the hit position, or -1 if
no collision happened. */
2018-08-23 00:50:19 +02:00
Unit textureCoord; /**< Normalized (0 to UNITS_PER_SQUARE - 1) texture
coordinate. */
2018-08-22 08:21:38 +02:00
} HitResult;
2018-08-23 00:50:19 +02:00
/**
Casts a single ray and returns the first collision result.
@param Ray Ray to be cast.
@param arrayFunc Function that for x and y array coordinates (in squares, NOT
Units) returns a type of square (just a number) - transition
between two squares of different types (values) is considered
a collision).
@param maxSteps Maximum number of steps (in squares) to trace the ray.
@return The first collision result.
*/
HitResult castRay(Ray ray, int16_t (*arrayFunc)(int16_t, int16_t),
uint16_t maxSteps);
2018-08-21 13:49:45 +02:00
2018-08-23 02:36:51 +02:00
/**
Casts a single ray and returns a list of collisions.
*/
void castRayMultiHit(Ray ray, int16_t (*arrayFunc)(int16_t, int16_t),
uint16_t maxSteps, HitResult *hitResults, uint16_t *hitResultsLen,
uint16_t maxHits);
2018-08-21 13:49:45 +02:00
//=============================================================================
// privates
2018-08-23 00:50:19 +02:00
uint16_t sqrtInt(uint32_t value)
{
uint32_t result = 0;
uint32_t a = value;
uint32_t b = 1u << 30;
while (b > a)
b >>= 2;
while (b != 0)
{
if (a >= result + b)
{
a -= result + b;
result = result + 2 * b;
}
b >>= 2;
result >>= 1;
}
return result;
}
Unit dist(Vector2D p1, Vector2D p2)
{
Unit dx = p2.x - p1.x;
Unit dy = p2.y - p1.y;
return sqrtInt(((uint16_t) dx * dx) + ((uint16_t) dy * dy));
}
2018-08-21 13:49:45 +02:00
int8_t pointIsLeftOfRay(Vector2D point, Ray ray)
{
int dX = point.x - ray.start.x;
int dY = point.y - ray.start.y;
return (ray.direction.x * dY - ray.direction.y * dX) > 0;
// ^ Z component of cross-product
}
/**
2018-08-22 08:21:38 +02:00
Casts a ray within a single square, to collide with the square borders.
2018-08-21 13:49:45 +02:00
*/
2018-08-22 08:21:38 +02:00
void castRaySquare(Ray localRay, Vector2D *nextCellOffset,
2018-08-21 13:49:45 +02:00
Vector2D *collisionPointOffset)
{
nextCellOffset->x = 0;
nextCellOffset->y = 0;
2018-08-22 08:21:38 +02:00
Ray criticalLine = localRay;
2018-08-21 13:49:45 +02:00
#define helper(c1,c2,n)\
{\
nextCellOffset->c1 = n;\
2018-08-22 08:21:38 +02:00
collisionPointOffset->c1 = criticalLine.start.c1 - localRay.start.c1;\
2018-08-21 13:49:45 +02:00
collisionPointOffset->c2 =\
2018-08-22 08:21:38 +02:00
(collisionPointOffset->c1 * localRay.direction.c2) /\
(localRay.direction.c1 == 0 ? 1 : localRay.direction.c1);\
2018-08-21 13:49:45 +02:00
}
#define helper2(n1,n2,c)\
2018-08-22 08:21:38 +02:00
if (pointIsLeftOfRay(localRay.start,criticalLine) == c)\
2018-08-21 13:49:45 +02:00
helper(y,x,n1)\
else\
helper(x,y,n2)
2018-08-22 08:21:38 +02:00
if (localRay.direction.x > 0)
2018-08-21 13:49:45 +02:00
{
2018-08-22 08:21:38 +02:00
criticalLine.start.x = UNITS_PER_SQUARE;
2018-08-21 13:49:45 +02:00
2018-08-22 08:21:38 +02:00
if (localRay.direction.y > 0)
2018-08-21 13:49:45 +02:00
{
// top right
2018-08-22 08:21:38 +02:00
criticalLine.start.y = UNITS_PER_SQUARE;
2018-08-21 13:49:45 +02:00
helper2(1,1,1)
}
else
{
// bottom right
2018-08-22 08:21:38 +02:00
criticalLine.start.y = -1;
2018-08-21 13:49:45 +02:00
helper2(-1,1,0)
}
}
else
{
2018-08-22 08:21:38 +02:00
criticalLine.start.x = -1;
2018-08-21 13:49:45 +02:00
2018-08-22 08:21:38 +02:00
if (localRay.direction.y > 0)
2018-08-21 13:49:45 +02:00
{
// top left
2018-08-22 08:21:38 +02:00
criticalLine.start.y = UNITS_PER_SQUARE;
2018-08-21 13:49:45 +02:00
helper2(1,-1,0)
}
else
{
// bottom left
2018-08-22 08:21:38 +02:00
criticalLine.start.y = -1;
2018-08-21 13:49:45 +02:00
helper2(-1,-1,1)
}
}
#undef helper2
#undef helper
}
2018-08-23 02:36:51 +02:00
void castRayMultiHit(Ray ray, int16_t (*arrayFunc)(int16_t, int16_t),
uint16_t maxSteps, HitResult *hitResults, uint16_t *hitResultsLen,
uint16_t maxHits)
2018-08-22 08:21:38 +02:00
{
2018-08-23 00:50:19 +02:00
Vector2D initialPos = ray.start;
2018-08-23 02:36:51 +02:00
Vector2D currentPos = ray.start;
Vector2D currentSquare;
2018-08-23 00:50:19 +02:00
2018-08-23 02:36:51 +02:00
currentSquare.x = ray.start.x / UNITS_PER_SQUARE;
currentSquare.y = ray.start.y / UNITS_PER_SQUARE;
2018-08-22 08:21:38 +02:00
2018-08-23 02:36:51 +02:00
*hitResultsLen = 0;
int16_t squareType = arrayFunc(currentSquare.x,currentSquare.y);
2018-08-23 00:50:19 +02:00
2018-08-22 08:21:38 +02:00
for (uint16_t i = 0; i < maxSteps; ++i)
{
2018-08-23 02:36:51 +02:00
int16_t currentType = arrayFunc(currentSquare.x,currentSquare.y);
if (currentType != squareType)
2018-08-23 00:50:19 +02:00
{
2018-08-23 02:36:51 +02:00
// collision
HitResult h;
2018-08-23 00:50:19 +02:00
2018-08-23 02:36:51 +02:00
h.position = currentPos;
h.square = currentSquare;
h.distance = dist(initialPos,currentPos);
hitResults[*hitResultsLen] = h;
*hitResultsLen += 1;
squareType = currentType;
if (*hitResultsLen >= maxHits)
break;
2018-08-23 00:50:19 +02:00
}
2018-08-23 02:36:51 +02:00
ray.start.x = currentPos.x % UNITS_PER_SQUARE;
ray.start.y = currentPos.y % UNITS_PER_SQUARE;
2018-08-22 08:21:38 +02:00
Vector2D no, co;
castRaySquare(ray,&no,&co);
2018-08-23 02:36:51 +02:00
currentSquare.x += no.x;
currentSquare.y += no.y;
2018-08-22 08:21:38 +02:00
2018-08-23 02:36:51 +02:00
currentPos.x += co.x;
currentPos.y += co.y;
2018-08-22 08:21:38 +02:00
}
2018-08-23 02:36:51 +02:00
}
HitResult castRay(Ray ray, int16_t (*arrayFunc)(int16_t, int16_t),
uint16_t maxSteps)
{
HitResult result;
uint16_t len;
castRayMultiHit(ray,arrayFunc,maxSteps,&result,&len,1);
if (len == 0)
result.distance = -1;
2018-08-22 08:21:38 +02:00
return result;
}
2018-08-23 02:46:40 +02:00
#endif