Max/nunuhara_xsystem4
1
0
Fork 0
mirror of https://github.com/nunuhara/xsystem4.git synced 2026-10-04 21:07:56 +03:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #33 from kichikuou/bezier

Browse Source 
Implement Math.BezierCurve
This commit is contained in:
Nunuhara Cabbage
2021-06-12 23:34:02 -07:00
committed by GitHub
parent 14018b62eb 09adefe478
commit efdcd5d898
1 changed files with 25 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/hll/Math.c
+25 -2
View File
@@ -17,12 +17,14 @@
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <cglm/cglm.h>
#ifndef M_PI
#define M_PI (3.14159265358979323846)
#endif
#include "hll.h"
#include "vm/page.h"
struct shuffle_table {
int id;
@@ -150,11 +152,31 @@ static int Math_RandTable(int num)
//void Math_RandTable2Init(int num, struct page *array);
//int Math_RandTable2(int num);
int Math_Ceil(float f)
static int Math_Ceil(float f)
{
return (int)ceilf(f);
}
static bool Math_BezierCurve(struct page **x_array, struct page **y_array, int num, float t, int *result_x, int *result_y)
{
vec2 *coeffs = xmalloc(num * sizeof(vec2));
for (int i = 0; i < num; i++) {
coeffs[i][0] = (*x_array)->values[i].i;
coeffs[i][1] = (*y_array)->values[i].i;
}
// De Casteljau's algorithm.
for (; num > 1; num--) {
for (int i = 0; i < num - 1; i++)
glm_vec2_lerp(coeffs[i], coeffs[i + 1], t, coeffs[i]);
}
*result_x = coeffs[0][0];
*result_y = coeffs[0][1];
free(coeffs);
return true;
}
HLL_LIBRARY(Math,
HLL_EXPORT(Cos, Math_Cos),
HLL_EXPORT(Sin, Math_Sin),
@@ -181,5 +203,6 @@ HLL_LIBRARY(Math,
HLL_EXPORT(SwapF, Math_SwapF),
HLL_EXPORT(Log, logf),
HLL_EXPORT(Log10, log10f),
HLL_EXPORT(Ceil, Math_Ceil));
HLL_EXPORT(Ceil, Math_Ceil),
HLL_EXPORT(BezierCurve, Math_BezierCurve));