SMathUtil.ts 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  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. import { MinDis } from "../types/MinDis";
  28. import { Point } from "@persagy-web/graph";
  29. import { PointToLine } from "../types/PointToLine";
  30. import { Outline } from "../types/Outline";
  31. // @ts-ignore
  32. import { intersect } from "polybooljs";
  33. export class SMathUtil {
  34. /**
  35. * 计算点到点距离
  36. *
  37. * @return 距离
  38. * @param x1
  39. * @param y1
  40. * @param x2
  41. * @param y2
  42. */
  43. static pointDistance(
  44. x1: number,
  45. y1: number,
  46. x2: number,
  47. y2: number
  48. ): number {
  49. return Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
  50. } // Function pointDistance()
  51. /**
  52. * 计算点到点集中点最小距离,返回该点和该距离
  53. *
  54. * @param p 第一个点
  55. * @param arr 点集
  56. * @return 距离,点坐标
  57. */
  58. static getMinDisPoint(p: SPoint, arr: Point[]): MinDis | null {
  59. if (!arr.length) {
  60. return null;
  61. }
  62. let minDis = {
  63. // @ts-ignore
  64. MinDis: SMathUtil.pointDistance(
  65. p.x,
  66. p.y,
  67. // @ts-ignore
  68. arr[0].X || arr[0].x,
  69. // @ts-ignore
  70. -arr[0].Y || -arr[0].y
  71. ),
  72. Point: arr[0]
  73. };
  74. for (let i = 1; i < arr.length; i++) {
  75. let ds = SMathUtil.pointDistance(
  76. p.x,
  77. p.y,
  78. // @ts-ignore
  79. arr[i].X || arr[i].x,
  80. // @ts-ignore
  81. -arr[i].Y || -arr[i].y
  82. );
  83. if (ds < minDis.MinDis) {
  84. minDis.MinDis = ds;
  85. minDis.Point = arr[i];
  86. }
  87. }
  88. return minDis;
  89. } // Function getMinDisPoint()
  90. /**
  91. * 计算点到线段垂线与线段的交点
  92. *
  93. * @param p 点
  94. * @param l 线段
  95. * @return 距离
  96. */
  97. static pointToLine(p: SPoint, l: SLine): PointToLine {
  98. let d = {
  99. MinDis: Number.MAX_SAFE_INTEGER,
  100. Line: new SLine(),
  101. Point: new SPoint()
  102. };
  103. let bgX = Math.max(l.x1, l.x2);
  104. let smX = Math.min(l.x1, l.x2);
  105. if (l.dx == 0) {
  106. // l.dx为0 说明线段是垂直于x轴的
  107. let bgY = Math.max(l.y1, l.y2);
  108. let smY = Math.min(l.y1, l.y2);
  109. if (p.y > smY && p.y < bgY) {
  110. d.MinDis = Math.abs(p.x - l.x1);
  111. d.Line = l;
  112. d.Point = new SPoint(l.x1, p.y);
  113. }
  114. } else if (l.dy == 0) {
  115. // l.dy为0 说明线段是平行于x轴的
  116. if (p.x > smX && p.x < bgX) {
  117. d.MinDis = Math.abs(p.y - l.y1);
  118. d.Line = l;
  119. d.Point = new SPoint(p.x, l.y1);
  120. }
  121. } else {
  122. // 直线1
  123. let k1 = (l.y1 - l.y2) / (l.x1 - l.x2);
  124. let b1 = l.y1 - k1 * l.x1;
  125. // 直线2
  126. let k2 = -1 / k1;
  127. let b2 = p.y - k2 * p.x;
  128. // 交点
  129. let x = (b1 - b2) / (k2 - k1);
  130. let y = k1 * x + b1;
  131. if (x > smX && x < bgX) {
  132. d.MinDis = SMathUtil.pointDistance(p.x, p.y, x, y);
  133. d.Line = l;
  134. d.Point = new SPoint(x, y);
  135. }
  136. }
  137. return d;
  138. } // Function pointDistance()
  139. /**
  140. * 计算点到点集中线段最小距离,返回该点和该距离
  141. *
  142. * @param p 第一个点
  143. * @param arr 点集
  144. * @return 距离,点坐标
  145. */
  146. static getMinDisLine(p: SPoint, arr: Point[]): PointToLine | null {
  147. if (arr.length < 2) {
  148. return null;
  149. }
  150. let PTL = SMathUtil.pointToLine(
  151. p,
  152. new SLine(
  153. // @ts-ignore
  154. arr[arr.length - 1].X || arr[arr.length - 1].x,
  155. // @ts-ignore
  156. -arr[arr.length - 1].Y || -arr[arr.length - 1].y,
  157. // @ts-ignore
  158. arr[0].X || arr[0].x,
  159. // @ts-ignore
  160. -arr[0].Y || -arr[0].y
  161. )
  162. );
  163. for (let i = 0; i < arr.length - 1; i++) {
  164. let temp = SMathUtil.pointToLine(
  165. p,
  166. new SLine(
  167. // @ts-ignore
  168. arr[i].X || arr[i].x,
  169. // @ts-ignore
  170. -arr[i].Y || -arr[i].y,
  171. // @ts-ignore
  172. arr[i + 1].X || arr[i + 1].x,
  173. // @ts-ignore
  174. -arr[i + 1].Y || -arr[i + 1].y
  175. )
  176. );
  177. if (temp.MinDis < PTL.MinDis) {
  178. PTL = temp;
  179. }
  180. }
  181. return PTL;
  182. } // Function getMinDisPoint()
  183. /**
  184. * 计算矩形是否有交集(外包矩形算法)
  185. *
  186. * @param rect1 矩形1
  187. * @param rect2 矩形2
  188. * @return boolean
  189. * */
  190. static rectIntersection(rect1: SRect, rect2: SRect): boolean {
  191. let minX = rect1.x < rect2.x ? rect1.x : rect2.x;
  192. let minY = rect1.y < rect2.y ? rect1.y : rect2.y;
  193. let maxX = rect1.right > rect2.right ? rect1.right : rect2.right;
  194. let maxY = rect1.bottom > rect2.bottom ? rect2.bottom : rect2.bottom;
  195. return (
  196. rect1.width + rect2.width > maxX - minX &&
  197. rect1.height + rect2.height > maxY - minY
  198. );
  199. } // Function rectIntersection()
  200. /**
  201. * 计算线段交点
  202. *
  203. * @param line1 线段1
  204. * @param line2 线段2
  205. * @return SPoint 交点 null 平行但不重合 'repeat' 重合
  206. */
  207. static lineIntersection(
  208. line1: SLine,
  209. line2: SLine
  210. ): SPoint | null | string {
  211. let k1 = line1.dy / line1.dx;
  212. let b1 = line1.y1 - k1 * line1.x1;
  213. let k2 = line2.dy / line2.dx;
  214. let b2 = line2.y1 - k2 * line2.x1;
  215. if (k1 == k2) {
  216. if (b1 == b2) {
  217. return "repeat";
  218. }
  219. return null;
  220. }
  221. let intersectionX = (b2 - b1) / (k1 - k2);
  222. let intersectionY = k1 * intersectionX + b1;
  223. let minX = Math.min(line1.x1, line1.x2);
  224. let maxX = Math.min(line2.x1, line2.x2);
  225. if (intersectionX >= minX && intersectionX <= maxX) {
  226. return new SPoint(intersectionX, intersectionY);
  227. }
  228. return null;
  229. } // Function lineIntersection()
  230. /**
  231. * 转化数据格式为[][]
  232. *
  233. * @param SP SPoint[]
  234. * @return Arr number[][]
  235. */
  236. static transferToArray(SP: SPoint[]): number[][] {
  237. return SP.map((t): number[] => {
  238. return [t.x, t.y];
  239. });
  240. } // Function transferToArray()
  241. /**
  242. * 转化数据格式为SPoint[]
  243. *
  244. * @param arr number[][]
  245. * @return SP SPoint[]
  246. */
  247. static transferToSPoint(arr: number[][]): SPoint[] {
  248. return arr.map(
  249. (t): SPoint => {
  250. return new SPoint(t[0], t[1]);
  251. }
  252. );
  253. } // Function transferToSPoint()
  254. /**
  255. * 计算数组中每一项的交集,并返回外轮廓与内轮廓
  256. *
  257. */
  258. static getIntersectInArray(array: number[][][]): Outline[] {
  259. let outlineList: Outline[] = [];
  260. if (!array.length) {
  261. // 无数据不做处理
  262. } else if (array.length == 1) {
  263. // 只有一条则为外轮廓
  264. let outline: Outline = {
  265. Outer: [],
  266. Inner: []
  267. };
  268. outline.Outer = array[0].map(
  269. (t): SPoint => {
  270. return new SPoint(t[0], t[1]);
  271. }
  272. );
  273. outlineList.push(outline);
  274. } else {
  275. // 多条的时候,最后一条未外轮廓,倒序遍历与之相交的为内轮廓,不相交为另外的外轮廓
  276. let poly2 = {
  277. regions: [],
  278. inverted: false
  279. };
  280. // @ts-ignore
  281. poly2.regions.push(array[array.length - 1]);
  282. let indexArr: number[] = [array.length - 1];
  283. for (let i = array.length - 2; i > 0; i--) {
  284. let poly1 = {
  285. regions: [],
  286. inverted: false
  287. };
  288. // @ts-ignore
  289. poly1.regions.push(array[i]);
  290. let intersectObj = intersect(poly1, poly2);
  291. console.log(intersectObj);
  292. if (!intersectObj.regions.length) {
  293. indexArr.unshift(i);
  294. poly2.regions = [];
  295. // @ts-ignore
  296. poly2.regions.push(array[i]);
  297. }
  298. }
  299. indexArr.unshift(0);
  300. console.log(indexArr);
  301. for (let i = 0; i < indexArr.length - 1; i++) {
  302. let axArr = array.slice(
  303. i == 0 ? 0 : indexArr[i] + 1,
  304. indexArr[i + 1]
  305. );
  306. let outline: Outline = {
  307. Outer: [],
  308. Inner: []
  309. };
  310. outline.Outer = array[indexArr[i + 1]].map(
  311. (t): SPoint => {
  312. return new SPoint(t[0], t[1]);
  313. }
  314. );
  315. outline.Inner = axArr.map((t): SPoint[] => {
  316. return t.map(
  317. (item): SPoint => {
  318. return new SPoint(item[0], item[1]);
  319. }
  320. );
  321. });
  322. outlineList.push(outline);
  323. }
  324. }
  325. console.log(outlineList);
  326. return outlineList;
  327. } // Function getIntersectInArray()
  328. /**
  329. * 计算轮廓线面积
  330. * */
  331. static calculateArea(arr: SPoint[]): number {
  332. let sum = 0;
  333. let n = arr.length;
  334. arr[n] = arr[0];
  335. for (let i = 1; i <= n; i++) {
  336. sum += arr[i].x * arr[i - 1].y - arr[i - 1].x * arr[i].y;
  337. }
  338. return sum / 2;
  339. } // Function calculateArea()
  340. } // Class SMathUtil