summaryrefslogtreecommitdiff
path: root/src/helpers/BezierCurve.cpp
diff options
context:
space:
mode:
authorvaxerski <43317083+vaxerski@users.noreply.github.com>2022-04-24 11:22:44 +0200
committerGitHub <noreply@github.com>2022-04-24 11:22:44 +0200
commit6679a4786b593cbe5050931261566fab9aa77f1f (patch)
treea090b5c34cb75d4328c79f587018457a5e589c0a /src/helpers/BezierCurve.cpp
parentfc14157d765ce44e634525b2c437808e20ec93d6 (diff)
parent1afc8329bc4438c3e2f8c3dda9a6743ce5ef7a3a (diff)
Merge pull request #55 from vaxerski/animation-system-rework
Animation system rework
Diffstat (limited to 'src/helpers/BezierCurve.cpp')
-rw-r--r--src/helpers/BezierCurve.cpp69
1 files changed, 69 insertions, 0 deletions
diff --git a/src/helpers/BezierCurve.cpp b/src/helpers/BezierCurve.cpp
new file mode 100644
index 00000000..85e71f71
--- /dev/null
+++ b/src/helpers/BezierCurve.cpp
@@ -0,0 +1,69 @@
+#include "BezierCurve.hpp"
+
+void CBezierCurve::setup(std::vector<Vector2D>* pVec) {
+ m_dPoints.clear();
+
+ const auto BEGIN = std::chrono::high_resolution_clock::now();
+
+ m_dPoints.emplace_back(Vector2D(0,0));
+
+ for (auto& p : *pVec) {
+ m_dPoints.push_back(p);
+ }
+
+ m_dPoints.emplace_back(Vector2D(1,1));
+
+ RASSERT(m_dPoints.size() == 4, "CBezierCurve only supports cubic beziers! (points num: %i)", m_dPoints.size());
+
+ // bake BAKEDPOINTS points for faster lookups
+ // T -> X ( / BAKEDPOINTS )
+ for (int i = 0; i < BAKEDPOINTS; ++i) {
+ m_aPointsBaked[i] = getXForT((i + 1) / (float)BAKEDPOINTS);
+ }
+
+ const auto ELAPSEDUS = std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::high_resolution_clock::now() - BEGIN).count() / 1000.f;
+ const auto POINTSSIZE = m_aPointsBaked.size() * sizeof(m_aPointsBaked[0]) / 1000.f;
+
+ const auto BEGINCALC = std::chrono::high_resolution_clock::now();
+ for (float i = 0.1f; i < 1.f; i += 0.1f)
+ getYForPoint(i);
+ const auto ELAPSEDCALCAVG = std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::high_resolution_clock::now() - BEGINCALC).count() / 1000.f / 10.f;
+
+ Debug::log(LOG, "Created a bezier curve, baked %i points, mem usage: %.2fkB, time to bake: %.2fµs. Estimated average calc time: %.2fµs.",
+ BAKEDPOINTS, POINTSSIZE, ELAPSEDUS, ELAPSEDCALCAVG);
+
+}
+
+float CBezierCurve::getYForT(float t) {
+ return 3 * t * pow(1 - t, 2) * m_dPoints[1].y + 3 * pow(t, 2) * (1 - t) * m_dPoints[2].y + pow(t, 3);
+}
+
+float CBezierCurve::getXForT(float t) {
+ return 3 * t * pow(1 - t, 2) * m_dPoints[1].x + 3 * pow(t, 2) * (1 - t) * m_dPoints[2].x + pow(t, 3);
+}
+
+// Todo: this probably can be done better and faster
+float CBezierCurve::getYForPoint(float x) {
+ // binary search for the range UPDOWN X
+ float upperX = 1;
+ float lowerX = 0;
+ float mid = 0.5;
+
+ while(std::abs(upperX - lowerX) > INVBAKEDPOINTS) {
+ if (m_aPointsBaked[((int)(mid * (float)BAKEDPOINTS))] > x) {
+ upperX = mid;
+ } else {
+ lowerX = mid;
+ }
+
+ mid = (upperX + lowerX) / 2.f;
+ }
+
+ // in the name of performance i shall make a hack
+ const auto PERCINDELTA = (x - m_aPointsBaked[(int)((float)BAKEDPOINTS * lowerX)]) / (m_aPointsBaked[(int)((float)BAKEDPOINTS * upperX)] - m_aPointsBaked[(int)((float)BAKEDPOINTS * lowerX)]);
+
+ if (std::isnan(PERCINDELTA) || std::isinf(PERCINDELTA)) // can sometimes happen for VERY small x
+ return 0.f;
+
+ return getYForT(mid + PERCINDELTA * INVBAKEDPOINTS);
+} \ No newline at end of file