@realsee/dnalogel 3.63.4-alpha.4 → 3.64.0

package/libs/GuideLinePlugin/typing.d.ts

@@ -2,10 +2,29 @@ import type GuideLinePlugin from '.';
 import type { RequireAtLeastOne } from 'type-fest';
 import type * as BasePluginWithData from '../base/BasePluginWithData';
 import type { Tag } from '../PanoTagPlugin';
-export interface RouteConfig {
+export type RouteConfig = {
+    /**
+     * @description 箭头贴图
+     */
     arrowTextureUrl?: string;
+    /**
+     * @description 单位箭头宽度，单位：米
+     */
     unitWidth?: number;
+    /**
+     * @description 单位箭头高度，单位：米
+     */
     unitHeight?: number;
+} & ExtraRouteData;
+export interface ExtraRouteData {
+    /**
+     * @description 预处理数据，用于优化路线生成效果
+     */
+    route_standing_positions?: number[][];
+    /**
+     * @description 预处理数据，用于优化路线生成效果
+     */
+    node_pair_to_route_points?: Record<string, number[][]>;
 }
 export interface Route extends RouteConfig {
     id?: number;
@@ -82,7 +101,7 @@ export type GuideLineItem = RequireAtLeastOne<{
     panorama_style?: PanoramaGuideLineStyle;
     /** 模型态使用的数据 */
     model_style?: ModelGuideLineStyle;
-}, 'id' | 'render_id'>;
+} & ExtraRouteData, 'id' | 'render_id'>;
 /** 全景路径样式 */
 export interface PanoramaGuideLineStyle extends GuideLineStyle {
     start_tag?: Tag;
@@ -177,6 +196,4 @@ export interface CatmullRomCurve3 {
     closed?: boolean;
     curve_type?: string;
     tension?: number;
-    panoIndexList?: number[];
-    panoIndexMap?: Record<number, number>;
 }

package/libs/GuideLinePlugin/utils/createLineGeometry.d.ts

@@ -22,17 +22,7 @@ export declare function createLineGeometry(options: LineGeometryOption): {
     maxV: number;
     curvePath: any;
     curvePoints: any;
-    panoMap: {};
     animationWillError?: undefined;
-    totalLength?: undefined;
-} | {
-    geometry: THREE.BufferGeometry;
-    maxV: number;
-    curvePath: any;
-    curvePoints: any;
-    panoMap?: undefined;
-    animationWillError?: undefined;
-    totalLength?: undefined;
 } | {
     geometry: THREE.BufferGeometry;
     maxV: number;
@@ -42,7 +32,5 @@ export declare function createLineGeometry(options: LineGeometryOption): {
     }[];
     curvePath: THREE.CurvePath<THREE.Vector3>;
     curvePoints: THREE.Vector3[];
-    panoMap: Record<number, number>;
-    totalLength: number;
 };
 export {};

package/libs/GuideLinePlugin/utils/createLineGeometry.js

@@ -1,151 +1,115 @@
-import * as r from "three";
-import { Vector3 as ot } from "three";
-import { polylineNormals as at } from "../../vendor/polyline-normals/index.js";
-import { lineIsIntersecting as ut, findIntersectingOfLines as ft } from "../../shared-utils/math/intersecting.js";
+import * as i from "three";
+import { Vector3 as J } from "three";
+import { polylineNormals as ot } from "../../vendor/polyline-normals/index.js";
+import { lineIsIntersecting as rt, findIntersectingOfLines as it } from "../../shared-utils/math/intersecting.js";
 import "../../vendor/polyline-miter-util/index.js";
 import "../../vendor/gl-vec2/add.js";
 import "../../vendor/gl-vec2/set.js";
 import "../../vendor/gl-vec2/normalize.js";
 import "../../vendor/gl-vec2/subtract.js";
 import "../../vendor/gl-vec2/dot.js";
-const ht = 2, mt = 3, pt = 3, dt = 2;
-function Vt(i) {
-  const O = i.width, N = i.unitLength, b = O / 2, G = i.path;
-  if (G.length === 0)
-    return { geometry: new r.BufferGeometry(), maxV: 0, curvePath: null, curvePoints: null, panoMap: {} };
-  const A = new r.CurvePath();
-  G.forEach((t) => {
-    const n = xt(t);
-    n && A.add(n);
+const st = 2, ct = 3, lt = 3, ut = 2;
+function Rt(s) {
+  const T = s.width, v = s.unitLength, y = T / 2, U = s.path;
+  if (U.length === 0)
+    return { geometry: new i.BufferGeometry(), maxV: 0, curvePath: null, curvePoints: null };
+  const p = new i.CurvePath();
+  U.forEach((t) => {
+    const o = at(t);
+    o && p.add(o);
   });
-  const q = Math.ceil(A.getLength() * 100);
-  A.arcLengthDivisions = q;
-  const P = A.getPoints(q), x = P.length;
-  if (x <= 2)
-    return { geometry: new r.BufferGeometry(), maxV: 0, curvePath: null, curvePoints: null };
-  const st = at(P.map((t) => [t.x, t.z])), ct = (x - 1) * ht * mt, j = 2 * x, it = j * pt, rt = j * dt, v = new Uint32Array(ct), e = new Float32Array(it), T = new Float32Array(rt), J = A.getLength();
-  let I = 0, K = 0, Q = {};
-  const k = i.path[0].points.map((t) => new r.Vector3().fromArray(t)), W = i.path[0].panoIndexList ? [...i.path[0].panoIndexList] : void 0, tt = (() => {
-    const t = [];
-    for (let s = 0; s < k.length; s++) {
-      const u = k[s];
-      if (s === 0)
-        t.push(0);
-      else {
-        const m = k[s - 1];
-        t.push(u.distanceTo(m) + t[s - 1]);
-      }
-    }
-    const n = t[t.length - 1], d = [];
-    for (let s = 0; s < t.length; s++) {
-      const u = t[s], m = s === 0 ? 0 : t[s - 1], y = s === t.length - 1 ? n : t[s + 1], l = u - Math.min(0.3, (u - m) / 2), a = u + Math.min(0.3, (y - u) / 2);
-      d.push([J * (l / n), J * (a / n)]);
-    }
-    return d;
-  })();
-  let S = [];
-  for (let t = 0; t < x; t++) {
-    const [n, d] = st[t][0], s = P[t], { x: u, y: m, z: y } = s, l = new ot(u + n * b, m + 0.05, y + d * b);
-    e[t * 6 + 0] = l.x, e[t * 6 + 1] = l.y, e[t * 6 + 2] = l.z;
-    const a = new ot(u - n * b, m + 0.05, y - d * b);
-    e[t * 6 + 3] = a.x, e[t * 6 + 4] = a.y, e[t * 6 + 5] = a.z, I += t > 0 ? P[t - 1].clone().sub(P[t]).length() : 0;
-    const R = I / N;
-    K = R, T[t * 4 + 0] = 0, T[t * 4 + 1] = R, T[t * 4 + 2] = 1, T[t * 4 + 3] = R;
-    const _ = new r.Vector3().lerpVectors(l, a, 0.5);
-    if (i.skipPositions && i.skipPositions.some((B) => B.distanceTo(_) < 0.26))
-      continue;
-    const L = k[0];
-    if (i.useAutoDepthTest && L && W) {
-      const f = W[0], [B, C] = tt[0];
-      if (I > B && I < C && S.push({
-        distance: L.distanceTo(_),
-        index: t
-      }), I >= C || t === x - 1) {
-        const E = Math.min(...S.map((c) => c.distance)), D = S.find((c) => c.distance === E);
-        if (S = [], k.shift(), W.shift(), tt.shift(), D)
-          Q[f] = D.index;
-        else {
-          console.error(`can not find the min distance ${f}`);
-          continue;
-        }
-      }
-    }
-    t !== x - 1 && (v[t * 6 + 0] = t * 2 + 0, v[t * 6 + 1] = t * 2 + 2, v[t * 6 + 2] = t * 2 + 1, v[t * 6 + 3] = t * 2 + 2, v[t * 6 + 4] = t * 2 + 3, v[t * 6 + 5] = t * 2 + 1);
+  const O = Math.ceil(p.getLength() * 100);
+  p.arcLengthDivisions = O;
+  const g = p.getPoints(O), m = g.length;
+  if (m <= 2)
+    return { geometry: new i.BufferGeometry(), maxV: 0, curvePath: null, curvePoints: null };
+  const K = ot(g.map((t) => [t.x, t.z])), Q = (m - 1) * st * ct, Y = 2 * m, $ = Y * lt, tt = Y * ut, x = new Uint32Array(Q), e = new Float32Array($), V = new Float32Array(tt);
+  let j = 0, W = 0;
+  for (let t = 0; t < m; t++) {
+    const [o, E] = K[t][0], N = g[t], { x: w, y: R, z: b } = N, c = new J(w + o * y, R + 0.05, b + E * y);
+    e[t * 6 + 0] = c.x, e[t * 6 + 1] = c.y, e[t * 6 + 2] = c.z;
+    const l = new J(w - o * y, R + 0.05, b - E * y);
+    e[t * 6 + 3] = l.x, e[t * 6 + 4] = l.y, e[t * 6 + 5] = l.z, j += t > 0 ? g[t - 1].clone().sub(g[t]).length() : 0;
+    const A = j / v;
+    W = A, V[t * 4 + 0] = 0, V[t * 4 + 1] = A, V[t * 4 + 2] = 1, V[t * 4 + 3] = A;
+    const _ = new i.Vector3().lerpVectors(c, l, 0.5);
+    s.skipPositions && s.skipPositions.some((f) => f.distanceTo(_) < 0.26) || t !== m - 1 && (x[t * 6 + 0] = t * 2 + 0, x[t * 6 + 1] = t * 2 + 2, x[t * 6 + 2] = t * 2 + 1, x[t * 6 + 3] = t * 2 + 2, x[t * 6 + 4] = t * 2 + 3, x[t * 6 + 5] = t * 2 + 1);
   }
-  const h = [];
-  let H;
-  const Z = [];
-  for (let t = 0; t < x - 1; t++) {
-    if (H !== void 0 && t <= H)
+  const u = [];
+  let S;
+  const X = [];
+  for (let t = 0; t < m - 1; t++) {
+    if (S !== void 0 && t <= S)
       continue;
-    const n = t + 1, d = {
+    const o = t + 1, E = {
       x: e[t * 6 + 0],
       y: e[t * 6 + 2]
-    }, s = {
+    }, N = {
       x: e[t * 6 + 3],
       y: e[t * 6 + 5]
-    }, u = {
-      x: e[n * 6 + 0],
-      y: e[n * 6 + 2]
-    }, m = {
-      x: e[n * 6 + 3],
-      y: e[n * 6 + 5]
-    }, y = ut([d, s], [u, m]);
-    if (y && h.push(t), !y && h.length) {
-      h.push(t);
-      const l = new r.Vector2(d.x, d.y).distanceTo(new r.Vector2(u.x, u.y)), a = new r.Vector2(s.x, s.y).distanceTo(new r.Vector2(m.x, m.y)), R = 200, _ = [], L = [], f = Math.max(0, h[0] - N * R), B = h[0];
-      for (let c = f; c < B; c++)
-        l < a ? _.push({ x: e[c * 6 + 0], y: e[c * 6 + 2] }) : _.push({ x: e[c * 6 + 3], y: e[c * 6 + 5] });
-      const C = h[h.length - 1], E = h[h.length - 1] + N * R;
-      for (let c = C; c < E; c++)
-        l < a ? L.push({ x: e[c * 6 + 0], y: e[c * 6 + 2] }) : L.push({ x: e[c * 6 + 3], y: e[c * 6 + 5] });
-      const D = ft(_, L);
-      if (D) {
+    }, w = {
+      x: e[o * 6 + 0],
+      y: e[o * 6 + 2]
+    }, R = {
+      x: e[o * 6 + 3],
+      y: e[o * 6 + 5]
+    }, b = rt([E, N], [w, R]);
+    if (b && u.push(t), !b && u.length) {
+      u.push(t);
+      const c = new i.Vector2(E.x, E.y).distanceTo(new i.Vector2(w.x, w.y)), l = new i.Vector2(N.x, N.y).distanceTo(new i.Vector2(R.x, R.y)), A = 300, _ = [], k = [], f = Math.max(0, u[0] - v * A), et = u[0];
+      for (let r = f; r < et; r++)
+        c < l ? _.push({ x: e[r * 6 + 0], y: e[r * 6 + 2] }) : _.push({ x: e[r * 6 + 3], y: e[r * 6 + 5] });
+      const D = u[u.length - 1], L = Math.min(m - 1, u[u.length - 1] + v * A);
+      for (let r = D; r < L; r++)
+        c < l ? k.push({ x: e[r * 6 + 0], y: e[r * 6 + 2] }) : k.push({ x: e[r * 6 + 3], y: e[r * 6 + 5] });
+      const H = it(_, k);
+      if (H) {
         const {
-          line1RelativeIndex: c,
-          line2RelativeIndex: lt,
-          x: et,
-          y: nt
-        } = D, w = f + c, g = C + lt + 2;
-        for (let o = w; o < g; o++)
-          l < a ? (e[o * 6 + 0] = et, e[o * 6 + 2] = nt) : (e[o * 6 + 3] = et, e[o * 6 + 5] = nt), H = o;
-        let V, Y, X, z, p;
-        l < a ? (V = e[f * 6 + 1], Y = e[w * 6 + 1], X = e[g * 6 + 1], z = e[E * 6 + 1], p = (Y + X) / 2) : (V = e[f * 6 + 4], Y = e[w * 6 + 4], X = e[g * 6 + 4], z = e[E * 6 + 4], p = (Y + X) / 2);
-        for (let o = f; o < w; o++) {
-          const $ = w - f, F = (o - f) / $;
-          l < a ? e[o * 6 + 1] = V + (p - V) * F : e[o * 6 + 4] = V + (p - V) * F;
+          line1RelativeIndex: r,
+          line2RelativeIndex: nt,
+          x: Z,
+          y: q
+        } = H, d = f + r, h = D + nt + 2;
+        for (let n = d; n < h; n++)
+          c < l ? (e[n * 6 + 0] = Z, e[n * 6 + 2] = q) : (e[n * 6 + 3] = Z, e[n * 6 + 5] = q), S = n;
+        let P, F, G, M, a;
+        c < l ? (P = e[f * 6 + 1], F = e[d * 6 + 1], G = e[h * 6 + 1], M = e[L * 6 + 1], a = (F + G) / 2) : (P = e[f * 6 + 4], F = e[d * 6 + 4], G = e[h * 6 + 4], M = e[L * 6 + 4], a = (F + G) / 2);
+        for (let n = f; n < d; n++) {
+          const z = d - f, B = (n - f) / z;
+          c < l ? e[n * 6 + 1] = P + (a - P) * B : e[n * 6 + 4] = P + (a - P) * B;
         }
-        for (let o = w; o < g; o++)
-          l < a ? e[o * 6 + 1] = p : e[o * 6 + 4] = p;
-        for (let o = g; o < E; o++) {
-          const $ = E - g, F = (o - g + 1) / $;
-          l < a ? e[o * 6 + 1] = p + (z - p) * F : e[o * 6 + 4] = p + (z - p) * F;
+        for (let n = d; n < h; n++)
+          c < l ? e[n * 6 + 1] = a : e[n * 6 + 4] = a;
+        for (let n = h; n < L; n++) {
+          const z = L - h, B = (n - h + 1) / z;
+          c < l ? e[n * 6 + 1] = a + (M - a) * B : e[n * 6 + 4] = a + (M - a) * B;
         }
-        Z.push({
-          start: w,
-          end: g
+        X.push({
+          start: d,
+          end: h
         });
       }
-      h.length = 0;
+      u.length = 0;
     }
   }
-  const M = new Float32Array(j);
-  Z.forEach((t) => {
-    for (let n = 0; n < x - 1; n++)
-      n >= t.start && n <= t.end ? (M[n * 2 + 0] = 1, M[n * 2 + 1] = 1) : M[n] !== 1 && (M[n * 2 + 0] = 0, M[n * 2 + 1] = 0);
+  const I = new Float32Array(Y);
+  X.forEach((t) => {
+    for (let o = 0; o < m - 1; o++)
+      o >= t.start && o <= t.end ? (I[o * 2 + 0] = 1, I[o * 2 + 1] = 1) : I[o] !== 1 && (I[o * 2 + 0] = 0, I[o * 2 + 1] = 0);
   });
-  const U = new r.BufferGeometry();
-  return U.setAttribute("position", new r.BufferAttribute(e, 3)), U.setAttribute("uv", new r.BufferAttribute(T, 2)), U.setIndex(new r.BufferAttribute(v, 1)), { geometry: U, maxV: K, animationWillError: Z, curvePath: A, curvePoints: P, panoMap: Q, totalLength: I };
+  const C = new i.BufferGeometry();
+  return C.setAttribute("position", new i.BufferAttribute(e, 3)), C.setAttribute("uv", new i.BufferAttribute(V, 2)), C.setIndex(new i.BufferAttribute(x, 1)), { geometry: C, maxV: W, animationWillError: X, curvePath: p, curvePoints: g };
 }
-function xt(i) {
-  if (gt(i)) {
-    const O = [i.closed, i.curve_type, i.tension], N = i.points.map((G) => new r.Vector3().fromArray(G));
-    return new r.CatmullRomCurve3(N, ...O);
+function at(s) {
+  var T, v;
+  if (ft(s)) {
+    const y = s.points.map((p) => new i.Vector3().fromArray(p));
+    return new i.CatmullRomCurve3(y, (T = s.closed) != null ? T : !1, (v = s.curve_type) != null ? v : "centripetal", s.tension);
   }
 }
-function gt(i) {
-  return i.type === "CatmullRomCurve3";
+function ft(s) {
+  return s.type === "CatmullRomCurve3";
 }
 export {
-  Vt as createLineGeometry
+  Rt as createLineGeometry
 };

package/libs/GuideLinePlugin/utils/createPath.d.ts

@@ -0,0 +1,3 @@
+import type { Work } from '@realsee/five';
+import type { CatmullRomCurve3, ExtraRouteData } from '../typing';
+export declare function createPath(panoIndexList: number[], work: Work, options?: Omit<CatmullRomCurve3, 'type' | 'points'> & ExtraRouteData): CatmullRomCurve3[];

package/libs/GuideLinePlugin/utils/createPath.js

@@ -0,0 +1,33 @@
+var A = Object.defineProperty;
+var h = Object.getOwnPropertySymbols;
+var C = Object.prototype.hasOwnProperty, R = Object.prototype.propertyIsEnumerable;
+var y = (e, t, r) => t in e ? A(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, E = (e, t) => {
+  for (var r in t || (t = {}))
+    C.call(t, r) && y(e, r, t[r]);
+  if (h)
+    for (var r of h(t))
+      R.call(t, r) && y(e, r, t[r]);
+  return e;
+};
+import * as b from "three";
+import { transformPosition as d } from "../../shared-utils/five/transformPosition.js";
+function V(e, t, r) {
+  if (e.length < 2)
+    return [];
+  const c = [];
+  e.forEach((a, g) => {
+    var i, u, _, o, l, n;
+    let f = (i = r == null ? void 0 : r.route_standing_positions) == null ? void 0 : i[a];
+    if (f || (f = t.observers[a].standingPosition.toArray()), !f)
+      return;
+    const m = e[g - 1], s = (n = (_ = (u = r == null ? void 0 : r.node_pair_to_route_points) == null ? void 0 : u[`${m}:${a}`]) == null ? void 0 : _.slice()) != null ? n : (l = (o = r == null ? void 0 : r.node_pair_to_route_points) == null ? void 0 : o[`${a}:${m}`]) == null ? void 0 : l.slice().reverse();
+    s == null || s.forEach((v) => {
+      c.push(v);
+    }), c.push(f);
+  });
+  const P = t.transform, $ = c.map((a) => d(new b.Vector3().fromArray(a), P).toArray());
+  return [E({ type: "CatmullRomCurve3", points: $ }, r)];
+}
+export {
+  V as createPath
+};

package/libs/GuideLinePlugin/utils/index.d.ts

@@ -1,10 +1,3 @@
-import type { GuideLineModeItem } from '../GuideLineModeItem';
-import type * as PluginType from '../typing';
-export declare function updateGuideLineModeItemByData(options: {
-    item: GuideLineModeItem;
-    data: PluginType.GuideLineItem;
-    mode: PluginType.GuideLineModeItemMode;
-}): void;
 /**
  * 筛选出给定数组中，相邻元素不能重复的元素组成的新数组
  * @param array 要筛选的数组

package/libs/GuideLinePlugin/utils/index.js

@@ -1,14 +1,6 @@
-function s(e) {
-  const t = e.data, o = e.item, a = e.mode === "panorama" ? t.panorama_style : t.model_style;
-  if (!a)
-    return;
-  const r = t.path, n = a, i = a;
-  t.path ? o.setGeometryByPath(r, n) : t.pano_group && o.setGeometryByPanoGroup(t.pano_group, n), o.setMartial(i);
-}
-function l(e) {
-  return e.length === 0 ? [] : e.filter((t, o) => t !== e[o - 1]);
+function i(t) {
+  return t.length === 0 ? [] : t.filter((e, n) => e !== t[n - 1]);
 }
 export {
-  l as filterAdjacentDistinct,
-  s as updateGuideLineModeItemByData
+  i as filterAdjacentDistinct
 };

package/libs/MeasurePlugin/Controller.d.ts

@@ -1,5 +1,4 @@
 import type { Five } from '@realsee/five';
-import { PointSelector } from '../shared-utils';
 import { type PolygonStyle } from '../Sculpt/Meshes/Polygon';
 import { Subscribe } from '../shared-utils/Subscribe';
 import type { LineMeshStyle } from '../Sculpt/typings';
@@ -13,13 +12,12 @@ export declare class MeasureController extends Subscribe<Event> {
     private five;
     private group;
     private currentMeasureMesh?;
-    get pointSelector(): PointSelector;
+    private get pointSelector();
     private _pointSelector;
     private get fiveDomEvents();
     private _fiveDomEvents;
     private get cursor();
     private _cursor;
-    private unbindHotKey;
     constructor(five: Five);
     /**
      * @description 开始测量
@@ -29,10 +27,6 @@ export declare class MeasureController extends Subscribe<Event> {
      * @description 结束测量
      */
     endMeasure: () => void;
-    /**
-     * @description 取消本次测量
-     */
-    cancel: () => void;
     /**
      * @description 撤销上一步
      */
@@ -42,11 +36,7 @@ export declare class MeasureController extends Subscribe<Event> {
      */
     clear: () => void;
     dispose: () => void;
-    private addEventListener;
-    private removeEventListener;
     private onClick;
-    private onHover;
-    private onUnHover;
     private updateSelectAdsorbedHelper;
 }
 export {};