CableCurve.cs 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233
  1. /// Credit Farfarer
  2. /// Sourced from - https://gist.github.com/Farfarer/a765cd07920d48a8713a0c1924db6d70
  3. /// Updated for UI / 2D - SimonDarksideJ
  4. using System;
  5. using System.Collections.Generic;
  6. namespace UnityEngine.UI.Extensions
  7. {
  8. [System.Serializable]
  9. public class CableCurve
  10. {
  11. [SerializeField]
  12. Vector2 m_start;
  13. [SerializeField]
  14. Vector2 m_end;
  15. [SerializeField]
  16. float m_slack;
  17. [SerializeField]
  18. int m_steps;
  19. [SerializeField]
  20. bool m_regen;
  21. static Vector2[] emptyCurve = new Vector2[] { new Vector2(0.0f, 0.0f), new Vector2(0.0f, 0.0f) };
  22. [SerializeField]
  23. Vector2[] points;
  24. public bool regenPoints
  25. {
  26. get { return m_regen; }
  27. set
  28. {
  29. m_regen = value;
  30. }
  31. }
  32. public Vector2 start
  33. {
  34. get { return m_start; }
  35. set
  36. {
  37. if (value != m_start)
  38. m_regen = true;
  39. m_start = value;
  40. }
  41. }
  42. public Vector2 end
  43. {
  44. get { return m_end; }
  45. set
  46. {
  47. if (value != m_end)
  48. m_regen = true;
  49. m_end = value;
  50. }
  51. }
  52. public float slack
  53. {
  54. get { return m_slack; }
  55. set
  56. {
  57. if (value != m_slack)
  58. m_regen = true;
  59. m_slack = Mathf.Max(0.0f, value);
  60. }
  61. }
  62. public int steps
  63. {
  64. get { return m_steps; }
  65. set
  66. {
  67. if (value != m_steps)
  68. m_regen = true;
  69. m_steps = Mathf.Max(2, value);
  70. }
  71. }
  72. public Vector2 midPoint
  73. {
  74. get
  75. {
  76. Vector2 mid = Vector2.zero;
  77. if (m_steps == 2)
  78. {
  79. return (points[0] + points[1]) * 0.5f;
  80. }
  81. else if (m_steps > 2)
  82. {
  83. int m = m_steps / 2;
  84. if ((m_steps % 2) == 0)
  85. {
  86. mid = (points[m] + points[m + 1]) * 0.5f;
  87. }
  88. else
  89. {
  90. mid = points[m];
  91. }
  92. }
  93. return mid;
  94. }
  95. }
  96. public CableCurve()
  97. {
  98. points = emptyCurve;
  99. m_start = Vector2.up;
  100. m_end = Vector2.up + Vector2.right;
  101. m_slack = 0.5f;
  102. m_steps = 20;
  103. m_regen = true;
  104. }
  105. public CableCurve(Vector2[] inputPoints)
  106. {
  107. points = inputPoints;
  108. m_start = inputPoints[0];
  109. m_end = inputPoints[1];
  110. m_slack = 0.5f;
  111. m_steps = 20;
  112. m_regen = true;
  113. }
  114. public CableCurve(List<Vector2> inputPoints)
  115. {
  116. points = inputPoints.ToArray();
  117. m_start = inputPoints[0];
  118. m_end = inputPoints[1];
  119. m_slack = 0.5f;
  120. m_steps = 20;
  121. m_regen = true;
  122. }
  123. public CableCurve(CableCurve v)
  124. {
  125. points = v.Points();
  126. m_start = v.start;
  127. m_end = v.end;
  128. m_slack = v.slack;
  129. m_steps = v.steps;
  130. m_regen = v.regenPoints;
  131. }
  132. public Vector2[] Points()
  133. {
  134. if (!m_regen)
  135. return points;
  136. if (m_steps < 2)
  137. return emptyCurve;
  138. float lineDist = Vector2.Distance(m_end, m_start);
  139. float lineDistH = Vector2.Distance(new Vector2(m_end.x, m_start.y), m_start);
  140. float l = lineDist + Mathf.Max(0.0001f, m_slack);
  141. float r = 0.0f;
  142. float s = m_start.y;
  143. float u = lineDistH;
  144. float v = end.y;
  145. if ((u - r) == 0.0f)
  146. return emptyCurve;
  147. float ztarget = Mathf.Sqrt(Mathf.Pow(l, 2.0f) - Mathf.Pow(v - s, 2.0f)) / (u - r);
  148. int loops = 30;
  149. int iterationCount = 0;
  150. int maxIterations = loops * 10; // For safety.
  151. bool found = false;
  152. float z = 0.0f;
  153. float ztest = 0.0f;
  154. float zstep = 100.0f;
  155. float ztesttarget = 0.0f;
  156. for (int i = 0; i < loops; i++)
  157. {
  158. for (int j = 0; j < 10; j++)
  159. {
  160. iterationCount++;
  161. ztest = z + zstep;
  162. ztesttarget = (float)Math.Sinh(ztest) / ztest;
  163. if (float.IsInfinity(ztesttarget))
  164. continue;
  165. if (ztesttarget == ztarget)
  166. {
  167. found = true;
  168. z = ztest;
  169. break;
  170. }
  171. else if (ztesttarget > ztarget)
  172. {
  173. break;
  174. }
  175. else
  176. {
  177. z = ztest;
  178. }
  179. if (iterationCount > maxIterations)
  180. {
  181. found = true;
  182. break;
  183. }
  184. }
  185. if (found)
  186. break;
  187. zstep *= 0.1f;
  188. }
  189. float a = (u - r) / 2.0f / z;
  190. float p = (r + u - a * Mathf.Log((l + v - s) / (l - v + s))) / 2.0f;
  191. float q = (v + s - l * (float)Math.Cosh(z) / (float)Math.Sinh(z)) / 2.0f;
  192. points = new Vector2[m_steps];
  193. float stepsf = m_steps - 1;
  194. float stepf;
  195. for (int i = 0; i < m_steps; i++)
  196. {
  197. stepf = i / stepsf;
  198. Vector2 pos = Vector2.zero;
  199. pos.x = Mathf.Lerp(start.x, end.x, stepf);
  200. pos.y = a * (float)Math.Cosh(((stepf * lineDistH) - p) / a) + q;
  201. points[i] = pos;
  202. }
  203. m_regen = false;
  204. return points;
  205. }
  206. }
  207. }