@itwin/core-geometry 5.7.2 → 5.8.0-dev.10

package/lib/esm/curve/Path.d.ts

@@ -1,8 +1,9 @@
+/** @packageDocumentation
+ * @module Curve
+ */
 import { GeometryHandler } from "../geometry3d/GeometryHandler";
 import { Point3d } from "../geometry3d/Point3dVector3d";
 import { CurveChain } from "./CurveCollection";
-import { VariantCurveExtendParameter } from "./CurveExtendMode";
-import { CurveLocationDetail } from "./CurveLocationDetail";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { RecursiveCurveProcessor } from "./CurveProcessor";
 import { GeometryQuery } from "./GeometryQuery";
@@ -29,24 +30,12 @@ export declare class Path extends CurveChain {
      */
     static create(...curves: Array<CurvePrimitive | Point3d[]>): Path;
     /**
-     * Create a path from a an array of curve primitives.
+     * Create a path from an array of curve primitives.
      * @param curves array of individual curve primitives.
      */
     static createArray(curves: CurvePrimitive[]): Path;
     /** Return a deep copy, with leaf-level curve primitives stroked. */
     cloneStroked(options?: StrokeOptions): Path;
-    /**
-     * Return the closest point on the contained curves.
-     * @param spacePoint point in space.
-     * @param extend compute the closest point to the path extended according to variant type:
-     * * false: do not extend the path
-     * * true: extend the path at both start and end
-     * * CurveExtendOptions: extend the path in the specified manner at both start and end
-     * * CurveExtendOptions[]: first entry applies to path start; second, to path end; any other entries ignored
-     * @param result optional pre-allocated detail to populate and return.
-     * @returns details of the closest point.
-     */
-    closestPoint(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail): CurveLocationDetail | undefined;
     /** Return the boundary type (1) of a corresponding MicroStation CurveVector */
     dgnBoundaryType(): number;
     /** Clone as a new `Path` with no primitives */

package/lib/esm/curve/Path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Path.d.ts","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAuC,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AACrG,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;GAKG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,+BAA+B;;IAI/B;;;;OAIG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI;IAaxE;;;OAGG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAGzD,oEAAoE;IAC7D,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAMlD;;;;;;;;;;OAUG;IACa,YAAY,CAC1B,UAAU,EAAE,OAAO,EAAE,MAAM,GAAE,2BAAmC,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAC7F,mBAAmB,GAAG,SAAS;IAiBlC,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,+CAA+C;IACxC,cAAc,IAAI,IAAI;IAG7B,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
+{"version":3,"file":"Path.d.ts","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;GAKG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,+BAA+B;;IAI/B;;;;OAIG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI;IAaxE;;;OAGG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAGzD,oEAAoE;IAC7D,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAMlD,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,+CAA+C;IACxC,cAAc,IAAI,IAAI;IAG7B,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/esm/curve/Path.js

@@ -2,15 +2,9 @@
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Curve
- */
-import { assert } from "@itwin/core-bentley";
 import { Point3d } from "../geometry3d/Point3dVector3d";
 import { CurveChainWithDistanceIndex } from "./CurveChainWithDistanceIndex";
 import { CurveChain } from "./CurveCollection";
-import { CurveExtendMode, CurveExtendOptions } from "./CurveExtendMode";
-import { CurveLocationDetail } from "./CurveLocationDetail";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { LineString3d } from "./LineString3d";
 /**
@@ -53,7 +47,7 @@ export class Path extends CurveChain {
         return result;
     }
     /**
-     * Create a path from a an array of curve primitives.
+     * Create a path from an array of curve primitives.
      * @param curves array of individual curve primitives.
      */
     static createArray(curves) {
@@ -66,34 +60,6 @@ export class Path extends CurveChain {
             curve.emitStrokes(strokes, options);
         return Path.create(strokes);
     }
-    /**
-     * Return the closest point on the contained curves.
-     * @param spacePoint point in space.
-     * @param extend compute the closest point to the path extended according to variant type:
-     * * false: do not extend the path
-     * * true: extend the path at both start and end
-     * * CurveExtendOptions: extend the path in the specified manner at both start and end
-     * * CurveExtendOptions[]: first entry applies to path start; second, to path end; any other entries ignored
-     * @param result optional pre-allocated detail to populate and return.
-     * @returns details of the closest point.
-     */
-    closestPoint(spacePoint, extend = false, result) {
-        let detailA;
-        const detailB = new CurveLocationDetail();
-        if (this.children !== undefined) {
-            for (let i = 0; i < this.children.length; i++) {
-                const child = this.children[i]; // head only extends at start; tail, only at end. NOTE: child may be both head and tail!
-                const mode0 = (i === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0) : CurveExtendMode.None;
-                const mode1 = (i === this.children.length - 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1) : CurveExtendMode.None;
-                if (child.closestPoint(spacePoint, [mode0, mode1], detailB)) {
-                    const smaller = CurveLocationDetail.chooseSmallerA(detailA, detailB);
-                    assert(undefined !== smaller, "expect defined because detailB is always defined");
-                    detailA = result = smaller.clone(result);
-                }
-            }
-        }
-        return detailA;
-    }
     /** Return the boundary type (1) of a corresponding MicroStation CurveVector */
     dgnBoundaryType() {
         return 1;

package/lib/esm/curve/Path.js.map

@@ -1 +1 @@
-{"version":3,"file":"Path.js","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAC5E,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAA+B,MAAM,mBAAmB,CAAC;AACrG,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;GAKG;AACH,MAAM,OAAO,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxB,mBAAmB,GAAG,MAAM,CAAC;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IAC/B;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAyC;QAC/D,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,2BAA2B;gBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAC1C,IAAI,KAAK,YAAY,cAAc;gBACtC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE,CAAC;gBACjF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,CAAC;IACD,oEAAoE;IAC7D,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD;;;;;;;;;;OAUG;IACa,YAAY,CAC1B,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,mBAAmB,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,wFAAwF;gBACxH,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;gBACnI,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;gBAC1J,IAAI,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;oBAC5D,MAAM,OAAO,GAAG,mBAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBACrE,MAAM,CAAC,SAAS,KAAK,OAAO,EAAE,kDAAkD,CAAC,CAAC;oBAClF,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+CAA+C;IACxC,cAAc;QACnB,OAAO,IAAI,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `Path` object is a collection of curves that join head-to-tail to form a path.\r\n * * A `Path` object does not bound a planar region. Use `Loop` to indicate region bounding.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class Path extends CurveChain {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"path\";\r\n  /** Test if `other` is an instance of `Path` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof Path;\r\n  }\r\n  /** Invoke `processor.announcePath(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announcePath(this, indexInParent);\r\n  }\r\n  /** Construct an empty path. */\r\n  public constructor() {\r\n    super();\r\n  }\r\n  /**\r\n   * Create a path from a variable length list of curve primitives\r\n   * * CurvePrimitive params are captured.\r\n   * @param curves variable length list of individual curve primitives or point arrays.\r\n   */\r\n  public static create(...curves: Array<CurvePrimitive | Point3d[]>): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      if (curve instanceof CurveChainWithDistanceIndex)\r\n        result.children.push(...curve.path.children);\r\n      else if (curve instanceof CurvePrimitive)\r\n        result.children.push(curve);\r\n      else if (Array.isArray(curve) && curve.length > 0 && curve[0] instanceof Point3d) {\r\n        result.children.push(LineString3d.create(curve));\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a path from a an array of curve primitives.\r\n   * @param curves array of individual curve primitives.\r\n   */\r\n  public static createArray(curves: CurvePrimitive[]): Path {\r\n    return this.create(...curves);\r\n  }\r\n  /** Return a deep copy, with leaf-level curve primitives stroked. */\r\n  public cloneStroked(options?: StrokeOptions): Path {\r\n    const strokes = LineString3d.create();\r\n    for (const curve of this.children)\r\n      curve.emitStrokes(strokes, options);\r\n    return Path.create(strokes);\r\n  }\r\n  /**\r\n   * Return the closest point on the contained curves.\r\n   * @param spacePoint point in space.\r\n   * @param extend compute the closest point to the path extended according to variant type:\r\n   * * false: do not extend the path\r\n   * * true: extend the path at both start and end\r\n   * * CurveExtendOptions: extend the path in the specified manner at both start and end\r\n   * * CurveExtendOptions[]: first entry applies to path start; second, to path end; any other entries ignored\r\n   * @param result optional pre-allocated detail to populate and return.\r\n   * @returns details of the closest point.\r\n   */\r\n  public override closestPoint(\r\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    const detailB = new CurveLocationDetail();\r\n    if (this.children !== undefined) {\r\n      for (let i = 0; i < this.children.length; i++) {\r\n        const child = this.children[i]; // head only extends at start; tail, only at end. NOTE: child may be both head and tail!\r\n        const mode0 = (i === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0) : CurveExtendMode.None;\r\n        const mode1 = (i === this.children.length - 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1) : CurveExtendMode.None;\r\n        if (child.closestPoint(spacePoint, [mode0, mode1], detailB)) {\r\n          const smaller = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n          assert(undefined !== smaller, \"expect defined because detailB is always defined\");\r\n          detailA = result = smaller.clone(result);\r\n        }\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /** Return the boundary type (1) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 1;\r\n  }\r\n  /** Clone as a new `Path` with no primitives */\r\n  public cloneEmptyPeer(): Path {\r\n    return new Path();\r\n  }\r\n  /** Second step of double dispatch: call `handler.handlePath(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handlePath(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"Path.js","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAC5E,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;GAKG;AACH,MAAM,OAAO,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxB,mBAAmB,GAAG,MAAM,CAAC;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IAC/B;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAyC;QAC/D,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,2BAA2B;gBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAC1C,IAAI,KAAK,YAAY,cAAc;gBACtC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE,CAAC;gBACjF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,CAAC;IACD,oEAAoE;IAC7D,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+CAA+C;IACxC,cAAc;QACnB,OAAO,IAAI,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `Path` object is a collection of curves that join head-to-tail to form a path.\r\n * * A `Path` object does not bound a planar region. Use `Loop` to indicate region bounding.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class Path extends CurveChain {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"path\";\r\n  /** Test if `other` is an instance of `Path` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof Path;\r\n  }\r\n  /** Invoke `processor.announcePath(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announcePath(this, indexInParent);\r\n  }\r\n  /** Construct an empty path. */\r\n  public constructor() {\r\n    super();\r\n  }\r\n  /**\r\n   * Create a path from a variable length list of curve primitives\r\n   * * CurvePrimitive params are captured.\r\n   * @param curves variable length list of individual curve primitives or point arrays.\r\n   */\r\n  public static create(...curves: Array<CurvePrimitive | Point3d[]>): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      if (curve instanceof CurveChainWithDistanceIndex)\r\n        result.children.push(...curve.path.children);\r\n      else if (curve instanceof CurvePrimitive)\r\n        result.children.push(curve);\r\n      else if (Array.isArray(curve) && curve.length > 0 && curve[0] instanceof Point3d) {\r\n        result.children.push(LineString3d.create(curve));\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a path from an array of curve primitives.\r\n   * @param curves array of individual curve primitives.\r\n   */\r\n  public static createArray(curves: CurvePrimitive[]): Path {\r\n    return this.create(...curves);\r\n  }\r\n  /** Return a deep copy, with leaf-level curve primitives stroked. */\r\n  public cloneStroked(options?: StrokeOptions): Path {\r\n    const strokes = LineString3d.create();\r\n    for (const curve of this.children)\r\n      curve.emitStrokes(strokes, options);\r\n    return Path.create(strokes);\r\n  }\r\n  /** Return the boundary type (1) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 1;\r\n  }\r\n  /** Clone as a new `Path` with no primitives */\r\n  public cloneEmptyPeer(): Path {\r\n    return new Path();\r\n  }\r\n  /** Second step of double dispatch: call `handler.handlePath(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handlePath(this);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.d.ts

@@ -16,6 +16,7 @@ export declare class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler i
     private _closestPoint;
     private _spacePoint;
     private _extend;
+    private _xyOnly;
     private _fractionA;
     private _functionA;
     private _fractionB;
@@ -25,7 +26,7 @@ export declare class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler i
     private _workRay;
     private _newtonSolver;
     /** Constructor */
-    constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail);
+    constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail, xyOnly?: boolean);
     claimResult(): CurveLocationDetail | undefined;
     needPrimaryGeometryForStrokes(): boolean;
     startCurvePrimitive(curve: CurvePrimitive | undefined): void;

package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ClosestPointStrokeHandler.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAGrE,OAAO,EAAsB,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,uBAAwB,YAAW,cAAc;IAC9F,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,aAAa,CAAkC;IACvD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,OAAO,CAA8B;IAE7C,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,aAAa,CAAa;IAElC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,QAAQ,CAAQ;IACxB,OAAO,CAAC,aAAa,CAAyC;IAC9D,kBAAkB;gBACC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,2BAA2B,EAAE,MAAM,CAAC,EAAE,mBAAmB;IAYnG,WAAW,IAAI,mBAAmB,GAAG,SAAS;IAY9C,6BAA6B;IAG7B,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS;IAMrD,iBAAiB;IAEjB,qCAAqC,CAC1C,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC3E,IAAI;IAaP,OAAO,CAAC,iBAAiB;IASlB,uBAAuB,CAC5B,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC9G,IAAI;IAeP;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAiBtB,OAAO,CAAC,wBAAwB;IAIhC;;;;;;;OAOG;IACH,OAAO,CAAC,gBAAgB;IASjB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAU1C,OAAO,CAAC,WAAW;IAUZ,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;CAIhF"}
+{"version":3,"file":"ClosestPointStrokeHandler.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAIrE,OAAO,EAAuC,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AACtG,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,uBAAwB,YAAW,cAAc;IAC9F,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,aAAa,CAAkC;IACvD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,OAAO,CAAU;IAEzB,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,aAAa,CAAa;IAElC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,QAAQ,CAAQ;IACxB,OAAO,CAAC,aAAa,CAAyC;IAC9D,kBAAkB;gBACC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,2BAA2B,EAAE,MAAM,CAAC,EAAE,mBAAmB,EAAE,MAAM,CAAC,EAAE,OAAO;IAarH,WAAW,IAAI,mBAAmB,GAAG,SAAS;IAY9C,6BAA6B;IAG7B,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS;IAMrD,iBAAiB;IAEjB,qCAAqC,CAC1C,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC3E,IAAI;IAaP,OAAO,CAAC,iBAAiB;IASlB,uBAAuB,CAC5B,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC9G,IAAI;IAcP;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAiBtB,OAAO,CAAC,wBAAwB;IAIhC;;;;;;;OAOG;IACH,OAAO,CAAC,gBAAgB;IAYjB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAU1C,OAAO,CAAC,WAAW;IAUZ,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;CAIhF"}

package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js

@@ -10,7 +10,8 @@ import { Geometry } from "../../Geometry";
 import { Point3d } from "../../geometry3d/Point3dVector3d";
 import { Ray3d } from "../../geometry3d/Ray3d";
 import { Newton1dUnboundedApproximateDerivative } from "../../numerics/Newton";
-import { CurveExtendOptions } from "../CurveExtendMode";
+import { SmallSystem } from "../../numerics/SmallSystem";
+import { CurveExtendMode, CurveExtendOptions } from "../CurveExtendMode";
 import { CurveLocationDetail } from "../CurveLocationDetail";
 import { NewtonRtoRStrokeHandler } from "./NewtonRtoRStrokeHandler";
 /**
@@ -22,6 +23,7 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
     _closestPoint;
     _spacePoint;
     _extend;
+    _xyOnly;
     // fraction and function value on one side of an interval that may bracket a root
     _fractionA = 0;
     _functionA = 0;
@@ -34,7 +36,7 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
     _workRay;
     _newtonSolver;
     /** Constructor */
-    constructor(spacePoint, extend, result) {
+    constructor(spacePoint, extend, result, xyOnly) {
         super();
         this._spacePoint = spacePoint;
         this._workPoint = Point3d.create();
@@ -43,6 +45,7 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
         if (this._closestPoint)
             this._closestPoint.a = Geometry.largeCoordinateResult;
         this._extend = extend ?? false;
+        this._xyOnly = xyOnly ?? false;
         this.startCurvePrimitive(undefined);
         this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);
     }
@@ -83,7 +86,7 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
         }
     }
     announceCandidate(cp, fraction, point) {
-        const distance = this._spacePoint.distance(point);
+        const distance = this._xyOnly ? this._spacePoint.distanceXY(point) : this._spacePoint.distance(point);
         if (this._closestPoint && distance > this._closestPoint.a)
             return;
         this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);
@@ -92,16 +95,15 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
             this._closestPoint.curve = this._parentCurvePrimitive;
     }
     announceSegmentInterval(cp, point0, point1, _numStrokes, fraction0, fraction1) {
-        let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);
-        // only consider extending the segment if the immediate caller says we are at endpoints
-        if (!this._extend)
-            localFraction = Geometry.clampToStartEnd(localFraction, 0.0, 1.0);
-        else {
-            if (fraction0 !== 0.0)
-                localFraction = Math.max(localFraction, 0.0);
-            if (fraction1 !== 1.0)
-                localFraction = Math.min(localFraction, 1.0);
-        }
+        let localFraction = 0;
+        if (this._xyOnly)
+            localFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(point0, point1, this._spacePoint) ?? 0;
+        else
+            localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);
+        // only consider segment extension at a parent curve endpoint, i.e. when fraction0 is 0 or fraction1 is 1
+        const extend0 = (fraction0 === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 0) : CurveExtendMode.None;
+        const extend1 = (fraction1 === 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 1) : CurveExtendMode.None;
+        localFraction = CurveExtendOptions.correctFraction([extend0, extend1], localFraction);
         this._workPoint = point0.interpolate(localFraction, point1);
         const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);
         this.announceCandidate(cp, globalFraction, this._workPoint);
