summaryrefslogtreecommitdiff
path: root/game/network/network.cpp
diff options
context:
space:
mode:
authorDan Goodliffe <dan@randomdan.homeip.net>2025-05-10 13:00:14 +0100
committerDan Goodliffe <dan@randomdan.homeip.net>2025-05-10 13:00:14 +0100
commitdf0c41c0b29ad2507623e86c78f8113aa8024aa0 (patch)
tree37d168ffd10276b16d39d7127926b277cc3cf2f1 /game/network/network.cpp
parentSimplified genCurveDef for 1 direction (diff)
downloadilt-df0c41c0b29ad2507623e86c78f8113aa8024aa0.tar.bz2
ilt-df0c41c0b29ad2507623e86c78f8113aa8024aa0.tar.xz
ilt-df0c41c0b29ad2507623e86c78f8113aa8024aa0.zip
New genCurveDef for 2 directions
Based on formula/code from https://www.ryanjuckett.com/biarc-interpolation/ Produces smoother curves instead of equal curves. Removes need for that awful formula for finding the radius of said curves which has a tendency to blow up to infinity, and if not that then crazy rounding/accuracy errors.
Diffstat (limited to 'game/network/network.cpp')
-rw-r--r--game/network/network.cpp50
1 files changed, 28 insertions, 22 deletions
diff --git a/game/network/network.cpp b/game/network/network.cpp
index 23d39af..403975c 100644
--- a/game/network/network.cpp
+++ b/game/network/network.cpp
@@ -112,27 +112,33 @@ Network::genCurveDef(const GlobalPosition3D & start, const GlobalPosition3D & en
std::pair<GenCurveDef, GenCurveDef>
Network::genCurveDef(const GlobalPosition3D & start, const GlobalPosition3D & end, float startDir, float endDir)
{
- startDir += pi;
- endDir += pi;
- const auto flatStart {start.xy()}, flatEnd {end.xy()};
- auto midheight = [&](auto mid) {
- const auto startToMid = ::distance<2>(flatStart, mid);
- const auto endToMid = ::distance<2>(flatEnd, mid);
- return start.z + GlobalDistance(RelativeDistance(end.z - start.z) * (startToMid / (startToMid + endToMid)));
- };
- const auto radii = find_arcs_radius(flatStart, startDir, flatEnd, endDir);
- if (radii.first < radii.second) {
- const auto radius = radii.first;
- const auto centre1 = flatStart + (sincos(startDir + half_pi) * radius);
- const auto centre2 = flatEnd + (sincos(endDir + half_pi) * radius);
- const auto mid = (centre1 + centre2) / 2;
- const auto midh = mid || midheight(mid);
- return {{start, midh, centre1}, {end, midh, centre2}};
+ // Based on formula/code from https://www.ryanjuckett.com/biarc-interpolation/
+ const auto startVec = -sincos(startDir);
+ const auto endVec = sincos(endDir);
+ const auto diff = difference(end, start);
+ const auto diffDotStartVec = glm::dot(diff.xy(), startVec);
+ const auto endsVecTotal = (startVec + endVec);
+ const auto tMagSqr = vectorMagSquared(endsVecTotal);
+ const auto equalTangents = isWithinLimit(tMagSqr, 4.0F);
+ const auto perpT1 = isWithinLimit(diffDotStartVec, 0.0F);
+
+ if (equalTangents && perpT1) {
+ const auto joint = start + (diff * 0.5F);
+ return {genCurveDef(start, joint, startDir), genCurveDef(end, joint, endDir)};
}
- const auto radius = radii.second;
- const auto centre1 = flatStart + (sincos(startDir - half_pi) * radius);
- const auto centre2 = flatEnd + (sincos(endDir - half_pi) * radius);
- const auto mid = (centre1 + centre2) / 2;
- const auto midh = mid || midheight(mid);
- return {{midh, start, centre1}, {midh, end, centre2}};
+
+ const auto vDotT = glm::dot(diff.xy(), endsVecTotal);
+ const auto extLen1 = [&]() {
+ const auto vMagSqr = vectorMagSquared(diff);
+ if (equalTangents) {
+ return vMagSqr / (4 * diffDotStartVec);
+ }
+ const auto denominator = 2.F - (2.F * glm::dot(startVec, endVec));
+ const auto discriminant = sq(vDotT) + (denominator * vMagSqr);
+ return (std::sqrt(discriminant) - vDotT) / denominator;
+ }();
+
+ const auto joint = (start + end + ((difference(startVec, endVec) * extLen1) || 0.F)) / 2;
+
+ return {genCurveDef(start, joint, startDir), genCurveDef(end, joint, endDir)};
}