@visactor/vutils 1.0.24 → 1.0.26

package/cjs/graphics/algorithm/intersect.d.ts

@@ -1,20 +1,68 @@
 import type { IBoundsLike } from '../../data-structure';
 import type { vec2 } from '../../math';
 import type { Point } from './interface';
+/**
+ * 判断直线是否相交，投影法
+ * @param left1
+ * @param right1
+ * @param left2
+ * @param right2
+ */
 export declare function isIntersect(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean;
+/**
+ * 获取直线交点
+ * 不相交返回false，共线返回true，相交返回交点
+ * https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282
+ * @param left1
+ * @param right1
+ * @param left2
+ * @param right2
+ */
 export declare function getIntersectPoint(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean | vec2;
+/**
+ * 获取两个rect的相交部分
+ * 如果有bbox为null，返回null，如果不相交返回{x1: 0, y1: 0, x2: 0, y2: 0}
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */
 export declare function getRectIntersect(bbox1: IBoundsLike | null, bbox2: IBoundsLike | null, format: boolean): IBoundsLike | null;
 export declare enum InnerBBox {
     NONE = 0,
     BBOX1 = 1,
     BBOX2 = 2
 }
+/**
+ * 矩形是否在另一个矩形内部
+ * 返回InnerBBox
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */
 export declare function rectInsideAnotherRect(bbox1: IBoundsLike | null, bbox2: IBoundsLike | null, format: boolean): InnerBBox;
+/**
+ * 两个矩形是否相交
+ * 如果有矩形为null，判断为相交
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */
 export declare function isRectIntersect(bbox1: IBoundsLike | null, bbox2: IBoundsLike | null, format: boolean): boolean;
+/**
+ * 点在box内部
+ * 如果bbox为null返回true
+ * @param point
+ * @param bbox
+ */
 export declare function pointInRect(point: {
     x: number;
     y: number;
 }, bbox: IBoundsLike | null, format: boolean): boolean;
+/**
+ * 逆时针旋转矩阵（从正 x 轴开始，旋转到正 y 轴的方向）
+ * [ cos(θ)  -sin(θ) ]
+ * [ sin(θ)  cos(θ) ]
+ */
 export declare function rotatePoint({ x, y }: Point, rad: number, origin?: {
     x: number;
     y: number;

package/cjs/graphics/algorithm/intersect.js

@@ -4,13 +4,20 @@ Object.defineProperty(exports, "__esModule", {
     value: !0
 }), exports.isRotateAABBIntersect = exports.rotatePoint = exports.pointInRect = exports.isRectIntersect = exports.rectInsideAnotherRect = exports.InnerBBox = exports.getRectIntersect = exports.getIntersectPoint = exports.isIntersect = void 0;
 
+/* 用于判断2d相交 */
 const angle_1 = require("../../angle"), math_1 = require("../../math");
 
 function sub(out, v1, v2) {
     out[0] = v1[0] - v2[0], out[1] = v1[1] - v2[1];
 }
 
-function isIntersect(left1, right1, left2, right2) {
+/**
+ * 判断直线是否相交，投影法
+ * @param left1
+ * @param right1
+ * @param left2
+ * @param right2
+ */ function isIntersect(left1, right1, left2, right2) {
     let min1 = left1[0], max1 = right1[0], min2 = left2[0], max2 = right2[0];
     return max1 < min1 && ([min1, max1] = [ max1, min1 ]), max2 < min2 && ([max2, min2] = [ min2, max2 ]), 
     !(max1 < min2 || max2 < min1) && (min1 = left1[1], max1 = right1[1], min2 = left2[1], 
@@ -18,15 +25,38 @@ function isIntersect(left1, right1, left2, right2) {
     !(max1 < min2 || max2 < min1));
 }
 
+/**
+ * 获取直线交点
+ * 不相交返回false，共线返回true，相交返回交点
+ * https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282
+ * @param left1
+ * @param right1
+ * @param left2
+ * @param right2
+ */
 function getIntersectPoint(left1, right1, left2, right2) {
     if (!isIntersect(left1, right1, left2, right2)) return !1;
     const dir1 = [ 0, 0 ], dir2 = [ 0, 0 ], tempVec = [ 0, 0 ];
+    // 判断共线
     if (sub(dir1, right1, left1), sub(dir2, right2, left2), (0, math_1.fuzzyEqualVec)(dir1, dir2)) return !0;
-    sub(tempVec, left2, left1);
+    // https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282
+    // line1: left1 + dir1 * t
+    // line2: left2 + dir2 * u
+    // 当 left1 + dir1 * t = left2 + dir2 * u => (left1 + dir1 * t) x dir2 = (left2 + dir2 * u) x dir2
+    // => dir1 x dir2 * t = (left2 - left1) x dir2 => t = (left2 - left1) x dir2 / (dir1 x dir2)
+    // 直线不平行，dir1 x dir2 ≠ 0，当0 <= t <= 1时，可以求出交点
+        sub(tempVec, left2, left1);
     const t = (0, math_1.crossProduct)(tempVec, dir2) / (0, math_1.crossProduct)(dir1, dir2);
     return t >= 0 && t <= 1 && [ left1[0] + dir1[0] * t, left1[1] + dir1[1] * t ];
 }
 
+/**
+ * 获取两个rect的相交部分
+ * 如果有bbox为null，返回null，如果不相交返回{x1: 0, y1: 0, x2: 0, y2: 0}
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */
 function getRectIntersect(bbox1, bbox2, format) {
     if (null === bbox1) return bbox2;
     if (null === bbox2) return bbox1;
@@ -68,12 +98,28 @@ const formatTwoBBox = (bbox1, bbox2, format) => {
     };
 };
 
-function rectInsideAnotherRect(bbox1, bbox2, format) {
+/**
+ * 矩形是否在另一个矩形内部
+ * 返回InnerBBox
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */ function rectInsideAnotherRect(bbox1, bbox2, format) {
     if (!bbox1 || !bbox2) return InnerBBox.NONE;
     const {x11: x11, x12: x12, y11: y11, y12: y12, x21: x21, x22: x22, y21: y21, y22: y22} = formatTwoBBox(bbox1, bbox2, format);
-    return x11 > x21 && x12 < x22 && y11 > y21 && y12 < y22 ? InnerBBox.BBOX1 : x21 > x11 && x22 < x12 && y21 > y11 && y22 < y12 ? InnerBBox.BBOX2 : InnerBBox.NONE;
+    // bbox1在bbox2内部
+        return x11 > x21 && x12 < x22 && y11 > y21 && y12 < y22 ? InnerBBox.BBOX1 : 
+    // bbox2在bbox1内部
+    x21 > x11 && x22 < x12 && y21 > y11 && y22 < y12 ? InnerBBox.BBOX2 : InnerBBox.NONE;
 }
 
+/**
+ * 两个矩形是否相交
+ * 如果有矩形为null，判断为相交
+ * @param bbox1
+ * @param bbox2
+ * @param format
+ */
 function isRectIntersect(bbox1, bbox2, format) {
     if (bbox1 && bbox2) {
         if (!format) return !(bbox1.x1 > bbox2.x2 || bbox1.x2 < bbox2.x1 || bbox1.y1 > bbox2.y2 || bbox1.y2 < bbox2.y1);
@@ -83,6 +129,12 @@ function isRectIntersect(bbox1, bbox2, format) {
     return !0;
 }
 
+/**
+ * 点在box内部
+ * 如果bbox为null返回true
+ * @param point
+ * @param bbox
+ */
 function pointInRect(point, bbox, format) {
     if (!bbox) return !0;
     if (!format) return point.x >= bbox.x1 && point.x <= bbox.x2 && point.y >= bbox.y1 && point.y <= bbox.y2;
@@ -91,11 +143,21 @@ function pointInRect(point, bbox, format) {
     point.x >= x11 && point.x <= x12 && point.y >= y11 && point.y <= y12;
 }
 
+// 参考https://github.com/francecil/leetcode/issues/1
+/**
+ * 计算投影半径
+ * @param {Array(Number)} checkAxis 检测轴 [cosθ,sinθ]
+ * @param {Array} axis 目标轴 [x,y]
+ */
 function getProjectionRadius(checkAxis, axis) {
     return Math.abs(axis[0] * checkAxis[0] + axis[1] * checkAxis[1]);
 }
 
-function rotatePoint({x: x, y: y}, rad, origin = {
+/**
+ * 逆时针旋转矩阵（从正 x 轴开始，旋转到正 y 轴的方向）
+ * [ cos(θ)  -sin(θ) ]
+ * [ sin(θ)  cos(θ) ]
+ */ function rotatePoint({x: x, y: y}, rad, origin = {
     x: 0,
     y: 0
 }) {
@@ -112,7 +174,10 @@ function getCenterPoint(box) {
     };
 }
 
-function toRect(box, isDeg) {
+/**
+ * 转化为顶点坐标数组
+ * @param {Object} box
+ */ function toRect(box, isDeg) {
     const deg = isDeg ? (0, angle_1.degreeToRadian)(box.angle) : box.angle, cp = getCenterPoint(box);
     return [ rotatePoint({
         x: box.x1,
@@ -133,11 +198,14 @@ function isRotateAABBIntersect(box1, box2, isDeg = !1) {
     const rect1 = toRect(box1, isDeg), rect2 = toRect(box2, isDeg), vector = (start, end) => [ end.x - start.x, end.y - start.y ], vp1p2 = vector(getCenterPoint(box1), getCenterPoint(box2)), AB = vector(rect1[0], rect1[1]), BC = vector(rect1[1], rect1[2]), A1B1 = vector(rect2[0], rect2[1]), B1C1 = vector(rect2[1], rect2[2]), deg11 = isDeg ? (0, 
     angle_1.degreeToRadian)(box1.angle) : box1.angle;
     let deg12 = isDeg ? (0, angle_1.degreeToRadian)(90 - box1.angle) : box1.angle + math_1.halfPi;
-    const deg21 = isDeg ? (0, angle_1.degreeToRadian)(box2.angle) : box2.angle;
+    // 矩形2 的两个弧度
+        const deg21 = isDeg ? (0, angle_1.degreeToRadian)(box2.angle) : box2.angle;
     let deg22 = isDeg ? (0, angle_1.degreeToRadian)(90 - box2.angle) : box2.angle + math_1.halfPi;
     deg12 > math_1.pi2 && (deg12 -= math_1.pi2), deg22 > math_1.pi2 && (deg22 -= math_1.pi2);
+    // 投影重叠
     const isCover = (checkAxisRadius, deg, targetAxis1, targetAxis2) => {
         const checkAxis = [ Math.cos(deg), Math.sin(deg) ];
+        // console.log('abc', `checkAxis:${checkAxis},三个投影:${checkAxisRadius}, ${targetAxisRadius}, ${centerPointRadius}`)
         return checkAxisRadius + (getProjectionRadius(checkAxis, targetAxis1) + getProjectionRadius(checkAxis, targetAxis2)) / 2 > getProjectionRadius(checkAxis, vp1p2);
     };
     return isCover((box1.x2 - box1.x1) / 2, deg11, A1B1, B1C1) && isCover((box1.y2 - box1.y1) / 2, deg12, A1B1, B1C1) && isCover((box2.x2 - box2.x1) / 2, deg21, AB, BC) && isCover((box2.y2 - box2.y1) / 2, deg22, AB, BC);

package/cjs/graphics/algorithm/intersect.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/graphics/algorithm/intersect.ts"],"names":[],"mappings":";;;AACA,uCAA6C;AAG7C,qCAAsE;AAGtE,SAAS,GAAG,CAAC,GAAS,EAAE,EAAQ,EAAE,EAAQ;IACxC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACvB,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AASD,SAAgB,WAAW,CAAC,KAAW,EAAE,MAAY,EAAE,KAAW,EAAE,MAAY;IAC9E,IAAI,IAAI,GAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAW,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,GAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAW,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IAED,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AA3BD,kCA2BC;AAWD,SAAgB,iBAAiB,CAAC,KAAW,EAAE,MAAY,EAAE,KAAW,EAAE,MAAY;IACpF,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;QAC9C,OAAO,KAAK,CAAC;KACd;IACD,MAAM,IAAI,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAGzB,IAAI,IAAA,oBAAa,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;QAC7B,OAAO,IAAI,CAAC;KACb;IAQD,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAA,mBAAY,EAAC,OAAO,EAAE,IAAI,CAAC,GAAG,IAAA,mBAAY,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACpB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACzD;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AA5BD,8CA4BC;AASD,SAAgB,gBAAgB,CAC9B,KAAyB,EACzB,KAAyB,EACzB,MAAe;IAEf,IAAI,KAAK,KAAK,IAAI,EAAE;QAClB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,KAAK,KAAK,IAAI,EAAE;QAClB,OAAO,KAAK,CAAC;KACd;IAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEvF,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;QACxD,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;KACvC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;AAC5G,CAAC;AAlBD,4CAkBC;AAED,IAAY,SAIX;AAJD,WAAY,SAAS;IACnB,yCAAQ,CAAA;IACR,2CAAS,CAAA;IACT,2CAAS,CAAA;AACX,CAAC,EAJW,SAAS,GAAT,iBAAS,KAAT,iBAAS,QAIpB;AAED,MAAM,aAAa,GAAG,CAAC,KAAkB,EAAE,KAAkB,EAAE,MAAe,EAAE,EAAE;IAChF,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IAEnB,IAAI,MAAM,EAAE;QACV,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;KACF;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACpD,CAAC,CAAC;AAQF,SAAgB,qBAAqB,CACnC,KAAyB,EACzB,KAAyB,EACzB,MAAe;IAEf,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE;QACpB,OAAO,SAAS,CAAC,IAAI,CAAC;KACvB;IAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEvF,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;QACpD,OAAO,SAAS,CAAC,KAAK,CAAC;KACxB;IAED,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;QACpD,OAAO,SAAS,CAAC,KAAK,CAAC;KACxB;IAED,OAAO,SAAS,CAAC,IAAI,CAAC;AACxB,CAAC;AApBD,sDAoBC;AASD,SAAgB,eAAe,CAAC,KAAyB,EAAE,KAAyB,EAAE,MAAe;IACnG,IAAI,KAAK,IAAI,KAAK,EAAE;QAClB,IAAI,CAAC,MAAM,EAAE;YACX,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE;gBAC5F,OAAO,KAAK,CAAC;aACd;YACD,OAAO,IAAI,CAAC;SACb;QAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAErF,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;YACpD,OAAO,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC;KACb;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAjBD,0CAiBC;AAQD,SAAgB,WAAW,CAAC,KAA+B,EAAE,IAAwB,EAAE,MAAe;IACpG,IAAI,CAAC,IAAI,EAAE;QACT,OAAO,IAAI,CAAC;KACb;IACD,IAAI,CAAC,MAAM,EAAE;QACX,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;KAC7F;IACD,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,GAAG,EAAE;QACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACzB;IACD,IAAI,GAAG,GAAG,GAAG,EAAE;QACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACzB;IACD,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC;AAC9E,CAAC;AAlBD,kCAkBC;AASD,SAAS,mBAAmB,CAAC,SAA2B,EAAE,IAAsB;IAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAOD,SAAgB,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,EAAS,EAAE,GAAW,EAAE,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAC/E,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7E,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;KAC9E,CAAC;AACJ,CAAC;AALD,kCAKC;AAED,SAAS,cAAc,CAAC,GAAgB;IACtC,OAAO;QACL,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;QACxB,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;KACzB,CAAC;AACJ,CAAC;AAWD,SAAS,MAAM,CAAC,GAAgB,EAAE,KAAc;IAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IAC1D,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO;QACL,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;KACF,CAAC;AACJ,CAAC;AACD,SAAgB,qBAAqB,CAAC,IAAiB,EAAE,IAAiB,EAAE,KAAK,GAAG,KAAK;IACvF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAElC,MAAM,MAAM,GAAG,CAAC,KAAY,EAAE,GAAU,EAAE,EAAE;QAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAqB,CAAC;IAChE,CAAC,CAAC;IAGF,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAEhC,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAG7B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAGxC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IAC9D,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,aAAM,CAAC;IAE1E,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IAC9D,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,aAAM,CAAC;IAC1E,IAAI,KAAK,GAAG,UAAG,EAAE;QACf,KAAK,IAAI,UAAG,CAAC;KACd;IACD,IAAI,KAAK,GAAG,UAAG,EAAE;QACf,KAAK,IAAI,UAAG,CAAC;KACd;IAGD,MAAM,OAAO,GAAG,CACd,eAAuB,EACvB,GAAW,EACX,WAA6B,EAC7B,WAA6B,EAC7B,EAAE;QACF,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAqB,CAAC;QACrE,MAAM,gBAAgB,GACpB,CAAC,mBAAmB,CAAC,SAAS,EAAE,WAAW,CAAC,GAAG,mBAAmB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;QAClG,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAEhE,OAAO,eAAe,GAAG,gBAAgB,GAAG,iBAAiB,CAAC;IAChE,CAAC,CAAC;IAEF,OAAO,CACL,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;QACnD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;QACnD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/C,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAChD,CAAC;AACJ,CAAC;AAvDD,sDAuDC","file":"intersect.js","sourcesContent":["/* 用于判断2d相交 */\nimport { degreeToRadian } from '../../angle';\nimport type { IBoundsLike } from '../../data-structure';\nimport type { vec2 } from '../../math';\nimport { pi2, halfPi, crossProduct, fuzzyEqualVec } from '../../math';\nimport type { Point } from './interface';\n\nfunction sub(out: vec2, v1: vec2, v2: vec2) {\n  out[0] = v1[0] - v2[0];\n  out[1] = v1[1] - v2[1];\n}\n\n/**\n * 判断直线是否相交，投影法\n * @param left1\n * @param right1\n * @param left2\n * @param right2\n */\nexport function isIntersect(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean {\n  let min1: number = left1[0];\n  let max1: number = right1[0];\n  let min2: number = left2[0];\n  let max2: number = right2[0];\n  if (max1 < min1) {\n    [min1, max1] = [max1, min1];\n  }\n  if (max2 < min2) {\n    [max2, min2] = [min2, max2];\n  }\n  if (max1 < min2 || max2 < min1) {\n    return false;\n  }\n\n  (min1 = left1[1]), (max1 = right1[1]), (min2 = left2[1]), (max2 = right2[1]);\n  if (max1 < min1) {\n    [min1, max1] = [max1, min1];\n  }\n  if (max2 < min2) {\n    [max2, min2] = [min2, max2];\n  }\n  if (max1 < min2 || max2 < min1) {\n    return false;\n  }\n\n  return true;\n}\n\n/**\n * 获取直线交点\n * 不相交返回false，共线返回true，相交返回交点\n * https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282\n * @param left1\n * @param right1\n * @param left2\n * @param right2\n */\nexport function getIntersectPoint(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean | vec2 {\n  if (!isIntersect(left1, right1, left2, right2)) {\n    return false;\n  }\n  const dir1: vec2 = [0, 0];\n  const dir2: vec2 = [0, 0];\n  const tempVec: vec2 = [0, 0];\n  sub(dir1, right1, left1);\n  sub(dir2, right2, left2);\n\n  // 判断共线\n  if (fuzzyEqualVec(dir1, dir2)) {\n    return true;\n  }\n\n  // https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282\n  // line1: left1 + dir1 * t\n  // line2: left2 + dir2 * u\n  // 当 left1 + dir1 * t = left2 + dir2 * u => (left1 + dir1 * t) x dir2 = (left2 + dir2 * u) x dir2\n  // => dir1 x dir2 * t = (left2 - left1) x dir2 => t = (left2 - left1) x dir2 / (dir1 x dir2)\n  // 直线不平行，dir1 x dir2 ≠ 0，当0 <= t <= 1时，可以求出交点\n  sub(tempVec, left2, left1);\n  const t = crossProduct(tempVec, dir2) / crossProduct(dir1, dir2);\n  if (t >= 0 && t <= 1) {\n    return [left1[0] + dir1[0] * t, left1[1] + dir1[1] * t];\n  }\n\n  return false;\n}\n\n/**\n * 获取两个rect的相交部分\n * 如果有bbox为null，返回null，如果不相交返回{x1: 0, y1: 0, x2: 0, y2: 0}\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function getRectIntersect(\n  bbox1: IBoundsLike | null,\n  bbox2: IBoundsLike | null,\n  format: boolean\n): IBoundsLike | null {\n  if (bbox1 === null) {\n    return bbox2;\n  }\n  if (bbox2 === null) {\n    return bbox1;\n  }\n\n  const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, format);\n\n  if (x11 >= x22 || x12 <= x21 || y11 >= y22 || y12 <= y21) {\n    return { x1: 0, y1: 0, x2: 0, y2: 0 };\n  }\n  return { x1: Math.max(x11, x21), y1: Math.max(y11, y21), x2: Math.min(x12, x22), y2: Math.min(y12, y22) };\n}\n\nexport enum InnerBBox {\n  NONE = 0,\n  BBOX1 = 1,\n  BBOX2 = 2\n}\n\nconst formatTwoBBox = (bbox1: IBoundsLike, bbox2: IBoundsLike, format: boolean) => {\n  let x11 = bbox1.x1;\n  let x12 = bbox1.x2;\n  let y11 = bbox1.y1;\n  let y12 = bbox1.y2;\n  let x21 = bbox2.x1;\n  let x22 = bbox2.x2;\n  let y21 = bbox2.y1;\n  let y22 = bbox2.y2;\n\n  if (format) {\n    if (x11 > x12) {\n      [x11, x12] = [x12, x11];\n    }\n    if (y11 > y12) {\n      [y11, y12] = [y12, y11];\n    }\n    if (x21 > x22) {\n      [x21, x22] = [x22, x21];\n    }\n    if (y21 > y22) {\n      [y21, y22] = [y22, y21];\n    }\n  }\n  return { x11, x12, y11, y12, x21, x22, y21, y22 };\n};\n/**\n * 矩形是否在另一个矩形内部\n * 返回InnerBBox\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function rectInsideAnotherRect(\n  bbox1: IBoundsLike | null,\n  bbox2: IBoundsLike | null,\n  format: boolean\n): InnerBBox {\n  if (!bbox1 || !bbox2) {\n    return InnerBBox.NONE;\n  }\n\n  const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, format);\n  // bbox1在bbox2内部\n  if (x11 > x21 && x12 < x22 && y11 > y21 && y12 < y22) {\n    return InnerBBox.BBOX1;\n  }\n  // bbox2在bbox1内部\n  if (x21 > x11 && x22 < x12 && y21 > y11 && y22 < y12) {\n    return InnerBBox.BBOX2;\n  }\n\n  return InnerBBox.NONE;\n}\n\n/**\n * 两个矩形是否相交\n * 如果有矩形为null，判断为相交\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function isRectIntersect(bbox1: IBoundsLike | null, bbox2: IBoundsLike | null, format: boolean): boolean {\n  if (bbox1 && bbox2) {\n    if (!format) {\n      if (bbox1.x1 > bbox2.x2 || bbox1.x2 < bbox2.x1 || bbox1.y1 > bbox2.y2 || bbox1.y2 < bbox2.y1) {\n        return false;\n      }\n      return true;\n    }\n\n    const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, true);\n\n    if (x11 > x22 || x12 < x21 || y11 > y22 || y12 < y21) {\n      return false;\n    }\n    return true;\n  }\n  return true;\n}\n\n/**\n * 点在box内部\n * 如果bbox为null返回true\n * @param point\n * @param bbox\n */\nexport function pointInRect(point: { x: number; y: number }, bbox: IBoundsLike | null, format: boolean): boolean {\n  if (!bbox) {\n    return true;\n  }\n  if (!format) {\n    return point.x >= bbox.x1 && point.x <= bbox.x2 && point.y >= bbox.y1 && point.y <= bbox.y2;\n  }\n  let x11 = bbox.x1;\n  let x12 = bbox.x2;\n  let y11 = bbox.y1;\n  let y12 = bbox.y2;\n  if (x11 > x12) {\n    [x11, x12] = [x12, x11];\n  }\n  if (y11 > y12) {\n    [y11, y12] = [y12, y11];\n  }\n  return point.x >= x11 && point.x <= x12 && point.y >= y11 && point.y <= y12;\n}\n\n// 参考https://github.com/francecil/leetcode/issues/1\n\n/**\n * 计算投影半径\n * @param {Array(Number)} checkAxis 检测轴 [cosθ,sinθ]\n * @param {Array} axis 目标轴 [x,y]\n */\nfunction getProjectionRadius(checkAxis: [number, number], axis: [number, number]) {\n  return Math.abs(axis[0] * checkAxis[0] + axis[1] * checkAxis[1]);\n}\n\n/**\n * 逆时针旋转矩阵（从正 x 轴开始，旋转到正 y 轴的方向）\n * [ cos(θ)  -sin(θ) ]\n * [ sin(θ)  cos(θ) ]\n */\nexport function rotatePoint({ x, y }: Point, rad: number, origin = { x: 0, y: 0 }) {\n  return {\n    x: (x - origin.x) * Math.cos(rad) - (y - origin.y) * Math.sin(rad) + origin.x,\n    y: (x - origin.x) * Math.sin(rad) + (y - origin.y) * Math.cos(rad) + origin.y\n  };\n}\n\nfunction getCenterPoint(box: RotateBound): Point {\n  return {\n    x: (box.x1 + box.x2) / 2,\n    y: (box.y1 + box.y2) / 2\n  };\n}\n\ninterface RotateBound extends IBoundsLike {\n  angle: number;\n  rotateCenter?: { x: number; y: number };\n}\n\n/**\n * 转化为顶点坐标数组\n * @param {Object} box\n */\nfunction toRect(box: RotateBound, isDeg: boolean) {\n  const deg = isDeg ? degreeToRadian(box.angle) : box.angle;\n  const cp = getCenterPoint(box);\n  return [\n    rotatePoint(\n      {\n        x: box.x1,\n        y: box.y1\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x2,\n        y: box.y1\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x2,\n        y: box.y2\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x1,\n        y: box.y2\n      },\n      deg,\n      cp\n    )\n  ];\n}\nexport function isRotateAABBIntersect(box1: RotateBound, box2: RotateBound, isDeg = false) {\n  const rect1 = toRect(box1, isDeg);\n  const rect2 = toRect(box2, isDeg);\n\n  const vector = (start: Point, end: Point) => {\n    return [end.x - start.x, end.y - start.y] as [number, number];\n  };\n\n  // 两个矩形的中心点\n  const p1 = getCenterPoint(box1);\n  const p2 = getCenterPoint(box2);\n  // 向量 p1p2\n  const vp1p2 = vector(p1, p2);\n\n  //矩形1的两边向量\n  const AB = vector(rect1[0], rect1[1]);\n  const BC = vector(rect1[1], rect1[2]);\n  //矩形2的两边向量\n  const A1B1 = vector(rect2[0], rect2[1]);\n  const B1C1 = vector(rect2[1], rect2[2]);\n\n  // 矩形1 的两个弧度\n  const deg11 = isDeg ? degreeToRadian(box1.angle) : box1.angle;\n  let deg12 = isDeg ? degreeToRadian(90 - box1.angle) : box1.angle + halfPi;\n  // 矩形2 的两个弧度\n  const deg21 = isDeg ? degreeToRadian(box2.angle) : box2.angle;\n  let deg22 = isDeg ? degreeToRadian(90 - box2.angle) : box2.angle + halfPi;\n  if (deg12 > pi2) {\n    deg12 -= pi2;\n  }\n  if (deg22 > pi2) {\n    deg22 -= pi2;\n  }\n\n  // 投影重叠\n  const isCover = (\n    checkAxisRadius: number,\n    deg: number,\n    targetAxis1: [number, number],\n    targetAxis2: [number, number]\n  ) => {\n    const checkAxis = [Math.cos(deg), Math.sin(deg)] as [number, number];\n    const targetAxisRadius =\n      (getProjectionRadius(checkAxis, targetAxis1) + getProjectionRadius(checkAxis, targetAxis2)) / 2;\n    const centerPointRadius = getProjectionRadius(checkAxis, vp1p2);\n    // console.log('abc', `checkAxis:${checkAxis},三个投影:${checkAxisRadius}, ${targetAxisRadius}, ${centerPointRadius}`)\n    return checkAxisRadius + targetAxisRadius > centerPointRadius;\n  };\n\n  return (\n    isCover((box1.x2 - box1.x1) / 2, deg11, A1B1, B1C1) &&\n    isCover((box1.y2 - box1.y1) / 2, deg12, A1B1, B1C1) &&\n    isCover((box2.x2 - box2.x1) / 2, deg21, AB, BC) &&\n    isCover((box2.y2 - box2.y1) / 2, deg22, AB, BC)\n  );\n}\n"]}
+{"version":3,"sources":["../src/graphics/algorithm/intersect.ts"],"names":[],"mappings":";;;AAAA,cAAc;AACd,uCAA6C;AAG7C,qCAAsE;AAGtE,SAAS,GAAG,CAAC,GAAS,EAAE,EAAQ,EAAE,EAAQ;IACxC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACvB,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,KAAW,EAAE,MAAY,EAAE,KAAW,EAAE,MAAY;IAC9E,IAAI,IAAI,GAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAW,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,GAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAW,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IAED,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,EAAE;QACf,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KAC7B;IACD,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AA3BD,kCA2BC;AAED;;;;;;;;GAQG;AACH,SAAgB,iBAAiB,CAAC,KAAW,EAAE,MAAY,EAAE,KAAW,EAAE,MAAY;IACpF,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;QAC9C,OAAO,KAAK,CAAC;KACd;IACD,MAAM,IAAI,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAEzB,OAAO;IACP,IAAI,IAAA,oBAAa,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;QAC7B,OAAO,IAAI,CAAC;KACb;IAED,+GAA+G;IAC/G,0BAA0B;IAC1B,0BAA0B;IAC1B,iGAAiG;IACjG,4FAA4F;IAC5F,6CAA6C;IAC7C,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAA,mBAAY,EAAC,OAAO,EAAE,IAAI,CAAC,GAAG,IAAA,mBAAY,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACpB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACzD;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AA5BD,8CA4BC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC9B,KAAyB,EACzB,KAAyB,EACzB,MAAe;IAEf,IAAI,KAAK,KAAK,IAAI,EAAE;QAClB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,KAAK,KAAK,IAAI,EAAE;QAClB,OAAO,KAAK,CAAC;KACd;IAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEvF,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;QACxD,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;KACvC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;AAC5G,CAAC;AAlBD,4CAkBC;AAED,IAAY,SAIX;AAJD,WAAY,SAAS;IACnB,yCAAQ,CAAA;IACR,2CAAS,CAAA;IACT,2CAAS,CAAA;AACX,CAAC,EAJW,SAAS,GAAT,iBAAS,KAAT,iBAAS,QAIpB;AAED,MAAM,aAAa,GAAG,CAAC,KAAkB,EAAE,KAAkB,EAAE,MAAe,EAAE,EAAE;IAChF,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IACnB,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;IAEnB,IAAI,MAAM,EAAE;QACV,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACzB;KACF;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACpD,CAAC,CAAC;AACF;;;;;;GAMG;AACH,SAAgB,qBAAqB,CACnC,KAAyB,EACzB,KAAyB,EACzB,MAAe;IAEf,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE;QACpB,OAAO,SAAS,CAAC,IAAI,CAAC;KACvB;IAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACvF,gBAAgB;IAChB,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;QACpD,OAAO,SAAS,CAAC,KAAK,CAAC;KACxB;IACD,gBAAgB;IAChB,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;QACpD,OAAO,SAAS,CAAC,KAAK,CAAC;KACxB;IAED,OAAO,SAAS,CAAC,IAAI,CAAC;AACxB,CAAC;AApBD,sDAoBC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,KAAyB,EAAE,KAAyB,EAAE,MAAe;IACnG,IAAI,KAAK,IAAI,KAAK,EAAE;QAClB,IAAI,CAAC,MAAM,EAAE;YACX,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE;gBAC5F,OAAO,KAAK,CAAC;aACd;YACD,OAAO,IAAI,CAAC;SACb;QAED,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAErF,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;YACpD,OAAO,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC;KACb;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAjBD,0CAiBC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAC,KAA+B,EAAE,IAAwB,EAAE,MAAe;IACpG,IAAI,CAAC,IAAI,EAAE;QACT,OAAO,IAAI,CAAC;KACb;IACD,IAAI,CAAC,MAAM,EAAE;QACX,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;KAC7F;IACD,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;IAClB,IAAI,GAAG,GAAG,GAAG,EAAE;QACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACzB;IACD,IAAI,GAAG,GAAG,GAAG,EAAE;QACb,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACzB;IACD,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC;AAC9E,CAAC;AAlBD,kCAkBC;AAED,mDAAmD;AAEnD;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,SAA2B,EAAE,IAAsB;IAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,EAAS,EAAE,GAAW,EAAE,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAC/E,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7E,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;KAC9E,CAAC;AACJ,CAAC;AALD,kCAKC;AAED,SAAS,cAAc,CAAC,GAAgB;IACtC,OAAO;QACL,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;QACxB,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;KACzB,CAAC;AACJ,CAAC;AAOD;;;GAGG;AACH,SAAS,MAAM,CAAC,GAAgB,EAAE,KAAc;IAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IAC1D,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO;QACL,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;QACD,WAAW,CACT;YACE,CAAC,EAAE,GAAG,CAAC,EAAE;YACT,CAAC,EAAE,GAAG,CAAC,EAAE;SACV,EACD,GAAG,EACH,EAAE,CACH;KACF,CAAC;AACJ,CAAC;AACD,SAAgB,qBAAqB,CAAC,IAAiB,EAAE,IAAiB,EAAE,KAAK,GAAG,KAAK;IACvF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAElC,MAAM,MAAM,GAAG,CAAC,KAAY,EAAE,GAAU,EAAE,EAAE;QAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAqB,CAAC;IAChE,CAAC,CAAC;IAEF,WAAW;IACX,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAChC,UAAU;IACV,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAE7B,UAAU;IACV,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,UAAU;IACV,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAExC,YAAY;IACZ,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IAC9D,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,aAAM,CAAC;IAC1E,YAAY;IACZ,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IAC9D,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,IAAA,sBAAc,EAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,aAAM,CAAC;IAC1E,IAAI,KAAK,GAAG,UAAG,EAAE;QACf,KAAK,IAAI,UAAG,CAAC;KACd;IACD,IAAI,KAAK,GAAG,UAAG,EAAE;QACf,KAAK,IAAI,UAAG,CAAC;KACd;IAED,OAAO;IACP,MAAM,OAAO,GAAG,CACd,eAAuB,EACvB,GAAW,EACX,WAA6B,EAC7B,WAA6B,EAC7B,EAAE;QACF,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAqB,CAAC;QACrE,MAAM,gBAAgB,GACpB,CAAC,mBAAmB,CAAC,SAAS,EAAE,WAAW,CAAC,GAAG,mBAAmB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;QAClG,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAChE,kHAAkH;QAClH,OAAO,eAAe,GAAG,gBAAgB,GAAG,iBAAiB,CAAC;IAChE,CAAC,CAAC;IAEF,OAAO,CACL,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;QACnD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;QACnD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/C,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAChD,CAAC;AACJ,CAAC;AAvDD,sDAuDC","file":"intersect.js","sourcesContent":["/* 用于判断2d相交 */\nimport { degreeToRadian } from '../../angle';\nimport type { IBoundsLike } from '../../data-structure';\nimport type { vec2 } from '../../math';\nimport { pi2, halfPi, crossProduct, fuzzyEqualVec } from '../../math';\nimport type { Point } from './interface';\n\nfunction sub(out: vec2, v1: vec2, v2: vec2) {\n  out[0] = v1[0] - v2[0];\n  out[1] = v1[1] - v2[1];\n}\n\n/**\n * 判断直线是否相交，投影法\n * @param left1\n * @param right1\n * @param left2\n * @param right2\n */\nexport function isIntersect(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean {\n  let min1: number = left1[0];\n  let max1: number = right1[0];\n  let min2: number = left2[0];\n  let max2: number = right2[0];\n  if (max1 < min1) {\n    [min1, max1] = [max1, min1];\n  }\n  if (max2 < min2) {\n    [max2, min2] = [min2, max2];\n  }\n  if (max1 < min2 || max2 < min1) {\n    return false;\n  }\n\n  (min1 = left1[1]), (max1 = right1[1]), (min2 = left2[1]), (max2 = right2[1]);\n  if (max1 < min1) {\n    [min1, max1] = [max1, min1];\n  }\n  if (max2 < min2) {\n    [max2, min2] = [min2, max2];\n  }\n  if (max1 < min2 || max2 < min1) {\n    return false;\n  }\n\n  return true;\n}\n\n/**\n * 获取直线交点\n * 不相交返回false，共线返回true，相交返回交点\n * https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282\n * @param left1\n * @param right1\n * @param left2\n * @param right2\n */\nexport function getIntersectPoint(left1: vec2, right1: vec2, left2: vec2, right2: vec2): boolean | vec2 {\n  if (!isIntersect(left1, right1, left2, right2)) {\n    return false;\n  }\n  const dir1: vec2 = [0, 0];\n  const dir2: vec2 = [0, 0];\n  const tempVec: vec2 = [0, 0];\n  sub(dir1, right1, left1);\n  sub(dir2, right2, left2);\n\n  // 判断共线\n  if (fuzzyEqualVec(dir1, dir2)) {\n    return true;\n  }\n\n  // https://stackoverflow.com/questions/563198/how-do-you-detect-where-two-line-segments-intersect/565282#565282\n  // line1: left1 + dir1 * t\n  // line2: left2 + dir2 * u\n  // 当 left1 + dir1 * t = left2 + dir2 * u => (left1 + dir1 * t) x dir2 = (left2 + dir2 * u) x dir2\n  // => dir1 x dir2 * t = (left2 - left1) x dir2 => t = (left2 - left1) x dir2 / (dir1 x dir2)\n  // 直线不平行，dir1 x dir2 ≠ 0，当0 <= t <= 1时，可以求出交点\n  sub(tempVec, left2, left1);\n  const t = crossProduct(tempVec, dir2) / crossProduct(dir1, dir2);\n  if (t >= 0 && t <= 1) {\n    return [left1[0] + dir1[0] * t, left1[1] + dir1[1] * t];\n  }\n\n  return false;\n}\n\n/**\n * 获取两个rect的相交部分\n * 如果有bbox为null，返回null，如果不相交返回{x1: 0, y1: 0, x2: 0, y2: 0}\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function getRectIntersect(\n  bbox1: IBoundsLike | null,\n  bbox2: IBoundsLike | null,\n  format: boolean\n): IBoundsLike | null {\n  if (bbox1 === null) {\n    return bbox2;\n  }\n  if (bbox2 === null) {\n    return bbox1;\n  }\n\n  const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, format);\n\n  if (x11 >= x22 || x12 <= x21 || y11 >= y22 || y12 <= y21) {\n    return { x1: 0, y1: 0, x2: 0, y2: 0 };\n  }\n  return { x1: Math.max(x11, x21), y1: Math.max(y11, y21), x2: Math.min(x12, x22), y2: Math.min(y12, y22) };\n}\n\nexport enum InnerBBox {\n  NONE = 0,\n  BBOX1 = 1,\n  BBOX2 = 2\n}\n\nconst formatTwoBBox = (bbox1: IBoundsLike, bbox2: IBoundsLike, format: boolean) => {\n  let x11 = bbox1.x1;\n  let x12 = bbox1.x2;\n  let y11 = bbox1.y1;\n  let y12 = bbox1.y2;\n  let x21 = bbox2.x1;\n  let x22 = bbox2.x2;\n  let y21 = bbox2.y1;\n  let y22 = bbox2.y2;\n\n  if (format) {\n    if (x11 > x12) {\n      [x11, x12] = [x12, x11];\n    }\n    if (y11 > y12) {\n      [y11, y12] = [y12, y11];\n    }\n    if (x21 > x22) {\n      [x21, x22] = [x22, x21];\n    }\n    if (y21 > y22) {\n      [y21, y22] = [y22, y21];\n    }\n  }\n  return { x11, x12, y11, y12, x21, x22, y21, y22 };\n};\n/**\n * 矩形是否在另一个矩形内部\n * 返回InnerBBox\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function rectInsideAnotherRect(\n  bbox1: IBoundsLike | null,\n  bbox2: IBoundsLike | null,\n  format: boolean\n): InnerBBox {\n  if (!bbox1 || !bbox2) {\n    return InnerBBox.NONE;\n  }\n\n  const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, format);\n  // bbox1在bbox2内部\n  if (x11 > x21 && x12 < x22 && y11 > y21 && y12 < y22) {\n    return InnerBBox.BBOX1;\n  }\n  // bbox2在bbox1内部\n  if (x21 > x11 && x22 < x12 && y21 > y11 && y22 < y12) {\n    return InnerBBox.BBOX2;\n  }\n\n  return InnerBBox.NONE;\n}\n\n/**\n * 两个矩形是否相交\n * 如果有矩形为null，判断为相交\n * @param bbox1\n * @param bbox2\n * @param format\n */\nexport function isRectIntersect(bbox1: IBoundsLike | null, bbox2: IBoundsLike | null, format: boolean): boolean {\n  if (bbox1 && bbox2) {\n    if (!format) {\n      if (bbox1.x1 > bbox2.x2 || bbox1.x2 < bbox2.x1 || bbox1.y1 > bbox2.y2 || bbox1.y2 < bbox2.y1) {\n        return false;\n      }\n      return true;\n    }\n\n    const { x11, x12, y11, y12, x21, x22, y21, y22 } = formatTwoBBox(bbox1, bbox2, true);\n\n    if (x11 > x22 || x12 < x21 || y11 > y22 || y12 < y21) {\n      return false;\n    }\n    return true;\n  }\n  return true;\n}\n\n/**\n * 点在box内部\n * 如果bbox为null返回true\n * @param point\n * @param bbox\n */\nexport function pointInRect(point: { x: number; y: number }, bbox: IBoundsLike | null, format: boolean): boolean {\n  if (!bbox) {\n    return true;\n  }\n  if (!format) {\n    return point.x >= bbox.x1 && point.x <= bbox.x2 && point.y >= bbox.y1 && point.y <= bbox.y2;\n  }\n  let x11 = bbox.x1;\n  let x12 = bbox.x2;\n  let y11 = bbox.y1;\n  let y12 = bbox.y2;\n  if (x11 > x12) {\n    [x11, x12] = [x12, x11];\n  }\n  if (y11 > y12) {\n    [y11, y12] = [y12, y11];\n  }\n  return point.x >= x11 && point.x <= x12 && point.y >= y11 && point.y <= y12;\n}\n\n// 参考https://github.com/francecil/leetcode/issues/1\n\n/**\n * 计算投影半径\n * @param {Array(Number)} checkAxis 检测轴 [cosθ,sinθ]\n * @param {Array} axis 目标轴 [x,y]\n */\nfunction getProjectionRadius(checkAxis: [number, number], axis: [number, number]) {\n  return Math.abs(axis[0] * checkAxis[0] + axis[1] * checkAxis[1]);\n}\n\n/**\n * 逆时针旋转矩阵（从正 x 轴开始，旋转到正 y 轴的方向）\n * [ cos(θ)  -sin(θ) ]\n * [ sin(θ)  cos(θ) ]\n */\nexport function rotatePoint({ x, y }: Point, rad: number, origin = { x: 0, y: 0 }) {\n  return {\n    x: (x - origin.x) * Math.cos(rad) - (y - origin.y) * Math.sin(rad) + origin.x,\n    y: (x - origin.x) * Math.sin(rad) + (y - origin.y) * Math.cos(rad) + origin.y\n  };\n}\n\nfunction getCenterPoint(box: RotateBound): Point {\n  return {\n    x: (box.x1 + box.x2) / 2,\n    y: (box.y1 + box.y2) / 2\n  };\n}\n\ninterface RotateBound extends IBoundsLike {\n  angle: number;\n  rotateCenter?: { x: number; y: number };\n}\n\n/**\n * 转化为顶点坐标数组\n * @param {Object} box\n */\nfunction toRect(box: RotateBound, isDeg: boolean) {\n  const deg = isDeg ? degreeToRadian(box.angle) : box.angle;\n  const cp = getCenterPoint(box);\n  return [\n    rotatePoint(\n      {\n        x: box.x1,\n        y: box.y1\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x2,\n        y: box.y1\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x2,\n        y: box.y2\n      },\n      deg,\n      cp\n    ),\n    rotatePoint(\n      {\n        x: box.x1,\n        y: box.y2\n      },\n      deg,\n      cp\n    )\n  ];\n}\nexport function isRotateAABBIntersect(box1: RotateBound, box2: RotateBound, isDeg = false) {\n  const rect1 = toRect(box1, isDeg);\n  const rect2 = toRect(box2, isDeg);\n\n  const vector = (start: Point, end: Point) => {\n    return [end.x - start.x, end.y - start.y] as [number, number];\n  };\n\n  // 两个矩形的中心点\n  const p1 = getCenterPoint(box1);\n  const p2 = getCenterPoint(box2);\n  // 向量 p1p2\n  const vp1p2 = vector(p1, p2);\n\n  //矩形1的两边向量\n  const AB = vector(rect1[0], rect1[1]);\n  const BC = vector(rect1[1], rect1[2]);\n  //矩形2的两边向量\n  const A1B1 = vector(rect2[0], rect2[1]);\n  const B1C1 = vector(rect2[1], rect2[2]);\n\n  // 矩形1 的两个弧度\n  const deg11 = isDeg ? degreeToRadian(box1.angle) : box1.angle;\n  let deg12 = isDeg ? degreeToRadian(90 - box1.angle) : box1.angle + halfPi;\n  // 矩形2 的两个弧度\n  const deg21 = isDeg ? degreeToRadian(box2.angle) : box2.angle;\n  let deg22 = isDeg ? degreeToRadian(90 - box2.angle) : box2.angle + halfPi;\n  if (deg12 > pi2) {\n    deg12 -= pi2;\n  }\n  if (deg22 > pi2) {\n    deg22 -= pi2;\n  }\n\n  // 投影重叠\n  const isCover = (\n    checkAxisRadius: number,\n    deg: number,\n    targetAxis1: [number, number],\n    targetAxis2: [number, number]\n  ) => {\n    const checkAxis = [Math.cos(deg), Math.sin(deg)] as [number, number];\n    const targetAxisRadius =\n      (getProjectionRadius(checkAxis, targetAxis1) + getProjectionRadius(checkAxis, targetAxis2)) / 2;\n    const centerPointRadius = getProjectionRadius(checkAxis, vp1p2);\n    // console.log('abc', `checkAxis:${checkAxis},三个投影:${checkAxisRadius}, ${targetAxisRadius}, ${centerPointRadius}`)\n    return checkAxisRadius + targetAxisRadius > centerPointRadius;\n  };\n\n  return (\n    isCover((box1.x2 - box1.x1) / 2, deg11, A1B1, B1C1) &&\n    isCover((box1.y2 - box1.y1) / 2, deg12, A1B1, B1C1) &&\n    isCover((box2.x2 - box2.x1) / 2, deg21, AB, BC) &&\n    isCover((box2.y2 - box2.y1) / 2, deg22, AB, BC)\n  );\n}\n"]}

package/cjs/graphics/bounds-util.js

@@ -69,14 +69,16 @@ const obbSeparation = (a, b) => {
         x: -Math.sin(b.angle),
         y: Math.cos(a.angle)
     } ];
-    function getProjectionRange(obb, axisX, axisY) {
+    // calculate the projection range of a rectangle on a given axis
+        function getProjectionRange(obb, axisX, axisY) {
         const projections = obb.getRotatedCorners().map((p => p.x * axisX + p.y * axisY));
         return {
             min: Math.min(...projections),
             max: Math.max(...projections)
         };
     }
-    let maxDistance = 0;
+    // Calculate distances for all axes
+        let maxDistance = 0;
     for (const axis of axes) {
         const rangeA = getProjectionRange(a, axis.x, axis.y), rangeB = getProjectionRange(b, axis.x, axis.y);
         let distance;

package/cjs/graphics/bounds-util.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/graphics/bounds-util.ts"],"names":[],"mappings":";;;AAeO,MAAM,uBAAuB,GAAG,CAAC,MAAmB,EAAE,UAAkB,EAAE,EAAE;IACjF,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAE5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IAEX,QAAQ,UAAU,EAAE;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,YAAY;YACf,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,QAAQ,CAAC;QACd,KAAK,eAAe;YAClB,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,MAAM,CAAC;QACZ,KAAK,aAAa;YAChB,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,OAAO,CAAC;QACb,KAAK,cAAc;YACjB,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,WAAW;YACd,EAAE,GAAG,GAAG,CAAC;YACT,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,UAAU;YACb,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,cAAc;YACjB,EAAE,GAAG,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,aAAa;YAChB,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,EAAE,GAAG,GAAG,CAAC;KACZ;IAED,OAAO,IAAI,EAAE,GAAG,SAAS,CAAC;IAC1B,OAAO,IAAI,EAAE,GAAG,UAAU,CAAC;IAE3B,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;AACpC,CAAC,CAAC;AAhDW,QAAA,uBAAuB,2BAgDlC;AAEK,MAAM,cAAc,GAAG,CAAC,CAAc,EAAE,CAAc,EAAE,EAAE;IAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AACtE,CAAC,CAAC;AAFW,QAAA,cAAc,kBAEzB;AAEK,MAAM,aAAa,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,EAAE;IAC5D,MAAM,IAAI,GAAG;QACX,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC9C,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC/C,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC9C,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;KAChD,CAAC;IAGF,SAAS,kBAAkB,CAAC,GAAe,EAAE,KAAa,EAAE,KAAa;QACvE,MAAM,OAAO,GAAG,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACxC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAChE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;IAC1E,CAAC;IAGD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACvB,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,QAAQ,CAAC;QACb,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAC3B,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;SACpC;aAAM,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAClC,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;SACpC;aAAM;YACL,QAAQ,GAAG,CAAC,CAAC;SACd;QACD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;KAC/C;IAED,OAAO,WAAW,CAAC;AACrB,CAAC,CAAC;AAhCW,QAAA,aAAa,iBAgCxB","file":"bounds-util.js","sourcesContent":["import type { IBoundsLike, IOBBBounds } from '../data-structure';\n\nexport type InsideBoundsAnchorType = 'inside' | 'inside-top' | 'inside-bottom' | 'inside-left' | 'inside-right';\n\nexport type BoundsAnchorType =\n  | 'top'\n  | 'bottom'\n  | 'left'\n  | 'right'\n  | 'top-right'\n  | 'top-left'\n  | 'bottom-right'\n  | 'bottom-left'\n  | 'center';\n\nexport const calculateAnchorOfBounds = (bounds: IBoundsLike, anchorType: string) => {\n  const { x1, x2, y1, y2 } = bounds;\n  const rectWidth = Math.abs(x2 - x1);\n  const rectHeight = Math.abs(y2 - y1);\n  let anchorX = (x1 + x2) / 2;\n  let anchorY = (y1 + y2) / 2;\n\n  let sx = 0;\n  let sy = 0;\n\n  switch (anchorType) {\n    case 'top':\n    case 'inside-top':\n      sy = -0.5;\n      break;\n    case 'bottom':\n    case 'inside-bottom':\n      sy = 0.5;\n      break;\n    case 'left':\n    case 'inside-left':\n      sx = -0.5;\n      break;\n    case 'right':\n    case 'inside-right':\n      sx = 0.5;\n      break;\n    case 'top-right':\n      sx = 0.5;\n      sy = -0.5;\n      break;\n    case 'top-left':\n      sx = -0.5;\n      sy = -0.5;\n      break;\n    case 'bottom-right':\n      sx = 0.5;\n      sy = 0.5;\n      break;\n    case 'bottom-left':\n      sx = -0.5;\n      sy = 0.5;\n  }\n\n  anchorX += sx * rectWidth;\n  anchorY += sy * rectHeight;\n\n  return { x: anchorX, y: anchorY };\n};\n\nexport const aabbSeparation = (a: IBoundsLike, b: IBoundsLike) => {\n  return Math.max(b.x1 - a.x2, a.x1 - b.x2, b.y1 - a.y2, a.y1 - b.y2);\n};\n\nexport const obbSeparation = (a: IOBBBounds, b: IOBBBounds) => {\n  const axes = [\n    { x: Math.cos(a.angle), y: Math.sin(a.angle) }, // Rect A's first axis\n    { x: -Math.sin(a.angle), y: Math.cos(a.angle) }, // Rect A's second axis\n    { x: Math.cos(b.angle), y: Math.sin(a.angle) }, // Rect B's first axis\n    { x: -Math.sin(b.angle), y: Math.cos(a.angle) } // Rect B's second axis\n  ];\n\n  // calculate the projection range of a rectangle on a given axis\n  function getProjectionRange(obb: IOBBBounds, axisX: number, axisY: number): { min: number; max: number } {\n    const corners = obb.getRotatedCorners();\n    const projections = corners.map(p => p.x * axisX + p.y * axisY);\n    return { min: Math.min(...projections), max: Math.max(...projections) };\n  }\n\n  // Calculate distances for all axes\n  let maxDistance = 0;\n  for (const axis of axes) {\n    const rangeA = getProjectionRange(a, axis.x, axis.y);\n    const rangeB = getProjectionRange(b, axis.x, axis.y);\n    let distance;\n    if (rangeA.max < rangeB.min) {\n      distance = rangeB.min - rangeA.max; // B is to the right of A\n    } else if (rangeB.max < rangeA.min) {\n      distance = rangeA.min - rangeB.max; // A is to the right of B\n    } else {\n      distance = 0; // Overlapping\n    }\n    maxDistance = Math.max(maxDistance, distance);\n  }\n\n  return maxDistance;\n};\n"]}
+{"version":3,"sources":["../src/graphics/bounds-util.ts"],"names":[],"mappings":";;;AAeO,MAAM,uBAAuB,GAAG,CAAC,MAAmB,EAAE,UAAkB,EAAE,EAAE;IACjF,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAE5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IAEX,QAAQ,UAAU,EAAE;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,YAAY;YACf,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,QAAQ,CAAC;QACd,KAAK,eAAe;YAClB,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,MAAM,CAAC;QACZ,KAAK,aAAa;YAChB,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,OAAO,CAAC;QACb,KAAK,cAAc;YACjB,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,WAAW;YACd,EAAE,GAAG,GAAG,CAAC;YACT,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,UAAU;YACb,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,MAAM;QACR,KAAK,cAAc;YACjB,EAAE,GAAG,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;YACT,MAAM;QACR,KAAK,aAAa;YAChB,EAAE,GAAG,CAAC,GAAG,CAAC;YACV,EAAE,GAAG,GAAG,CAAC;KACZ;IAED,OAAO,IAAI,EAAE,GAAG,SAAS,CAAC;IAC1B,OAAO,IAAI,EAAE,GAAG,UAAU,CAAC;IAE3B,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;AACpC,CAAC,CAAC;AAhDW,QAAA,uBAAuB,2BAgDlC;AAEK,MAAM,cAAc,GAAG,CAAC,CAAc,EAAE,CAAc,EAAE,EAAE;IAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AACtE,CAAC,CAAC;AAFW,QAAA,cAAc,kBAEzB;AAEK,MAAM,aAAa,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,EAAE;IAC5D,MAAM,IAAI,GAAG;QACX,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC9C,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC/C,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QAC9C,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,uBAAuB;KACxE,CAAC;IAEF,gEAAgE;IAChE,SAAS,kBAAkB,CAAC,GAAe,EAAE,KAAa,EAAE,KAAa;QACvE,MAAM,OAAO,GAAG,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACxC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAChE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;IAC1E,CAAC;IAED,mCAAmC;IACnC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACvB,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,QAAQ,CAAC;QACb,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAC3B,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,yBAAyB;SAC9D;aAAM,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAClC,QAAQ,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,yBAAyB;SAC9D;aAAM;YACL,QAAQ,GAAG,CAAC,CAAC,CAAC,cAAc;SAC7B;QACD,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;KAC/C;IAED,OAAO,WAAW,CAAC;AACrB,CAAC,CAAC;AAhCW,QAAA,aAAa,iBAgCxB","file":"bounds-util.js","sourcesContent":["import type { IBoundsLike, IOBBBounds } from '../data-structure';\n\nexport type InsideBoundsAnchorType = 'inside' | 'inside-top' | 'inside-bottom' | 'inside-left' | 'inside-right';\n\nexport type BoundsAnchorType =\n  | 'top'\n  | 'bottom'\n  | 'left'\n  | 'right'\n  | 'top-right'\n  | 'top-left'\n  | 'bottom-right'\n  | 'bottom-left'\n  | 'center';\n\nexport const calculateAnchorOfBounds = (bounds: IBoundsLike, anchorType: string) => {\n  const { x1, x2, y1, y2 } = bounds;\n  const rectWidth = Math.abs(x2 - x1);\n  const rectHeight = Math.abs(y2 - y1);\n  let anchorX = (x1 + x2) / 2;\n  let anchorY = (y1 + y2) / 2;\n\n  let sx = 0;\n  let sy = 0;\n\n  switch (anchorType) {\n    case 'top':\n    case 'inside-top':\n      sy = -0.5;\n      break;\n    case 'bottom':\n    case 'inside-bottom':\n      sy = 0.5;\n      break;\n    case 'left':\n    case 'inside-left':\n      sx = -0.5;\n      break;\n    case 'right':\n    case 'inside-right':\n      sx = 0.5;\n      break;\n    case 'top-right':\n      sx = 0.5;\n      sy = -0.5;\n      break;\n    case 'top-left':\n      sx = -0.5;\n      sy = -0.5;\n      break;\n    case 'bottom-right':\n      sx = 0.5;\n      sy = 0.5;\n      break;\n    case 'bottom-left':\n      sx = -0.5;\n      sy = 0.5;\n  }\n\n  anchorX += sx * rectWidth;\n  anchorY += sy * rectHeight;\n\n  return { x: anchorX, y: anchorY };\n};\n\nexport const aabbSeparation = (a: IBoundsLike, b: IBoundsLike) => {\n  return Math.max(b.x1 - a.x2, a.x1 - b.x2, b.y1 - a.y2, a.y1 - b.y2);\n};\n\nexport const obbSeparation = (a: IOBBBounds, b: IOBBBounds) => {\n  const axes = [\n    { x: Math.cos(a.angle), y: Math.sin(a.angle) }, // Rect A's first axis\n    { x: -Math.sin(a.angle), y: Math.cos(a.angle) }, // Rect A's second axis\n    { x: Math.cos(b.angle), y: Math.sin(a.angle) }, // Rect B's first axis\n    { x: -Math.sin(b.angle), y: Math.cos(a.angle) } // Rect B's second axis\n  ];\n\n  // calculate the projection range of a rectangle on a given axis\n  function getProjectionRange(obb: IOBBBounds, axisX: number, axisY: number): { min: number; max: number } {\n    const corners = obb.getRotatedCorners();\n    const projections = corners.map(p => p.x * axisX + p.y * axisY);\n    return { min: Math.min(...projections), max: Math.max(...projections) };\n  }\n\n  // Calculate distances for all axes\n  let maxDistance = 0;\n  for (const axis of axes) {\n    const rangeA = getProjectionRange(a, axis.x, axis.y);\n    const rangeB = getProjectionRange(b, axis.x, axis.y);\n    let distance;\n    if (rangeA.max < rangeB.min) {\n      distance = rangeB.min - rangeA.max; // B is to the right of A\n    } else if (rangeB.max < rangeA.min) {\n      distance = rangeA.min - rangeB.max; // A is to the right of B\n    } else {\n      distance = 0; // Overlapping\n    }\n    maxDistance = Math.max(maxDistance, distance);\n  }\n\n  return maxDistance;\n};\n"]}

package/cjs/graphics/graph-util.js

@@ -30,7 +30,11 @@ class GraphicUtil {
         });
     }
     estimate({text: text, fontSize: fontSize}) {
+        // 假设只有英文和中文字符
         let eCharLen = 0, cCharLen = 0;
+ // 英文字符
+                // 中文字符
+        // 判断ascii码，如果是
         for (let i = 0; i < text.length; i++) text.charCodeAt(i) < 128 ? eCharLen++ : cCharLen++;
         return {
             width: ~~(.8 * eCharLen * fontSize + cCharLen * fontSize),

package/cjs/graphics/graph-util.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/graphics/graph-util.ts"],"names":[],"mappings":";;;AASA,SAAS,cAAc,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAe;IAC/F,OAAO,CACL,EAAE;QACF,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAClC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,CAAC,QAAQ,IAAI,EAAE,CAAC;QAChB,KAAK;QACL,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CACzC,CAAC;AACJ,CAAC;AAED,MAAa,WAAW;IAMtB,YAAY,MAA0B;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;IACH,CAAC;IACD,SAAS,CAAC,MAA0B;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;IACH,CAAC;IAED,WAAW,CAAC,EAAe;QACzB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;YACpE,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SAC1B;QACD,OAAO,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAEO,mBAAmB,CAAC,EAAe;QACzC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,OAAO,CAAC,KAAK,CAAC,gEAAgE,CAAC,CAAC;YAChF,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC;SAC3C;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK;YAC1C,MAAM,EAAE,EAAE,CAAC,QAAQ;SACpB,CAAC;IACJ,CAAC;IAEO,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAe;QAE9C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;SACpD;QACD,OAAO;YACL,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;YAC1D,MAAM,EAAE,QAAQ;SACjB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,eAAe,CAAC,MAA0B;QAC/C,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE;YACzB,WAAW,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;SAChD;QACD,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;CACF;AA3DD,kCA2DC","file":"graph-util.js","sourcesContent":["interface ITextConfig {\n  text: string;\n  fontSize: number;\n  fontStyle?: string;\n  fontVariant?: string;\n  fontWeight?: number | string;\n  fontFamily?: string;\n}\n\nfunction getContextFont({ fontStyle, fontVariant, fontWeight, fontSize, fontFamily }: ITextConfig): string {\n  return (\n    '' +\n    (fontStyle ? fontStyle + ' ' : '') +\n    (fontVariant ? fontVariant + ' ' : '') +\n    (fontWeight ? fontWeight + ' ' : '') +\n    (fontSize || 12) +\n    'px ' +\n    (fontFamily ? fontFamily : 'sans-serif')\n  );\n}\n\nexport class GraphicUtil {\n  canvas?: HTMLCanvasElement;\n  ctx?: CanvasRenderingContext2D | null;\n\n  static instance?: GraphicUtil;\n\n  constructor(canvas?: HTMLCanvasElement) {\n    this.canvas = canvas;\n    if (canvas) {\n      this.ctx = canvas.getContext('2d');\n    }\n  }\n  setCanvas(canvas?: HTMLCanvasElement) {\n    this.canvas = canvas;\n    if (canvas) {\n      this.ctx = canvas.getContext('2d');\n    }\n  }\n\n  measureText(tc: ITextConfig) {\n    if (!this.canvas) {\n      console.warn('[warn] no canvas, measureText might be not accurate');\n      return this.estimate(tc);\n    }\n    return this.measureTextByCanvas(tc);\n  }\n\n  private measureTextByCanvas(tc: ITextConfig): { width: number; height: number } {\n    if (!this.ctx) {\n      console.error('[error!!!]measureTextByCanvas can not be called without canvas');\n      return { width: -1, height: tc.fontSize };\n    }\n    this.ctx.font = getContextFont(tc);\n    return {\n      width: this.ctx.measureText(tc.text).width,\n      height: tc.fontSize\n    };\n  }\n\n  private estimate({ text, fontSize }: ITextConfig): { width: number; height: number } {\n    // 假设只有英文和中文字符\n    let eCharLen = 0; // 英文字符\n    let cCharLen = 0; // 中文字符\n    // 判断ascii码，如果是\n    for (let i = 0; i < text.length; i++) {\n      text.charCodeAt(i) < 128 ? eCharLen++ : cCharLen++;\n    }\n    return {\n      width: ~~(0.8 * eCharLen * fontSize + cCharLen * fontSize),\n      height: fontSize\n    };\n  }\n\n  static getDefaultUtils(canvas?: HTMLCanvasElement) {\n    if (!GraphicUtil.instance) {\n      GraphicUtil.instance = new GraphicUtil(canvas);\n    }\n    return GraphicUtil.instance;\n  }\n}\n"]}
+{"version":3,"sources":["../src/graphics/graph-util.ts"],"names":[],"mappings":";;;AASA,SAAS,cAAc,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAe;IAC/F,OAAO,CACL,EAAE;QACF,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAClC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,CAAC,QAAQ,IAAI,EAAE,CAAC;QAChB,KAAK;QACL,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CACzC,CAAC;AACJ,CAAC;AAED,MAAa,WAAW;IAMtB,YAAY,MAA0B;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;IACH,CAAC;IACD,SAAS,CAAC,MAA0B;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;IACH,CAAC;IAED,WAAW,CAAC,EAAe;QACzB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;YACpE,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SAC1B;QACD,OAAO,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAEO,mBAAmB,CAAC,EAAe;QACzC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,OAAO,CAAC,KAAK,CAAC,gEAAgE,CAAC,CAAC;YAChF,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC;SAC3C;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK;YAC1C,MAAM,EAAE,EAAE,CAAC,QAAQ;SACpB,CAAC;IACJ,CAAC;IAEO,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAe;QAC9C,cAAc;QACd,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,OAAO;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,OAAO;QACzB,eAAe;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;SACpD;QACD,OAAO;YACL,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;YAC1D,MAAM,EAAE,QAAQ;SACjB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,eAAe,CAAC,MAA0B;QAC/C,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE;YACzB,WAAW,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;SAChD;QACD,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;CACF;AA3DD,kCA2DC","file":"graph-util.js","sourcesContent":["interface ITextConfig {\n  text: string;\n  fontSize: number;\n  fontStyle?: string;\n  fontVariant?: string;\n  fontWeight?: number | string;\n  fontFamily?: string;\n}\n\nfunction getContextFont({ fontStyle, fontVariant, fontWeight, fontSize, fontFamily }: ITextConfig): string {\n  return (\n    '' +\n    (fontStyle ? fontStyle + ' ' : '') +\n    (fontVariant ? fontVariant + ' ' : '') +\n    (fontWeight ? fontWeight + ' ' : '') +\n    (fontSize || 12) +\n    'px ' +\n    (fontFamily ? fontFamily : 'sans-serif')\n  );\n}\n\nexport class GraphicUtil {\n  canvas?: HTMLCanvasElement;\n  ctx?: CanvasRenderingContext2D | null;\n\n  static instance?: GraphicUtil;\n\n  constructor(canvas?: HTMLCanvasElement) {\n    this.canvas = canvas;\n    if (canvas) {\n      this.ctx = canvas.getContext('2d');\n    }\n  }\n  setCanvas(canvas?: HTMLCanvasElement) {\n    this.canvas = canvas;\n    if (canvas) {\n      this.ctx = canvas.getContext('2d');\n    }\n  }\n\n  measureText(tc: ITextConfig) {\n    if (!this.canvas) {\n      console.warn('[warn] no canvas, measureText might be not accurate');\n      return this.estimate(tc);\n    }\n    return this.measureTextByCanvas(tc);\n  }\n\n  private measureTextByCanvas(tc: ITextConfig): { width: number; height: number } {\n    if (!this.ctx) {\n      console.error('[error!!!]measureTextByCanvas can not be called without canvas');\n      return { width: -1, height: tc.fontSize };\n    }\n    this.ctx.font = getContextFont(tc);\n    return {\n      width: this.ctx.measureText(tc.text).width,\n      height: tc.fontSize\n    };\n  }\n\n  private estimate({ text, fontSize }: ITextConfig): { width: number; height: number } {\n    // 假设只有英文和中文字符\n    let eCharLen = 0; // 英文字符\n    let cCharLen = 0; // 中文字符\n    // 判断ascii码，如果是\n    for (let i = 0; i < text.length; i++) {\n      text.charCodeAt(i) < 128 ? eCharLen++ : cCharLen++;\n    }\n    return {\n      width: ~~(0.8 * eCharLen * fontSize + cCharLen * fontSize),\n      height: fontSize\n    };\n  }\n\n  static getDefaultUtils(canvas?: HTMLCanvasElement) {\n    if (!GraphicUtil.instance) {\n      GraphicUtil.instance = new GraphicUtil(canvas);\n    }\n    return GraphicUtil.instance;\n  }\n}\n"]}

package/cjs/graphics/index.js

@@ -17,8 +17,11 @@ var __createBinding = this && this.__createBinding || (Object.create ? function(
 
 Object.defineProperty(exports, "__esModule", {
     value: !0
-}), __exportStar(require("./image"), exports), __exportStar(require("./algorithm"), exports), 
-__exportStar(require("./graph-util"), exports), __exportStar(require("./polygon"), exports), 
-__exportStar(require("./arc"), exports), __exportStar(require("./text"), exports), 
-__exportStar(require("./bounds-util"), exports);
+}), 
+// image
+__exportStar(require("./image"), exports), 
+// computer geometry algorithm, cgs.js
+__exportStar(require("./algorithm"), exports), __exportStar(require("./graph-util"), exports), 
+__exportStar(require("./polygon"), exports), __exportStar(require("./arc"), exports), 
+__exportStar(require("./text"), exports), __exportStar(require("./bounds-util"), exports);
 //# sourceMappingURL=index.js.map

package/cjs/graphics/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/graphics/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AACA,0CAAwB;AAGxB,8CAA4B;AAE5B,+CAA6B;AAE7B,4CAA0B;AAE1B,wCAAsB;AAEtB,yCAAuB;AAEvB,gDAA8B","file":"index.js","sourcesContent":["// image\nexport * from './image';\n\n// computer geometry algorithm, cgs.js\nexport * from './algorithm';\n\nexport * from './graph-util';\n\nexport * from './polygon';\n\nexport * from './arc';\n\nexport * from './text';\n\nexport * from './bounds-util';\n"]}
+{"version":3,"sources":["../src/graphics/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,QAAQ;AACR,0CAAwB;AAExB,sCAAsC;AACtC,8CAA4B;AAE5B,+CAA6B;AAE7B,4CAA0B;AAE1B,wCAAsB;AAEtB,yCAAuB;AAEvB,gDAA8B","file":"index.js","sourcesContent":["// image\nexport * from './image';\n\n// computer geometry algorithm, cgs.js\nexport * from './algorithm';\n\nexport * from './graph-util';\n\nexport * from './polygon';\n\nexport * from './arc';\n\nexport * from './text';\n\nexport * from './bounds-util';\n"]}

package/cjs/graphics/polygon.d.ts

@@ -1,5 +1,17 @@
 import type { IPointLike } from '../data-structure';
+/**
+ * Return `true` if the given line (line `a`) and the given polygon
+ * are intersect.
+ * Note that we do not count colinear as intersect here because no
+ * requirement for that. We could do that if required in future.
+ */
 export declare function lineIntersectPolygon(a1x: number, a1y: number, a2x: number, a2y: number, points: IPointLike[]): boolean;
 export declare function polygonContainPoint(points: IPointLike[], x: number, y: number): boolean;
 export declare function isPointInLine(x0: number, y0: number, x1: number, y1: number, x: number, y: number): number;
+/**
+ * polygon图元之间是否相交
+ * @param pointsA 图元A的points
+ * @param pointsB 图元B的points
+ * @returns 是否相交
+ */
 export declare function polygonIntersectPolygon(pointsA: IPointLike[], pointsB: IPointLike[]): boolean;

package/cjs/graphics/polygon.js

@@ -6,6 +6,14 @@ Object.defineProperty(exports, "__esModule", {
 
 const algorithm_1 = require("./algorithm"), EPSILON = 1e-8;
 
+// Adapted from https://github.com/apache/echarts/blob/master/src/util/graphic.ts by striezel
+// License: https://github.com/apache/echarts/blob/master/LICENSE
+/**
+ * Return `true` if the given line (line `a`) and the given polygon
+ * are intersect.
+ * Note that we do not count colinear as intersect here because no
+ * requirement for that. We could do that if required in future.
+ */
 function lineIntersectPolygon(a1x, a1y, a2x, a2y, points) {
     for (let i = 0, p2 = points[points.length - 1]; i < points.length; i++) {
         const p = points[i];
@@ -15,6 +23,8 @@ function lineIntersectPolygon(a1x, a1y, a2x, a2y, points) {
     return !1;
 }
 
+// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang
+// License: https://github.com/ecomfe/zrender/blob/master/LICENSE
 function polygonContainPoint(points, x, y) {
     let w = 0, p = points[0];
     if (!p) return !1;
@@ -22,26 +32,39 @@ function polygonContainPoint(points, x, y) {
         const p2 = points[i];
         w += isPointInLine(p.x, p.y, p2.x, p2.y, x, y), p = p2;
     }
-    const p0 = points[0];
+    // Close polygon
+        const p0 = points[0];
     return isAroundEqual(p.x, p0.x) && isAroundEqual(p.y, p0.y) || (w += isPointInLine(p.x, p.y, p0.x, p0.y, x, y)), 
     0 !== w;
 }
 
+// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/windingLine.ts by pissang
+// License: https://github.com/ecomfe/zrender/blob/master/LICENSE
 function isPointInLine(x0, y0, x1, y1, x, y) {
     if (y > y0 && y > y1 || y < y0 && y < y1) return 0;
-    if (y1 === y0) return 0;
+    // Ignore horizontal line
+        if (y1 === y0) return 0;
     const t = (y - y0) / (y1 - y0);
     let dir = y1 < y0 ? 1 : -1;
-    1 !== t && 0 !== t || (dir = y1 < y0 ? .5 : -.5);
+    // Avoid winding error when intersection point is the connect point of two line of polygon
+        1 !== t && 0 !== t || (dir = y1 < y0 ? .5 : -.5);
     const x_ = t * (x1 - x0) + x0;
-    return x_ === x ? 1 / 0 : x_ > x ? dir : 0;
+    // If (x, y) on the line, considered as "contain".
+        return x_ === x ? 1 / 0 : x_ > x ? dir : 0;
 }
 
+// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang
+// License: https://github.com/ecomfe/zrender/blob/master/LICENSE
 function isAroundEqual(a, b) {
     return Math.abs(a - b) < EPSILON;
 }
 
-function polygonIntersectPolygon(pointsA, pointsB) {
+/**
+ * polygon图元之间是否相交
+ * @param pointsA 图元A的points
+ * @param pointsB 图元B的points
+ * @returns 是否相交
+ */ function polygonIntersectPolygon(pointsA, pointsB) {
     for (let i = 0; i < pointsB.length; i++) {
         if (polygonContainPoint(pointsA, pointsB[i].x, pointsB[i].y)) return !0;
         if (i > 0 && lineIntersectPolygon(pointsB[i - 1].x, pointsB[i - 1].y, pointsB[i].x, pointsB[i].y, pointsA)) return !0;

package/cjs/graphics/polygon.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/graphics/polygon.ts"],"names":[],"mappings":";;;AACA,2CAA0C;AAE1C,MAAM,OAAO,GAAG,IAAI,CAAC;AAUrB,SAAgB,oBAAoB,CAClC,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,MAAoB;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAA,uBAAW,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;YACjE,OAAO,IAAI,CAAC;SACb;QACD,EAAE,GAAG,CAAC,CAAC;KACR;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAfD,oDAeC;AAID,SAAgB,mBAAmB,CAAC,MAAoB,EAAE,CAAS,EAAE,CAAS;IAC5E,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,CAAC,CAAC,EAAE;QACN,OAAO,KAAK,CAAC;KACd;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC,GAAG,EAAE,CAAC;KACR;IAGD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;QAC1D,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KAChD;IAED,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AArBD,kDAqBC;AAID,SAAgB,aAAa,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,CAAS;IAChG,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE;QAC5C,OAAO,CAAC,CAAC;KACV;IAED,IAAI,EAAE,KAAK,EAAE,EAAE;QACb,OAAO,CAAC,CAAC;KACV;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAE/B,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QACtB,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KAC5B;IAED,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAG9B,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AApBD,sCAoBC;AAID,SAAS,aAAa,CAAC,CAAS,EAAE,CAAS;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;AACnC,CAAC;AAQD,SAAgB,uBAAuB,CAAC,OAAqB,EAAE,OAAqB;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC5D,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;YAC1G,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAVD,0DAUC","file":"polygon.js","sourcesContent":["import type { IPointLike } from '../data-structure';\nimport { isIntersect } from './algorithm';\n\nconst EPSILON = 1e-8;\n\n// Adapted from https://github.com/apache/echarts/blob/master/src/util/graphic.ts by striezel\n// License: https://github.com/apache/echarts/blob/master/LICENSE\n/**\n * Return `true` if the given line (line `a`) and the given polygon\n * are intersect.\n * Note that we do not count colinear as intersect here because no\n * requirement for that. We could do that if required in future.\n */\nexport function lineIntersectPolygon(\n  a1x: number,\n  a1y: number,\n  a2x: number,\n  a2y: number,\n  points: IPointLike[]\n): boolean {\n  for (let i = 0, p2 = points[points.length - 1]; i < points.length; i++) {\n    const p = points[i];\n    if (isIntersect([a1x, a1y], [a2x, a2y], [p.x, p.y], [p2.x, p2.y])) {\n      return true;\n    }\n    p2 = p;\n  }\n  return false;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nexport function polygonContainPoint(points: IPointLike[], x: number, y: number) {\n  let w = 0;\n  let p = points[0];\n\n  if (!p) {\n    return false;\n  }\n\n  for (let i = 1; i < points.length; i++) {\n    const p2 = points[i];\n    w += isPointInLine(p.x, p.y, p2.x, p2.y, x, y);\n    p = p2;\n  }\n\n  // Close polygon\n  const p0 = points[0];\n  if (!isAroundEqual(p.x, p0.x) || !isAroundEqual(p.y, p0.y)) {\n    w += isPointInLine(p.x, p.y, p0.x, p0.y, x, y);\n  }\n\n  return w !== 0;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/windingLine.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nexport function isPointInLine(x0: number, y0: number, x1: number, y1: number, x: number, y: number): number {\n  if ((y > y0 && y > y1) || (y < y0 && y < y1)) {\n    return 0;\n  }\n  // Ignore horizontal line\n  if (y1 === y0) {\n    return 0;\n  }\n  const t = (y - y0) / (y1 - y0);\n\n  let dir = y1 < y0 ? 1 : -1;\n  // Avoid winding error when intersection point is the connect point of two line of polygon\n  if (t === 1 || t === 0) {\n    dir = y1 < y0 ? 0.5 : -0.5;\n  }\n\n  const x_ = t * (x1 - x0) + x0;\n\n  // If (x, y) on the line, considered as \"contain\".\n  return x_ === x ? Infinity : x_ > x ? dir : 0;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nfunction isAroundEqual(a: number, b: number): boolean {\n  return Math.abs(a - b) < EPSILON;\n}\n\n/**\n * polygon图元之间是否相交\n * @param pointsA 图元A的points\n * @param pointsB 图元B的points\n * @returns 是否相交\n */\nexport function polygonIntersectPolygon(pointsA: IPointLike[], pointsB: IPointLike[]) {\n  for (let i = 0; i < pointsB.length; i++) {\n    if (polygonContainPoint(pointsA, pointsB[i].x, pointsB[i].y)) {\n      return true;\n    }\n    if (i > 0 && lineIntersectPolygon(pointsB[i - 1].x, pointsB[i - 1].y, pointsB[i].x, pointsB[i].y, pointsA)) {\n      return true;\n    }\n  }\n  return false;\n}\n"]}
+{"version":3,"sources":["../src/graphics/polygon.ts"],"names":[],"mappings":";;;AACA,2CAA0C;AAE1C,MAAM,OAAO,GAAG,IAAI,CAAC;AAErB,6FAA6F;AAC7F,iEAAiE;AACjE;;;;;GAKG;AACH,SAAgB,oBAAoB,CAClC,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,MAAoB;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAA,uBAAW,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;YACjE,OAAO,IAAI,CAAC;SACb;QACD,EAAE,GAAG,CAAC,CAAC;KACR;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAfD,oDAeC;AAED,+FAA+F;AAC/F,iEAAiE;AACjE,SAAgB,mBAAmB,CAAC,MAAoB,EAAE,CAAS,EAAE,CAAS;IAC5E,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,CAAC,CAAC,EAAE;QACN,OAAO,KAAK,CAAC;KACd;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC,GAAG,EAAE,CAAC;KACR;IAED,gBAAgB;IAChB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;QAC1D,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;KAChD;IAED,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AArBD,kDAqBC;AAED,mGAAmG;AACnG,iEAAiE;AACjE,SAAgB,aAAa,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,CAAS;IAChG,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE;QAC5C,OAAO,CAAC,CAAC;KACV;IACD,yBAAyB;IACzB,IAAI,EAAE,KAAK,EAAE,EAAE;QACb,OAAO,CAAC,CAAC;KACV;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAE/B,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,0FAA0F;IAC1F,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QACtB,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KAC5B;IAED,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAE9B,kDAAkD;IAClD,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AApBD,sCAoBC;AAED,+FAA+F;AAC/F,iEAAiE;AACjE,SAAS,aAAa,CAAC,CAAS,EAAE,CAAS;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;AACnC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,uBAAuB,CAAC,OAAqB,EAAE,OAAqB;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC5D,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;YAC1G,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAVD,0DAUC","file":"polygon.js","sourcesContent":["import type { IPointLike } from '../data-structure';\nimport { isIntersect } from './algorithm';\n\nconst EPSILON = 1e-8;\n\n// Adapted from https://github.com/apache/echarts/blob/master/src/util/graphic.ts by striezel\n// License: https://github.com/apache/echarts/blob/master/LICENSE\n/**\n * Return `true` if the given line (line `a`) and the given polygon\n * are intersect.\n * Note that we do not count colinear as intersect here because no\n * requirement for that. We could do that if required in future.\n */\nexport function lineIntersectPolygon(\n  a1x: number,\n  a1y: number,\n  a2x: number,\n  a2y: number,\n  points: IPointLike[]\n): boolean {\n  for (let i = 0, p2 = points[points.length - 1]; i < points.length; i++) {\n    const p = points[i];\n    if (isIntersect([a1x, a1y], [a2x, a2y], [p.x, p.y], [p2.x, p2.y])) {\n      return true;\n    }\n    p2 = p;\n  }\n  return false;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nexport function polygonContainPoint(points: IPointLike[], x: number, y: number) {\n  let w = 0;\n  let p = points[0];\n\n  if (!p) {\n    return false;\n  }\n\n  for (let i = 1; i < points.length; i++) {\n    const p2 = points[i];\n    w += isPointInLine(p.x, p.y, p2.x, p2.y, x, y);\n    p = p2;\n  }\n\n  // Close polygon\n  const p0 = points[0];\n  if (!isAroundEqual(p.x, p0.x) || !isAroundEqual(p.y, p0.y)) {\n    w += isPointInLine(p.x, p.y, p0.x, p0.y, x, y);\n  }\n\n  return w !== 0;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/windingLine.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nexport function isPointInLine(x0: number, y0: number, x1: number, y1: number, x: number, y: number): number {\n  if ((y > y0 && y > y1) || (y < y0 && y < y1)) {\n    return 0;\n  }\n  // Ignore horizontal line\n  if (y1 === y0) {\n    return 0;\n  }\n  const t = (y - y0) / (y1 - y0);\n\n  let dir = y1 < y0 ? 1 : -1;\n  // Avoid winding error when intersection point is the connect point of two line of polygon\n  if (t === 1 || t === 0) {\n    dir = y1 < y0 ? 0.5 : -0.5;\n  }\n\n  const x_ = t * (x1 - x0) + x0;\n\n  // If (x, y) on the line, considered as \"contain\".\n  return x_ === x ? Infinity : x_ > x ? dir : 0;\n}\n\n// Adapted from https://github.com/ecomfe/zrender/blob/master/src/contain/polygon.ts by pissang\n// License: https://github.com/ecomfe/zrender/blob/master/LICENSE\nfunction isAroundEqual(a: number, b: number): boolean {\n  return Math.abs(a - b) < EPSILON;\n}\n\n/**\n * polygon图元之间是否相交\n * @param pointsA 图元A的points\n * @param pointsB 图元B的points\n * @returns 是否相交\n */\nexport function polygonIntersectPolygon(pointsA: IPointLike[], pointsB: IPointLike[]) {\n  for (let i = 0; i < pointsB.length; i++) {\n    if (polygonContainPoint(pointsA, pointsB[i].x, pointsB[i].y)) {\n      return true;\n    }\n    if (i > 0 && lineIntersectPolygon(pointsB[i - 1].x, pointsB[i - 1].y, pointsB[i].x, pointsB[i].y, pointsA)) {\n      return true;\n    }\n  }\n  return false;\n}\n"]}

package/cjs/graphics/text/measure/interface.d.ts

@@ -1,4 +1,11 @@
 import type { IBounds } from '../../../data-structure';
+/**
+ * 文本估算方法
+ * simple：完全不调用 vrender，快速文本大小估算，速度最快、最粗糙
+ * canvas：调用原生 canvas 的文本大小估算，宽度较精准，高度为估算
+ * vrender：调用 vrender 的文本大小估算，速度最慢、最精细
+ * quick（默认）：部分调用 vrender 的文本大小估算，速度和精确度平衡
+ */
 export type TextMeasureMethod = 'simple' | 'quick' | 'canvas' | 'vrender';
 export interface ITextSize {
     width: number;
@@ -13,6 +20,7 @@ export interface ITextFontParams {
     fontSize: number;
     fontFamily: string;
 }
+/** 文本测量需要用到的text spec */
 export interface ITextMeasureSpec extends Partial<ITextFontParams> {
     fontSize: number;
     fontFamily: string;
@@ -25,9 +33,13 @@ export interface ITextMeasureSpec extends Partial<ITextFontParams> {
     lineHeight?: number | string;
 }
 export interface ITextMeasureOption {
+    /** 默认字体属性 */
     defaultFontParams?: Partial<ITextFontParams>;
+    /** 特殊字符集 */
     specialCharSet?: string;
+    /** 来自 vrender 的测量方法 */
     getTextBounds?: (params: any) => IBounds;
+    /** 外部获取 canvas 的方法（小组件工作台移动端无法创建公共canvas，需要传入） */
     getCanvasForMeasure?: () => any;
 }
 export type TextMeasureInput = number | string | (number | string)[];