@@ -150,7 +152,10 @@ export class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler {
             this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);
         else
             return undefined;
-        return this._workRay.dotProductToPoint(this._spacePoint);
+        if (this._xyOnly)
+            return this._workRay.dotProductToPointXY(this._spacePoint);
+        else
+            return this._workRay.dotProductToPoint(this._spacePoint);
     }
     evaluate(fraction) {
         let curve = this._curve;

package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClosestPointStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,OAAO,EAAY,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,sCAAsC,EAAE,MAAM,uBAAuB,CAAC;AAC/E,OAAO,EAAE,kBAAkB,EAA+B,MAAM,oBAAoB,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAE7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,MAAM,OAAO,yBAA0B,SAAQ,uBAAuB;IAC5D,MAAM,CAA6B;IACnC,aAAa,CAAkC;IAC/C,WAAW,CAAU;IACrB,OAAO,CAA8B;IAC7C,iFAAiF;IACzE,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,uFAAuF;IAC/E,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,qCAAqC;IAC7B,UAAU,CAAU;IACpB,QAAQ,CAAQ;IAChB,aAAa,CAAyC;IAC9D,kBAAkB;IAClB,YAAmB,UAAmB,EAAE,MAAoC,EAAE,MAA4B;QACxG,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,IAAI,CAAC,aAAa;YACpB,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC,qBAAqB,CAAA;QACvD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,sCAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACM,WAAW;QAChB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;gBACzC,QAAQ,GAAG,kBAAkB,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACtE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IACM,iBAAiB;IACxB,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,8BAA8B;QAClE,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAChE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,IAAI,CAAC,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YACvD,OAAO;QACT,IAAI,CAAC,aAAa,GAAG,mBAAmB,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3G,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC;QAChC,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS;YAC1C,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;IAC1D,CAAC;IACM,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAE/G,IAAI,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACrF,uFAAuF;QACvF,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,aAAa,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aAC/D,CAAC;YACJ,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC5D,MAAM,cAAc,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QACjF,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;;OAOG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YACvC,OAAO,CAAC,qEAAqE;QAC/E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,yGAAyG;QACzG,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACO,wBAAwB,CAAC,QAAgB;QAC/C,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IACD;;;;;;;OAOG;IACK,gBAAgB,CAAC,kBAA0B,EAAE,QAAiB,EAAE,KAAsB;QAC5F,IAAI,kBAAkB;YACpB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;aACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK;YACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;;YAE5E,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3D,CAAC;IACM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACO,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,iFAAiF,CAAC,CAAC;QAC/G,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,oFAAoF;YAChH,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IACM,oBAAoB,CAAC,KAAc,EAAE,QAAgB,EAAE,OAAiB;QAC7E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for searching for the closest point to a CurvePrimitive.\r\n * @internal\r\n */\r\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _closestPoint: CurveLocationDetail | undefined;\r\n  private _spacePoint: Point3d;\r\n  private _extend: VariantCurveExtendParameter;\r\n  // fraction and function value on one side of an interval that may bracket a root\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  // fraction and function value on the other side of an interval that may bracket a root\r\n  private _fractionB: number = 0;\r\n  private _functionB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars to use within methods\r\n  private _workPoint: Point3d;\r\n  private _workRay: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n  /** Constructor */\r\n  public constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail) {\r\n    super();\r\n    this._spacePoint = spacePoint;\r\n    this._workPoint = Point3d.create();\r\n    this._workRay = Ray3d.createZero();\r\n    this._closestPoint = result;\r\n    if (this._closestPoint)\r\n      this._closestPoint.a = Geometry.largeCoordinateResult\r\n    this._extend = extend ?? false;\r\n    this.startCurvePrimitive(undefined);\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n  public claimResult(): CurveLocationDetail | undefined {\r\n    if (this._closestPoint) {\r\n      this._newtonSolver.setX(this._closestPoint.fraction);\r\n      this._curve = this._closestPoint.curve;\r\n      if (this._newtonSolver.runIterations()) {\r\n        let fraction = this._newtonSolver.getX();\r\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\r\n        this.announceSolutionFraction(fraction);\r\n      }\r\n    }\r\n    return this._closestPoint;\r\n  }\r\n  public needPrimaryGeometryForStrokes() {\r\n    return true;\r\n  }\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n  }\r\n  public endCurvePrimitive() {\r\n  }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    this.startCurvePrimitive(cp);\r\n    this.announceSolutionFraction(0.0); // test start point as closest\r\n    this.announceSolutionFraction(1.0); // test end point as closest\r\n    if (numStrokes < 1)\r\n      numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.announceRay(fraction, this._workRay);\r\n    }\r\n  }\r\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\r\n    const distance = this._spacePoint.distance(point);\r\n    if (this._closestPoint && distance > this._closestPoint.a)\r\n      return;\r\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\r\n    this._closestPoint.a = distance;\r\n    if (this._parentCurvePrimitive !== undefined)\r\n      this._closestPoint.curve = this._parentCurvePrimitive;\r\n  }\r\n  public announceSegmentInterval(\r\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\r\n    // only consider extending the segment if the immediate caller says we are at endpoints\r\n    if (!this._extend)\r\n      localFraction = Geometry.clampToStartEnd(localFraction, 0.0, 1.0);\r\n    else {\r\n      if (fraction0 !== 0.0)\r\n        localFraction = Math.max(localFraction, 0.0);\r\n      if (fraction1 !== 1.0)\r\n        localFraction = Math.min(localFraction, 1.0);\r\n    }\r\n    this._workPoint = point0.interpolate(localFraction, point1);\r\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\r\n    this.announceCandidate(cp, globalFraction, this._workPoint);\r\n  }\r\n  /**\r\n   * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this\r\n   * fractional interval.\r\n   * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and\r\n   * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke\r\n   * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,\r\n   * this method can miss a root of `f`.\r\n   */\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0)\r\n      return; // stroke segment has no root; ASSUME the function has no root either\r\n    if (this._functionA === 0)\r\n      this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0)\r\n      this.announceSolutionFraction(this._fractionB);\r\n    // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n  private announceSolutionFraction(fraction: number) {\r\n    if (this._curve)\r\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\r\n  }\r\n  /**\r\n   * Evaluate the univariate real-valued function for which we are finding roots.\r\n   * * For finding the closest point to curve X from point Q, this function is `f(t) := Q-X(t) dot X'(t)`.\r\n   * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.\r\n   * @param pointAndDerivative pre-evaluated curve\r\n   * @param fraction fraction at which to evaluate `curve`\r\n   * @param curve curve to evaluate at `fraction`\r\n   */\r\n  private evaluateFunction(pointAndDerivative?: Ray3d, fraction?: number, curve?: CurvePrimitive): number | undefined {\r\n    if (pointAndDerivative)\r\n      this._workRay.setFrom(pointAndDerivative);\r\n    else if (fraction !== undefined && curve)\r\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\r\n    else\r\n      return undefined;\r\n    return this._workRay.dotProductToPoint(this._spacePoint);\r\n  }\r\n  public evaluate(fraction: number): boolean {\r\n    let curve = this._curve;\r\n    if (this._parentCurvePrimitive)\r\n      curve = this._parentCurvePrimitive;\r\n    const value = this.evaluateFunction(undefined, fraction, curve);\r\n    if (value === undefined)\r\n      return false;\r\n    this.currentF = value;\r\n    return true;\r\n  }\r\n  private announceRay(fraction: number, data: Ray3d): void {\r\n    const value = this.evaluateFunction(data);\r\n    assert(value !== undefined, \"expect defined because evaluateFunction never returns undefined for input Ray3d\");\r\n    this._functionB = value;\r\n    this._fractionB = fraction;\r\n    if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval\r\n      this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._workRay.set(point, tangent);\r\n    this.announceRay(fraction, this._workRay);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ClosestPointStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,OAAO,EAAY,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,sCAAsC,EAAE,MAAM,uBAAuB,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAA+B,MAAM,oBAAoB,CAAC;AACtG,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAE7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,MAAM,OAAO,yBAA0B,SAAQ,uBAAuB;IAC5D,MAAM,CAA6B;IACnC,aAAa,CAAkC;IAC/C,WAAW,CAAU;IACrB,OAAO,CAA8B;IACrC,OAAO,CAAU;IACzB,iFAAiF;IACzE,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,uFAAuF;IAC/E,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,qCAAqC;IAC7B,UAAU,CAAU;IACpB,QAAQ,CAAQ;IAChB,aAAa,CAAyC;IAC9D,kBAAkB;IAClB,YAAmB,UAAmB,EAAE,MAAoC,EAAE,MAA4B,EAAE,MAAgB;QAC1H,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,IAAI,CAAC,aAAa;YACpB,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC,qBAAqB,CAAA;QACvD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,sCAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACM,WAAW;QAChB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;gBACzC,QAAQ,GAAG,kBAAkB,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACtE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IACM,iBAAiB;IACxB,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,8BAA8B;QAClE,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAChE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtG,IAAI,IAAI,CAAC,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YACvD,OAAO;QACT,IAAI,CAAC,aAAa,GAAG,mBAAmB,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3G,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC;QAChC,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS;YAC1C,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;IAC1D,CAAC;IACM,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAE/G,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,OAAO;YACd,aAAa,GAAG,WAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;;YAExG,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACnF,yGAAyG;QACzG,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QACnJ,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QACnJ,aAAa,GAAG,kBAAkB,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;QACtF,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC5D,MAAM,cAAc,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QACjF,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;;OAOG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YACvC,OAAO,CAAC,qEAAqE;QAC/E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,yGAAyG;QACzG,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACO,wBAAwB,CAAC,QAAgB;QAC/C,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IACD;;;;;;;OAOG;IACK,gBAAgB,CAAC,kBAA0B,EAAE,QAAiB,EAAE,KAAsB;QAC5F,IAAI,kBAAkB;YACpB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;aACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK;YACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;;YAE5E,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;YAE3D,OAAO,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IACM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACO,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,iFAAiF,CAAC,CAAC;QAC/G,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,oFAAoF;YAChH,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IACM,oBAAoB,CAAC,KAAc,EAAE,QAAgB,EAAE,OAAiB;QAC7E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { SmallSystem } from \"../../numerics/SmallSystem\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for searching for the closest point to a CurvePrimitive.\r\n * @internal\r\n */\r\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _closestPoint: CurveLocationDetail | undefined;\r\n  private _spacePoint: Point3d;\r\n  private _extend: VariantCurveExtendParameter;\r\n  private _xyOnly: boolean;\r\n  // fraction and function value on one side of an interval that may bracket a root\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  // fraction and function value on the other side of an interval that may bracket a root\r\n  private _fractionB: number = 0;\r\n  private _functionB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars to use within methods\r\n  private _workPoint: Point3d;\r\n  private _workRay: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n  /** Constructor */\r\n  public constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail, xyOnly?: boolean) {\r\n    super();\r\n    this._spacePoint = spacePoint;\r\n    this._workPoint = Point3d.create();\r\n    this._workRay = Ray3d.createZero();\r\n    this._closestPoint = result;\r\n    if (this._closestPoint)\r\n      this._closestPoint.a = Geometry.largeCoordinateResult\r\n    this._extend = extend ?? false;\r\n    this._xyOnly = xyOnly ?? false;\r\n    this.startCurvePrimitive(undefined);\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n  public claimResult(): CurveLocationDetail | undefined {\r\n    if (this._closestPoint) {\r\n      this._newtonSolver.setX(this._closestPoint.fraction);\r\n      this._curve = this._closestPoint.curve;\r\n      if (this._newtonSolver.runIterations()) {\r\n        let fraction = this._newtonSolver.getX();\r\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\r\n        this.announceSolutionFraction(fraction);\r\n      }\r\n    }\r\n    return this._closestPoint;\r\n  }\r\n  public needPrimaryGeometryForStrokes() {\r\n    return true;\r\n  }\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n  }\r\n  public endCurvePrimitive() {\r\n  }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    this.startCurvePrimitive(cp);\r\n    this.announceSolutionFraction(0.0); // test start point as closest\r\n    this.announceSolutionFraction(1.0); // test end point as closest\r\n    if (numStrokes < 1)\r\n      numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.announceRay(fraction, this._workRay);\r\n    }\r\n  }\r\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\r\n    const distance = this._xyOnly ? this._spacePoint.distanceXY(point) : this._spacePoint.distance(point);\r\n    if (this._closestPoint && distance > this._closestPoint.a)\r\n      return;\r\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\r\n    this._closestPoint.a = distance;\r\n    if (this._parentCurvePrimitive !== undefined)\r\n      this._closestPoint.curve = this._parentCurvePrimitive;\r\n  }\r\n  public announceSegmentInterval(\r\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    let localFraction = 0;\r\n    if (this._xyOnly)\r\n      localFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(point0, point1, this._spacePoint) ?? 0;\r\n    else\r\n      localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\r\n    // only consider segment extension at a parent curve endpoint, i.e. when fraction0 is 0 or fraction1 is 1\r\n    const extend0 = (fraction0 === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 0) : CurveExtendMode.None;\r\n    const extend1 = (fraction1 === 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 1) : CurveExtendMode.None;\r\n    localFraction = CurveExtendOptions.correctFraction([extend0, extend1], localFraction);\r\n    this._workPoint = point0.interpolate(localFraction, point1);\r\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\r\n    this.announceCandidate(cp, globalFraction, this._workPoint);\r\n  }\r\n  /**\r\n   * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this\r\n   * fractional interval.\r\n   * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and\r\n   * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke\r\n   * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,\r\n   * this method can miss a root of `f`.\r\n   */\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0)\r\n      return; // stroke segment has no root; ASSUME the function has no root either\r\n    if (this._functionA === 0)\r\n      this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0)\r\n      this.announceSolutionFraction(this._fractionB);\r\n    // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n  private announceSolutionFraction(fraction: number) {\r\n    if (this._curve)\r\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\r\n  }\r\n  /**\r\n   * Evaluate the univariate real-valued function for which we are finding roots.\r\n   * * For finding the closest point to curve X from point Q, this function is `f(t) := Q-X(t) dot X'(t)`.\r\n   * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.\r\n   * @param pointAndDerivative pre-evaluated curve\r\n   * @param fraction fraction at which to evaluate `curve`\r\n   * @param curve curve to evaluate at `fraction`\r\n   */\r\n  private evaluateFunction(pointAndDerivative?: Ray3d, fraction?: number, curve?: CurvePrimitive): number | undefined {\r\n    if (pointAndDerivative)\r\n      this._workRay.setFrom(pointAndDerivative);\r\n    else if (fraction !== undefined && curve)\r\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\r\n    else\r\n      return undefined;\r\n    if (this._xyOnly)\r\n      return this._workRay.dotProductToPointXY(this._spacePoint);\r\n    else\r\n      return this._workRay.dotProductToPoint(this._spacePoint);\r\n  }\r\n  public evaluate(fraction: number): boolean {\r\n    let curve = this._curve;\r\n    if (this._parentCurvePrimitive)\r\n      curve = this._parentCurvePrimitive;\r\n    const value = this.evaluateFunction(undefined, fraction, curve);\r\n    if (value === undefined)\r\n      return false;\r\n    this.currentF = value;\r\n    return true;\r\n  }\r\n  private announceRay(fraction: number, data: Ray3d): void {\r\n    const value = this.evaluateFunction(data);\r\n    assert(value !== undefined, \"expect defined because evaluateFunction never returns undefined for input Ray3d\");\r\n    this._functionB = value;\r\n    this._fractionB = fraction;\r\n    if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval\r\n      this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._workRay.set(point, tangent);\r\n    this.announceRay(fraction, this._workRay);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/internalContexts/PointToCurveTangentHandler.d.ts

@@ -0,0 +1,26 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { Matrix3d } from "../../geometry3d/Matrix3d";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { Arc3d } from "../Arc3d";
+import { CurvePrimitive } from "../CurvePrimitive";
+type TangencyPointCollector = (spacePoint: Point3d, curve: CurvePrimitive, fraction: number) => any;
+/**
+ * Accumulator context for searching for lines tangent to curved geometry.
+ * LIMITED IMPLEMENTATION 3/2025
+ * * Only Arc3d implements its handler
+ * * Arc3d calculation works with the projection of the space point into the plane of the arc.
+ * @internal
+ */
+export declare class PointToCurveTangentHandler extends RecurseToCurvesGeometryHandler {
+    spacePoint: Point3d;
+    collector: TangencyPointCollector;
+    extendArcs: boolean;
+    worldToView: Matrix3d | undefined;
+    constructor(spacePoint: Point3d, collector: TangencyPointCollector, extendArcs: boolean | undefined, viewMatrix: Matrix3d | undefined);
+    handleArc3d(g: Arc3d): void;
+}
+export {};
+//# sourceMappingURL=PointToCurveTangentHandler.d.ts.map

package/lib/esm/curve/internalContexts/PointToCurveTangentHandler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PointToCurveTangentHandler.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PointToCurveTangentHandler.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAE,OAAO,EAAY,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD,KAAK,sBAAsB,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,KAAK,GAAG,CAAC;AACpG;;;;;;GAMG;AACH,qBAAa,0BAA2B,SAAQ,8BAA8B;IACrE,UAAU,EAAE,OAAO,CAAC;IACpB,SAAS,EAAE,sBAAsB,CAAC;IAClC,UAAU,EAAE,OAAO,CAAC;IAEpB,WAAW,EAAE,QAAQ,GAAG,SAAS,CAAC;gBAEvC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,UAAU,EAAE,OAAO,YAAQ,EAAE,UAAU,EAAE,QAAQ,GAAG,SAAS;IASvG,WAAW,CAAC,CAAC,EAAE,KAAK;CA0CrC"}

package/lib/esm/curve/internalContexts/PointToCurveTangentHandler.js

@@ -0,0 +1,74 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { Matrix3d } from "../../geometry3d/Matrix3d";
+import { Vector3d } from "../../geometry3d/Point3dVector3d";
+/**
+ * Accumulator context for searching for lines tangent to curved geometry.
+ * LIMITED IMPLEMENTATION 3/2025
+ * * Only Arc3d implements its handler
+ * * Arc3d calculation works with the projection of the space point into the plane of the arc.
+ * @internal
+ */
+export class PointToCurveTangentHandler extends RecurseToCurvesGeometryHandler {
+    spacePoint;
+    collector;
+    extendArcs;
+    // if available, do the tangency as viewed in the xy plane AFTER multiplying vectors by this matrix
+    worldToView;
+    constructor(spacePoint, collector, extendArcs = false, viewMatrix) {
+        super();
+        this.spacePoint = spacePoint;
+        this.collector = collector;
+        this.extendArcs = extendArcs;
+        this.worldToView = viewMatrix;
+    }
+    handleArc3d(g) {
+        const centerToPoint = Vector3d.createStartEnd(g.centerRef, this.spacePoint);
+        let localCenterToPoint;
+        if (this.worldToView) {
+            // Convert the vector spacePoint into the arc's default system in which
+            // U vector is column  0
+            // V vector is column 1
+            // worldToView row 2 is column 2
+            const arcToView = Matrix3d.createColumns(g.matrixRef.getColumn(0), g.matrixRef.getColumn(1), this.worldToView.getRow(2));
+            localCenterToPoint = arcToView.multiplyInverse(centerToPoint);
+        }
+        else {
+            // Convert the vector spacePoint into the arc's default system in which
+            // U vector is column  0
+            // V vector is column 1
+            // their cross product (or maybe a scale of it) is column 2.
+            localCenterToPoint = g.matrixRef.multiplyInverse(centerToPoint);
+        }
+        if (localCenterToPoint === undefined)
+            return;
+        // localCenterToPoint is measured in the (de-skewed and descaled!) coordinate system of the
+        // arc U and V axes. That is, the arc is now a unit circle.
+        // Angle alpha is from the local x axis to localCenterToPoint.
+        // Angle beta is from that to the tangency points.
+        // The inverse transformation preserves parameter angle in the ellipse sweep.
+        if (localCenterToPoint !== undefined) {
+            const distanceSquaredXYToPoint = localCenterToPoint.magnitudeSquaredXY();
+            if (distanceSquaredXYToPoint <= 1.0) {
+                // the point is inside the ellipse
+            }
+            else {
+                const distanceToTangency = Math.sqrt(distanceSquaredXYToPoint - 1.0);
+                const alpha = Math.atan2(localCenterToPoint.y, localCenterToPoint.x);
+                const beta = Math.atan2(distanceToTangency, 1);
+                for (const theta of [alpha + beta, alpha - beta]) {
+                    const fraction = g.sweep.radiansToPositivePeriodicFraction(theta);
+                    if (this.extendArcs || fraction <= 1.0)
+                        this.collector(this.spacePoint, g, fraction);
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=PointToCurveTangentHandler.js.map

package/lib/esm/curve/internalContexts/PointToCurveTangentHandler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PointToCurveTangentHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PointToCurveTangentHandler.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAW,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAKrE;;;;;;GAMG;AACH,MAAM,OAAO,0BAA2B,SAAQ,8BAA8B;IACrE,UAAU,CAAU;IACpB,SAAS,CAAyB;IAClC,UAAU,CAAU;IAC3B,mGAAmG;IAC5F,WAAW,CAAuB;IACzC,YACE,UAAmB,EAAE,SAAiC,EAAE,aAAsB,KAAK,EAAE,UAAgC;QAErH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAEe,WAAW,CAAC,CAAQ;QAClC,MAAM,aAAa,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5E,IAAI,kBAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,gCAAgC;YAChC,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CACtC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;YACF,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,4DAA4D;YAC5D,kBAAkB,GAAG,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,kBAAkB,KAAK,SAAS;YAClC,OAAO;QACT,2FAA2F;QAC3F,2DAA2D;QAC3D,8DAA8D;QAC9D,kDAAkD;QAClD,6EAA6E;QAC7E,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,wBAAwB,GAAG,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;YACzE,IAAI,wBAAwB,IAAI,GAAG,EAAE,CAAC;gBACpC,kCAAkC;YACpC,CAAC;iBAAM,CAAC;gBACN,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,wBAAwB,GAAG,GAAG,CAAC,CAAA;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBACrE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;gBAC/C,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;oBACjD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,iCAAiC,CAAC,KAAK,CAAC,CAAC;oBAClE,IAAI,IAAI,CAAC,UAAU,IAAI,QAAQ,IAAI,GAAG;wBACpC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Matrix3d } from \"../../geometry3d/Matrix3d\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\n\r\ntype TangencyPointCollector = (spacePoint: Point3d, curve: CurvePrimitive, fraction: number) => any;\r\n/**\r\n * Accumulator context for searching for lines tangent to curved geometry.\r\n * LIMITED IMPLEMENTATION 3/2025\r\n * * Only Arc3d implements its handler\r\n * * Arc3d calculation works with the projection of the space point into the plane of the arc.\r\n * @internal\r\n */\r\nexport class PointToCurveTangentHandler extends RecurseToCurvesGeometryHandler {\r\n  public spacePoint: Point3d;\r\n  public collector: TangencyPointCollector;\r\n  public extendArcs: boolean;\r\n  // if available, do the tangency as viewed in the xy plane AFTER multiplying vectors by this matrix\r\n  public worldToView: Matrix3d | undefined;\r\n  public constructor(\r\n    spacePoint: Point3d, collector: TangencyPointCollector, extendArcs: boolean = false, viewMatrix: Matrix3d | undefined,\r\n  ) {\r\n    super();\r\n    this.spacePoint = spacePoint;\r\n    this.collector = collector;\r\n    this.extendArcs = extendArcs;\r\n    this.worldToView = viewMatrix;\r\n  }\r\n\r\n  public override handleArc3d(g: Arc3d) {\r\n    const centerToPoint = Vector3d.createStartEnd(g.centerRef, this.spacePoint);\r\n    let localCenterToPoint: Vector3d | undefined;\r\n    if (this.worldToView) {\r\n      // Convert the vector spacePoint into the arc's default system in which\r\n      // U vector is column  0\r\n      // V vector is column 1\r\n      // worldToView row 2 is column 2\r\n      const arcToView = Matrix3d.createColumns(\r\n        g.matrixRef.getColumn(0), g.matrixRef.getColumn(1), this.worldToView.getRow(2),\r\n      );\r\n      localCenterToPoint = arcToView.multiplyInverse(centerToPoint);\r\n    } else {\r\n      // Convert the vector spacePoint into the arc's default system in which\r\n      // U vector is column  0\r\n      // V vector is column 1\r\n      // their cross product (or maybe a scale of it) is column 2.\r\n      localCenterToPoint = g.matrixRef.multiplyInverse(centerToPoint);\r\n    }\r\n    if (localCenterToPoint === undefined)\r\n      return;\r\n    // localCenterToPoint is measured in the (de-skewed and descaled!) coordinate system of the\r\n    // arc U and V axes. That is, the arc is now a unit circle.\r\n    // Angle alpha is from the local x axis to localCenterToPoint.\r\n    // Angle beta is from that to the tangency points.\r\n    // The inverse transformation preserves parameter angle in the ellipse sweep.\r\n    if (localCenterToPoint !== undefined) {\r\n      const distanceSquaredXYToPoint = localCenterToPoint.magnitudeSquaredXY();\r\n      if (distanceSquaredXYToPoint <= 1.0) {\r\n        // the point is inside the ellipse\r\n      } else {\r\n        const distanceToTangency = Math.sqrt(distanceSquaredXYToPoint - 1.0)\r\n        const alpha = Math.atan2(localCenterToPoint.y, localCenterToPoint.x);\r\n        const beta = Math.atan2(distanceToTangency, 1);\r\n        for (const theta of [alpha + beta, alpha - beta]) {\r\n          const fraction = g.sweep.radiansToPositivePeriodicFraction(theta);\r\n          if (this.extendArcs || fraction <= 1.0)\r\n            this.collector(this.spacePoint, g, fraction);\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/internalContexts/geometry2d/ConstrainedImplicitCurve2d.d.ts

@@ -0,0 +1,152 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+*/
+import { XAndY } from "../../../geometry3d/XYZProps";
+import { ImplicitCurve2d, ImplicitGeometryMarkup } from "./ImplicitCurve2d";
+import { UnboundedCircle2dByCenterAndRadius } from "./UnboundedCircle2d";
+import { UnboundedLine2dByPointAndNormal } from "./UnboundedLine2d";
+/**
+ * Static methods for special case circle and line tangent constructions.
+ * @internal
+ */
+export declare class ConstrainedImplicitCurve2d {
+    /**
+     * Return all (i.e., up to 4) circles that are tangent to 3 given lines.
+     * @param lineA first line
+     * @param lineB second line
+     * @param lineC third line
+     */
+    static circlesTangentLLL(lineA: UnboundedLine2dByPointAndNormal, lineB: UnboundedLine2dByPointAndNormal, lineC: UnboundedLine2dByPointAndNormal): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Return all (i.e., up to 2) unbounded lines perpendicular to a line and tangent to a circle.
+     * @param line the line
+     * @param circle the circle
+     */
+    static linesPerpLTangentC(line: UnboundedLine2dByPointAndNormal, circle: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedLine2dByPointAndNormal>[] | undefined;
+    /**
+     * Return all (i.e., 4) variants of the line perpendicular to 2 circles (line between centers, with ends at crossing
+     * points on respective circles).
+     * @param circleA first circle
+     * @param circleB second circle
+     */
+    static linesPerpCPerpC(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedLine2dByPointAndNormal>[] | undefined;
+    /**
+     * Return all (i.e., up to 2) unbounded lines perpendicular to a line and a circle.
+     * @param line the line
+     * @param circle the circle
+     */
+    static linesPerpLPerpC(line: UnboundedLine2dByPointAndNormal, circle: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedLine2dByPointAndNormal>[] | undefined;
+    /**
+     * Return all (i.e., up to 4) unbounded lines perpendicular to a circle and tangent to a circle.
+     * Note that multiple colinear lines are returned tagged with diametrically opposing points of circleA.
+     * @param circleA first circle (for perpendicular constraint)
+     * @param circleB second circle (for tangent constraint)
+     */
+    static linesPerpCTangentC(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedLine2dByPointAndNormal>[] | undefined;
+    /**
+     * Return all (i.e., up to 4) unbounded lines tangent to 2 circles.
+     * * There are 4 lines if there is neither intersection nor containment between the circles
+     * * There are 2 lines if the circles intersect
+     * * THere are no lines if the one circle is entirely inside the other.
+     * @param circleA first circle
+     * @param circleB second circle
+     */
+    static linesTangentCC(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedLine2dByPointAndNormal>[] | undefined;
+    /**
+    * Return all (i.e., up to 8) circles tangent to two lines and a circle.
+    * * There are 8 circles if the circle contains the intersection of the lines.
+    * * There are 2 circles if the circle is completely contained in one quadrant bounded by the two lines.
+    * * There are 2 circles if the circle intersects one ray outward from the intersection.
+    * * There are 4 circles if the circle intersects two of the outward rays.
+    */
+    static circlesTangentLLC(lineA: UnboundedLine2dByPointAndNormal, lineB: UnboundedLine2dByPointAndNormal, circle: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Return all (i.e., up to 4) circles tangent to 2 circles and a line.
+     * @param circleA first circle
+     * @param circleB second circle
+     * @param line the line
+     */
+    static circlesTangentCCL(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius, line: UnboundedLine2dByPointAndNormal): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Special case CCC tangent construction when inputs are colinear.
+     * @param circleA first input circle
+     * @param circleB second input circle
+     * @param circleC third input circle
+     * @param rA signed radius for circleA
+     * @param rB signed radius for circleB
+     * @param rC signed radius for circleC
+     * @param result pre-initialized array to which tangent circle markup will be added.
+     */
+    private static solveColinearCCCTangents;
+    /**
+     * Return all (i.e., up to 8) circles tangent to 3 circles.
+     * @param circles the three input circles
+     */
+    private static circlesTangentCCCThisOrder;
+    /**
+     * Return all (i.e., up to 8) circles tangent to 3 circles.
+     * @param circleA first circle
+     * @param circleB second circle
+     * @param circleC third circle
+     */
+    static circlesTangentCCC(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius, circleC: UnboundedCircle2dByCenterAndRadius): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Return an unbounded line with the midpoint between pointA and pointB as its reference point
+     * and the unit vector from pointA towards pointB as its normal.
+     * @param pointA first point
+     * @param pointB second point
+     * @returns unbounded line, or undefined if pointA and pointB are coincident.
+     */
+    static bisector(pointA: XAndY, pointB: XAndY): UnboundedLine2dByPointAndNormal | undefined;
+    /**
+     * Compute circles of specified radius tangent to each of the lines
+     * * There are normally 4 circles
+     * * The undefined case occurs when the lines are parallel.
+     * @param lineA first line
+     * @param lineB second line
+     * @param radius radius of tangent circles
+     * @returns array of circles with annotated tangencies. returns undefined if lines are parallel.
+     */
+    static circlesTangentLLR(lineA: UnboundedLine2dByPointAndNormal, lineB: UnboundedLine2dByPointAndNormal, radius: number): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Compute circles of specified radius tangent to both a line and an arc
+     * * There can be 0 to 8 circles
+     * * The undefined case occurs when the smallest distance from circle to line exceeds radius.
+     * @param circleA the circle
+     * @param lineB the line
+     * @param radius radius of tangent circles
+     * @returns array of circles with annotated tangencies
+     */
+    static circlesTangentCLR(circleA: UnboundedCircle2dByCenterAndRadius, lineB: UnboundedLine2dByPointAndNormal, radius: number): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Compute circles of specified radius tangent to both circles
+     * * There can be 0 to 8 circles
+     * * The undefined case is when the smallest distance between the circles exceeds the requested radius.
+     * @param circleA the first circle
+     * @param circleB the second circle
+     * @param radius radius of tangent circles
+     * @returns array of circles with annotated tangencies
+     */
+    static circlesTangentCCR(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius, radius: number): ImplicitGeometryMarkup<UnboundedCircle2dByCenterAndRadius>[] | undefined;
+    /**
+     * Construct basis vectors for hyperbola or ellipse whose points are equidistant from tangencies with
+     * circleA and circleB.
+     * * If the curve is a hyperbola, the equation is
+     *            X = center + vectorU * sec(theta) + vectorV * tan(theta)
+     * * If the curve is an ellipse, the equation is
+     *            X = center + vectorU * cos(theta) + vectorV * sin(theta)
+     * @param circleA first circle
+     * @param circleB second circle
+     */
+    static medialCurveCircleCircle(circleA: UnboundedCircle2dByCenterAndRadius, circleB: UnboundedCircle2dByCenterAndRadius): ImplicitCurve2d | undefined;
+    /**
+     * Construct parabolas whose points are equidistant from tangencies with
+     * circleA and circleB.
+     * * Note that if th e circle has non-zero radius there are two parabolas based on
+     *     tangencies on near or far side of the circle.
+     * @param line the line
+     * @param circle the circle
+     */
+    static medialCurveLineCircle(line: UnboundedLine2dByPointAndNormal, circle: UnboundedCircle2dByCenterAndRadius): ImplicitCurve2d[] | undefined;
+}
+//# sourceMappingURL=ConstrainedImplicitCurve2d.d.ts.map

package/lib/esm/curve/internalContexts/geometry2d/ConstrainedImplicitCurve2d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConstrainedImplicitCurve2d.d.ts","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/ConstrainedImplicitCurve2d.ts"],"names":[],"mappings":"AAIA;;EAEE;AAMF,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAGrD,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAA0B,MAAM,mBAAmB,CAAC;AACpG,OAAO,EAAE,kCAAkC,EAAE,MAAM,qBAAqB,CAAC;AAGzE,OAAO,EAAE,+BAA+B,EAAE,MAAM,mBAAmB,CAAC;AAGpE;;;GAGG;AACH,qBAAa,0BAA0B;IACrC;;;;;OAKG;WACW,iBAAiB,CAC7B,KAAK,EAAE,+BAA+B,EACtC,KAAK,EAAE,+BAA+B,EACtC,KAAK,EAAE,+BAA+B,GACrC,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IA6C3E;;;;OAIG;WACW,kBAAkB,CAC9B,IAAI,EAAE,+BAA+B,EAAE,MAAM,EAAE,kCAAkC,GAChF,sBAAsB,CAAC,+BAA+B,CAAC,EAAE,GAAG,SAAS;IAsBxE;;;;;OAKG;WACW,eAAe,CAC3B,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,kCAAkC,GACvF,sBAAsB,CAAC,+BAA+B,CAAC,EAAE,GAAG,SAAS;IAsBxE;;;;OAIG;WACW,eAAe,CAC3B,IAAI,EAAE,+BAA+B,EAAE,MAAM,EAAE,kCAAkC,GAChF,sBAAsB,CAAC,+BAA+B,CAAC,EAAE,GAAG,SAAS;IAsBxE;;;;;OAKG;WACW,kBAAkB,CAC9B,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,kCAAkC,GACvF,sBAAsB,CAAC,+BAA+B,CAAC,EAAE,GAAG,SAAS;IA+BxE;;;;;;;OAOG;WACW,cAAc,CAC1B,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,kCAAkC,GACvF,sBAAsB,CAAC,+BAA+B,CAAC,EAAE,GAAG,SAAS;IA+CxE;;;;;;MAME;WACY,iBAAiB,CAC7B,KAAK,EAAE,+BAA+B,EACtC,KAAK,EAAE,+BAA+B,EACtC,MAAM,EAAE,kCAAkC,GACzC,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IAkH3E;;;;;OAKG;WACW,iBAAiB,CAC7B,OAAO,EAAE,kCAAkC,EAC3C,OAAO,EAAE,kCAAkC,EAC3C,IAAI,EAAE,+BAA+B,GACpC,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IAoF3E;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAsEvC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAuFzC;;;;;OAKG;WACW,iBAAiB,CAC7B,OAAO,EAAE,kCAAkC,EAC3C,OAAO,EAAE,kCAAkC,EAC3C,OAAO,EAAE,kCAAkC,GAC1C,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IAI3E;;;;;;OAMG;WACW,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,+BAA+B,GAAG,SAAS;IAQjG;;;;;;;;OAQG;WACW,iBAAiB,CAC7B,KAAK,EAAE,+BAA+B,EACtC,KAAK,EAAE,+BAA+B,EACtC,MAAM,EAAE,MAAM,GACb,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IA+B3E;;;;;;;;OAQG;WACW,iBAAiB,CAC7B,OAAO,EAAE,kCAAkC,EAAE,KAAK,EAAE,+BAA+B,EAAE,MAAM,EAAE,MAAM,GAClG,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IAiC3E;;;;;;;;OAQG;WACW,iBAAiB,CAC7B,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,kCAAkC,EAAE,MAAM,EAAE,MAAM,GACvG,sBAAsB,CAAC,kCAAkC,CAAC,EAAE,GAAG,SAAS;IAgC3E;;;;;;;;;OASG;WACW,uBAAuB,CACnC,OAAO,EAAE,kCAAkC,EAAE,OAAO,EAAE,kCAAkC,GACvF,eAAe,GAAG,SAAS;IAqB9B;;;;;;;OAOG;WACW,qBAAqB,CACjC,IAAI,EAAE,+BAA+B,EAAE,MAAM,EAAE,kCAAkC,GAChF,eAAe,EAAE,GAAG,SAAS;CAgCjC"}