SMathUtil.ts 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /*
  2. * *********************************************************************************************************************
  3. *
  4. * !!
  5. * .F88X
  6. * X8888Y
  7. * .}888888N;
  8. * i888888N; .:! .I$WI:
  9. * R888888I .'N88~ i8}+8Y&8"l8i$8>8W~'>W8}8]KW+8IIN"8&
  10. * .R888888I .;N8888~ .X8' "8I.!,/8" !%NY8`"8I8~~8>,88I
  11. * +888888N; .8888888Y "&&8Y.}8,
  12. * ./888888N; .R888888Y .'}~ .>}'.`+> i}! "i' +/' .'i~ !11,.:">, .~]! .i}i
  13. * ~888888%: .I888888l .]88~`1/iY88Ii+1'.R$8$8]"888888888> Y8$ W8E X8E W8888'188Il}Y88$*
  14. * 18888888 E8888881 .]W%8$`R8X'&8%++N8i,8N%N8+l8%` .}8N:.R$RE%N88N%N$K$R 188,FE$8%~Y88I
  15. * .E888888I .i8888888' .:$8I;88+`E8R:/8N,.>881.`$8E/1/]N8X.Y8N`"KF&&FK!'88*."88K./$88%RN888+~
  16. * 8888888I .,N888888~ ~88i"8W,!N8*.I88.}888%F,i$88"F88" 888:E8X.>88!i88>`888*.}Fl1]*}1YKi'
  17. * i888888N' I888Y ]88;/EX*IFKFK88X K8R .l8W 88Y ~88}'88E&%8W.X8N``]88!.$8K .:W8I
  18. * .i888888N; I8Y .&8$ .X88! i881.:%888>I88 ;88] +88+.';;;;:.Y88X 18N.,88l .+88/
  19. * .:R888888I
  20. * .&888888I Copyright (c) 2009-2020. 博锐尚格科技股份有限公司
  21. * ~8888'
  22. * .!88~ All rights reserved.
  23. *
  24. * *********************************************************************************************************************
  25. */
  26. import { SLine, SPoint, SRect } from "@persagy-web/draw";
  27. /**
  28. * 数学计算工具类
  29. *
  30. * @author 郝建龙 <haojianlong@sagacloud.cn>
  31. */
  32. export class SMathUtil {
  33. /**
  34. * 计算点到点距离
  35. *
  36. * @param x1 点 1 的 x 坐标
  37. * @param y1 点 1 的 y 坐标
  38. * @param x2 点 2 的 x 坐标
  39. * @param y2 点 2 的 y 坐标
  40. * @return 距离
  41. */
  42. static pointDistance(
  43. x1: number,
  44. y1: number,
  45. x2: number,
  46. y2: number
  47. ): number {
  48. return Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
  49. }
  50. /**
  51. * 计算矩形是否有交集(外包矩形算法)
  52. *
  53. * @param rect1 矩形 1
  54. * @param rect2 矩形 2
  55. * @return 矩形是否有交集
  56. */
  57. static rectIntersection(rect1: SRect, rect2: SRect): boolean {
  58. let minX = rect1.x < rect2.x ? rect1.x : rect2.x;
  59. let minY = rect1.y < rect2.y ? rect1.y : rect2.y;
  60. let maxX = rect1.right > rect2.right ? rect1.right : rect2.right;
  61. let maxY = rect1.bottom > rect2.bottom ? rect2.bottom : rect2.bottom;
  62. return (
  63. rect1.width + rect2.width > maxX - minX &&
  64. rect1.height + rect2.height > maxY - minY
  65. );
  66. }
  67. /**
  68. * 计算线段交点
  69. *
  70. * @param line1 线段 1
  71. * @param line2 线段 2
  72. * @return 交点 null 平行但不重合 'repeat' 重合
  73. */
  74. static lineIntersection(
  75. line1: SLine,
  76. line2: SLine
  77. ): SPoint | null | string {
  78. let k1 = line1.dy / line1.dx;
  79. let b1 = line1.y1 - k1 * line1.x1;
  80. let k2 = line2.dy / line2.dx;
  81. let b2 = line2.y1 - k2 * line2.x1;
  82. // 斜率是否相等
  83. if (k1 == k2) {
  84. if (b1 == b2) {
  85. return "repeat";
  86. }
  87. return null;
  88. }
  89. let intersectionX = (b2 - b1) / (k1 - k2);
  90. let intersectionY = k1 * intersectionX + b1;
  91. let minX = Math.min(line1.x1, line1.x2);
  92. let maxX = Math.min(line2.x1, line2.x2);
  93. // 交点是否在两条线上
  94. if (intersectionX >= minX && intersectionX <= maxX) {
  95. return new SPoint(intersectionX, intersectionY);
  96. }
  97. return null;
  98. }
  99. /**
  100. * 转化数据格式为[][]
  101. *
  102. * @param sp SPoint 类型点数组
  103. * @return 二维数组类型点数组
  104. */
  105. static transferToArray(sp: SPoint[]): number[][] {
  106. return sp.map((t): number[] => {
  107. return [t.x, t.y];
  108. });
  109. }
  110. /**
  111. * 转化数据格式为 SPoint[]
  112. *
  113. * @param arr 二维数组类型点数组
  114. * @return SPoint 类型点数组
  115. */
  116. static transferToSPoint(arr: number[][]): SPoint[] {
  117. return arr.map(
  118. (t): SPoint => {
  119. return new SPoint(t[0], t[1]);
  120. }
  121. );
  122. }
  123. /**
  124. * 计算轮廓线面积
  125. *
  126. * @param arr 轮廓线数组
  127. * @return 面积
  128. */
  129. static calculateArea(arr: SPoint[]): number {
  130. let sum = 0;
  131. let n = arr.length;
  132. arr[n] = arr[0];
  133. for (let i = 1; i <= n; i++) {
  134. sum += arr[i].x * arr[i - 1].y - arr[i - 1].x * arr[i].y;
  135. }
  136. return sum / 2;
  137. }
  138. }