From 3ebe7d79722c1bdc333b236960ff136ab607a02c Mon Sep 17 00:00:00 2001 From: vaxerski <43317083+vaxerski@users.noreply.github.com> Date: Sat, 23 Apr 2022 21:47:16 +0200 Subject: Added bezier curves --- src/helpers/BezierCurve.cpp | 55 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 src/helpers/BezierCurve.cpp (limited to 'src/helpers/BezierCurve.cpp') diff --git a/src/helpers/BezierCurve.cpp b/src/helpers/BezierCurve.cpp new file mode 100644 index 00000000..845992bd --- /dev/null +++ b/src/helpers/BezierCurve.cpp @@ -0,0 +1,55 @@ +#include "BezierCurve.hpp" + +void CBezierCurve::setup(std::vector* pVec) { + m_dPoints.clear(); + + 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 100 points for faster lookups + // T -> X ( / 100 ) + for (int i = 0; i < 100; ++i) { + m_aPointsBaked[i] = getXForT((i + 1) / 100.f); + } +} + +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) > 0.01f) { + if (m_aPointsBaked[((int)(mid * 100.f))] > 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)(100.f * lowerX)]) / (m_aPointsBaked[(int)(100.f * upperX)] - m_aPointsBaked[(int)(100.f * lowerX)]); + + if (std::isnan(PERCINDELTA) || std::isinf(PERCINDELTA)) // can sometimes happen for VERY small x + return 0.f; + + return getYForT(mid + PERCINDELTA * 0.01f); +} \ No newline at end of file -- cgit v1.2.3 From ad2c72a79763a441ce98a84c4308be8af454386c Mon Sep 17 00:00:00 2001 From: vaxerski <43317083+vaxerski@users.noreply.github.com> Date: Sat, 23 Apr 2022 23:16:43 +0200 Subject: Bake 200, more info --- src/helpers/BezierCurve.cpp | 32 +++++++++++++++++++++++--------- 1 file changed, 23 insertions(+), 9 deletions(-) (limited to 'src/helpers/BezierCurve.cpp') diff --git a/src/helpers/BezierCurve.cpp b/src/helpers/BezierCurve.cpp index 845992bd..85e71f71 100644 --- a/src/helpers/BezierCurve.cpp +++ b/src/helpers/BezierCurve.cpp @@ -3,6 +3,8 @@ void CBezierCurve::setup(std::vector* pVec) { m_dPoints.clear(); + const auto BEGIN = std::chrono::high_resolution_clock::now(); + m_dPoints.emplace_back(Vector2D(0,0)); for (auto& p : *pVec) { @@ -13,11 +15,23 @@ void CBezierCurve::setup(std::vector* pVec) { RASSERT(m_dPoints.size() == 4, "CBezierCurve only supports cubic beziers! (points num: %i)", m_dPoints.size()); - // bake 100 points for faster lookups - // T -> X ( / 100 ) - for (int i = 0; i < 100; ++i) { - m_aPointsBaked[i] = getXForT((i + 1) / 100.f); + // 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::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::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) { @@ -35,8 +49,8 @@ float CBezierCurve::getYForPoint(float x) { float lowerX = 0; float mid = 0.5; - while(std::abs(upperX - lowerX) > 0.01f) { - if (m_aPointsBaked[((int)(mid * 100.f))] > x) { + while(std::abs(upperX - lowerX) > INVBAKEDPOINTS) { + if (m_aPointsBaked[((int)(mid * (float)BAKEDPOINTS))] > x) { upperX = mid; } else { lowerX = mid; @@ -46,10 +60,10 @@ float CBezierCurve::getYForPoint(float x) { } // in the name of performance i shall make a hack - const auto PERCINDELTA = (x - m_aPointsBaked[(int)(100.f * lowerX)]) / (m_aPointsBaked[(int)(100.f * upperX)] - m_aPointsBaked[(int)(100.f * lowerX)]); + 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 + if (std::isnan(PERCINDELTA) || std::isinf(PERCINDELTA)) // can sometimes happen for VERY small x return 0.f; - return getYForT(mid + PERCINDELTA * 0.01f); + return getYForT(mid + PERCINDELTA * INVBAKEDPOINTS); } \ No newline at end of file -- cgit v1.2.3