@itwin/core-geometry 5.8.0-dev.8 → 5.9.0-dev.1

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2d.d.ts

@@ -0,0 +1,105 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Point2d, Vector2d } from "../../../geometry3d/Point2dVector2d";
+import { XAndY } from "../../../geometry3d/XYZProps";
+/**
+ * Abstract base class for curves with an implicit 2d function.
+ * * Curves in the class are required to have an implicit function f(x,y)=0.
+ * * They MAY (but are not required to) implement a parametric evaluator radiansToPoint2d.
+ * @internal
+ */
+export declare abstract class ImplicitCurve2d {
+    /**
+     * Return the implicit function value at xy, i.e, f(x,y).
+     * @param xy point for evaluation.
+     */
+    abstract functionValue(xy: XAndY): number;
+    /**
+     * Return the implicit function gradient at xy.
+     * @param xy point for evaluation.
+     */
+    abstract gradient(xy: XAndY): Vector2d;
+    /** Map a gradient vector (du,dv) from its local frame to global. */
+    static gradientLocalToGlobal(du: number, dv: number, vectorU: Vector2d, vectorV: Vector2d): Vector2d;
+    /**
+     * Find all perpendiculars from space point to the curve.
+     * Pass each in turn to the handler.
+     * @param spacePoint the space point.
+     * @handler the handler to receive all the points on the curve and radians where perpendicular happens.
+     */
+    abstract emitPerpendiculars(spacePoint: Point2d, handler: (curvePoint: Point2d, radians: number | undefined) => any): any;
+    /**
+     * Call emitPerpendiculars. Return the closest of the perpendiculars.
+     * * Return undefined if no perpendiculars are received.
+     * @param spacePoint the space point.
+     */
+    closestPoint(spacePoint: Point2d): Point2d | undefined;
+    /** Return true if the item has degenerate defining data. */
+    abstract isDegenerate(): boolean;
+    /** Return a clone of the curve. */
+    abstract clone(): ImplicitCurve2d;
+    /**
+     * OPTIONAL method to return a Point2d at given radians value.
+     * * The default implementation returns undefined.
+     * * Concrete classes that can be expressed as a function of radians should implement this.
+     */
+    radiansToPoint2d(_radians: number): Point2d | undefined;
+    /**
+     * OPTIONAL method to return the tangent at given radians value.
+     * * The default implementation returns undefined.
+     * * Concrete classes that can be expressed as a function of radians should implement this.
+     */
+    radiansToTangentVector2d(_radians: number): Vector2d | undefined;
+}
+/**
+ * Carrier class containing:
+ * * a point
+ * * the curve to which the point is related.
+ * @internal
+ */
+export declare class Point2dImplicitCurve2d {
+    point: Point2d;
+    curve: ImplicitCurve2d;
+    /**
+     * CAPTURE a point and curve.
+     * @param point point member
+     * @param curve curve member
+     */
+    constructor(point: Point2d, curve: ImplicitCurve2d);
+}
+/**
+ * Carrier class containing:
+ * * a curve which is a subclass of ImplicitCurve2d
+ * * an array of paired point and ImplicitCurve2d.
+ * @internal
+ */
+export declare class ImplicitGeometryMarkup<GeometryType extends ImplicitCurve2d> {
+    curve: GeometryType;
+    data: Point2dImplicitCurve2d[];
+    /**
+     * Construct a new carrier. The data array is created empty.
+     * @param curve curve to CAPTURE
+     */
+    constructor(curve: GeometryType);
+    /**
+     * * Use the otherCurve's emitPerpendiculars method to examine all perpendiculars from spacePoint to the curve.
+     * * For each such point, compute distance from bias point.
+     * * Choose the one whose distance is closest to biasDistance.
+     * * push the chosen point on the data array.
+     * @param spacePoint point to project to otherCurve
+     * @param otherCurve target curve for projection
+     * @param referencePoint reference point for point selection
+     * @param biasDistance preferred distance.
+     */
+    appendClosePoint(spacePoint: Point2d, otherCurve: ImplicitCurve2d, referencePoint: XAndY, biasDistance: number): boolean;
+    /**
+     * Find closest points of an array of curves.
+     * @param spacePoint point to project to otherCurve
+     * @param referencePoint reference point for point selection
+     * @param biasDistance preferred distance.
+     * @param otherCurves array of curves to check.
+     */
+    closePointsOfGeometry(spacePoint: Point2d, referencePoint: Point2d, biasRadius: number, otherCurves: ImplicitCurve2d[]): void;
+}
+//# sourceMappingURL=ImplicitCurve2d.d.ts.map

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImplicitCurve2d.d.ts","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/ImplicitCurve2d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AACxE,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAGrD;;;;;GAKG;AACH,8BAAsB,eAAe;IACnC;;;OAGG;aACa,aAAa,CAAC,EAAE,EAAE,KAAK,GAAG,MAAM;IAChD;;;OAGG;aACa,QAAQ,CAAC,EAAE,EAAE,KAAK,GAAG,QAAQ;IAC7C,oEAAoE;WACtD,qBAAqB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,QAAQ;IAO3G;;;;;OAKG;aACa,kBAAkB,CAChC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS,KAAK,GAAG,GACtF,GAAG;IACN;;;;OAIG;IACI,YAAY,CAAC,UAAU,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAiB7D,4DAA4D;aAC5C,YAAY,IAAI,OAAO;IACvC,mCAAmC;aACnB,KAAK,IAAI,eAAe;IACxC;;;;OAIG;IACI,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAG9D;;;;OAIG;IACI,wBAAwB,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;CAGxE;AAED;;;;;GAKG;AACH,qBAAa,sBAAsB;IAC1B,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,eAAe,CAAC;IAC9B;;;;OAIG;gBACgB,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,eAAe;CAI1D;AACD;;;;;GAKG;AACH,qBAAa,sBAAsB,CAAC,YAAY,SAAS,eAAe;IAC/D,KAAK,EAAE,YAAY,CAAC;IACpB,IAAI,EAAE,sBAAsB,EAAE,CAAC;IACtC;;;OAGG;gBACgB,KAAK,EAAE,YAAY;IAItC;;;;;;;;;OASG;IACI,gBAAgB,CACrB,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,cAAc,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,GAC5F,OAAO;IAoBV;;;;;;OAMG;IACI,qBAAqB,CAC1B,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAC/F,IAAI;CAIR"}

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2d.js

@@ -0,0 +1,141 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ImplicitGeometryMarkup = exports.Point2dImplicitCurve2d = exports.ImplicitCurve2d = void 0;
+const Point2dVector2d_1 = require("../../../geometry3d/Point2dVector2d");
+const SmallSystem_1 = require("../../../numerics/SmallSystem");
+/**
+ * Abstract base class for curves with an implicit 2d function.
+ * * Curves in the class are required to have an implicit function f(x,y)=0.
+ * * They MAY (but are not required to) implement a parametric evaluator radiansToPoint2d.
+ * @internal
+ */
+class ImplicitCurve2d {
+    /** Map a gradient vector (du,dv) from its local frame to global. */
+    static gradientLocalToGlobal(du, dv, vectorU, vectorV) {
+        const result = Point2dVector2d_1.Vector2d.create();
+        // use INVERSE of TRANSPOSE of [UV] matrix to map gradient terms
+        if (SmallSystem_1.SmallSystem.linearSystem2d(vectorU.x, vectorU.y, vectorV.x, vectorV.y, du, dv, result))
+            return result;
+        return Point2dVector2d_1.Vector2d.create(0, 0);
+    }
+    /**
+     * Call emitPerpendiculars. Return the closest of the perpendiculars.
+     * * Return undefined if no perpendiculars are received.
+     * @param spacePoint the space point.
+     */
+    closestPoint(spacePoint) {
+        let minDistanceSquared = Number.MAX_SAFE_INTEGER;
+        let point;
+        // console.log ({space: spacePoint.toJSON()});
+        this.emitPerpendiculars(spacePoint, (curvePoint, _radians) => {
+            const distanceSquared = curvePoint.distanceSquared(spacePoint);
+            // console.log ({distanceSquared, xy: curvePoint.toJSON(), minD: minDistanceSquared});
+            if (distanceSquared < minDistanceSquared) {
+                point = curvePoint.clone();
+                minDistanceSquared = distanceSquared;
+            }
+        });
+        return point;
+    }
+    /**
+     * OPTIONAL method to return a Point2d at given radians value.
+     * * The default implementation returns undefined.
+     * * Concrete classes that can be expressed as a function of radians should implement this.
+     */
+    radiansToPoint2d(_radians) {
+        return undefined;
+    }
+    /**
+     * OPTIONAL method to return the tangent at given radians value.
+     * * The default implementation returns undefined.
+     * * Concrete classes that can be expressed as a function of radians should implement this.
+     */
+    radiansToTangentVector2d(_radians) {
+        return undefined;
+    }
+}
+exports.ImplicitCurve2d = ImplicitCurve2d;
+/**
+ * Carrier class containing:
+ * * a point
+ * * the curve to which the point is related.
+ * @internal
+ */
+class Point2dImplicitCurve2d {
+    point;
+    curve;
+    /**
+     * CAPTURE a point and curve.
+     * @param point point member
+     * @param curve curve member
+     */
+    constructor(point, curve) {
+        this.point = point;
+        this.curve = curve;
+    }
+}
+exports.Point2dImplicitCurve2d = Point2dImplicitCurve2d;
+/**
+ * Carrier class containing:
+ * * a curve which is a subclass of ImplicitCurve2d
+ * * an array of paired point and ImplicitCurve2d.
+ * @internal
+ */
+class ImplicitGeometryMarkup {
+    curve;
+    data;
+    /**
+     * Construct a new carrier. The data array is created empty.
+     * @param curve curve to CAPTURE
+     */
+    constructor(curve) {
+        this.curve = curve;
+        this.data = [];
+    }
+    /**
+     * * Use the otherCurve's emitPerpendiculars method to examine all perpendiculars from spacePoint to the curve.
+     * * For each such point, compute distance from bias point.
+     * * Choose the one whose distance is closest to biasDistance.
+     * * push the chosen point on the data array.
+     * @param spacePoint point to project to otherCurve
+     * @param otherCurve target curve for projection
+     * @param referencePoint reference point for point selection
+     * @param biasDistance preferred distance.
+     */
+    appendClosePoint(spacePoint, otherCurve, referencePoint, biasDistance) {
+        let dMin;
+        let closestPoint;
+        otherCurve.emitPerpendiculars(spacePoint, (curvePoint, _radians) => {
+            const d = Math.abs(curvePoint.distance(referencePoint) - Math.abs(biasDistance));
+            if (dMin === undefined || d < dMin) {
+                dMin = d;
+                closestPoint = curvePoint.clone();
+            }
+        });
+        if (closestPoint !== undefined) {
+            this.data.push(new Point2dImplicitCurve2d(closestPoint, otherCurve));
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Find closest points of an array of curves.
+     * @param spacePoint point to project to otherCurve
+     * @param referencePoint reference point for point selection
+     * @param biasDistance preferred distance.
+     * @param otherCurves array of curves to check.
+     */
+    closePointsOfGeometry(spacePoint, referencePoint, biasRadius, otherCurves) {
+        for (const c of otherCurves)
+            this.appendClosePoint(spacePoint, c, referencePoint, biasRadius);
+    }
+}
+exports.ImplicitGeometryMarkup = ImplicitGeometryMarkup;
+//# sourceMappingURL=ImplicitCurve2d.js.map

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImplicitCurve2d.js","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/ImplicitCurve2d.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,yEAAwE;AAExE,+DAA4D;AAE5D;;;;;GAKG;AACH,MAAsB,eAAe;IAWnC,oEAAoE;IAC7D,MAAM,CAAC,qBAAqB,CAAC,EAAU,EAAE,EAAU,EAAE,OAAiB,EAAE,OAAiB;QAC9F,MAAM,MAAM,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,gEAAgE;QAChE,IAAI,yBAAW,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC;YACxF,OAAO,MAAM,CAAC;QAChB,OAAO,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAUD;;;;OAIG;IACI,YAAY,CAAC,UAAmB;QACrC,IAAI,kBAAkB,GAAW,MAAM,CAAC,gBAAgB,CAAC;QACzD,IAAI,KAA0B,CAAC;QAC/B,8CAA8C;QAC9C,IAAI,CAAC,kBAAkB,CACrB,UAAU,EACV,CAAC,UAAmB,EAAE,QAA4B,EAAE,EAAE;YACpD,MAAM,eAAe,GAAG,UAAU,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YAC/D,sFAAsF;YACtF,IAAI,eAAe,GAAG,kBAAkB,EAAE,CAAC;gBACzC,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC3B,kBAAkB,GAAG,eAAe,CAAC;YACvC,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,KAAK,CAAC;IACf,CAAC;IAKD;;;;OAIG;IACI,gBAAgB,CAAC,QAAgB;QACtC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,wBAAwB,CAAC,QAAgB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAtED,0CAsEC;AAED;;;;;GAKG;AACH,MAAa,sBAAsB;IAC1B,KAAK,CAAU;IACf,KAAK,CAAkB;IAC9B;;;;OAIG;IACH,YAAmB,KAAc,EAAE,KAAsB;QACvD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAZD,wDAYC;AACD;;;;;GAKG;AACH,MAAa,sBAAsB;IAC1B,KAAK,CAAe;IACpB,IAAI,CAA2B;IACtC;;;OAGG;IACH,YAAmB,KAAmB;QACpC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IACD;;;;;;;;;OASG;IACI,gBAAgB,CACrB,UAAmB,EAAE,UAA2B,EAAE,cAAqB,EAAE,YAAoB;QAE7F,IAAI,IAAwB,CAAC;QAE7B,IAAI,YAAY,CAAC;QACjB,UAAU,CAAC,kBAAkB,CAC3B,UAAU,EACV,CAAC,UAAmB,EAAE,QAA4B,EAAE,EAAE;YACpD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;YACjF,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBACnC,IAAI,GAAG,CAAC,CAAC;gBACT,YAAY,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;YACpC,CAAC;QACH,CAAC,CACF,CAAC;QACF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,sBAAsB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,CAAC;YACrE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,qBAAqB,CAC1B,UAAmB,EAAE,cAAuB,EAAE,UAAkB,EAAE,WAA8B;QAEhG,KAAK,MAAM,CAAC,IAAI,WAAW;YACzB,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;IACrE,CAAC;CACF;AAxDD,wDAwDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Point2d, Vector2d } from \"../../../geometry3d/Point2dVector2d\";\nimport { XAndY } from \"../../../geometry3d/XYZProps\";\nimport { SmallSystem } from \"../../../numerics/SmallSystem\";\n\n/**\n * Abstract base class for curves with an implicit 2d function.\n * * Curves in the class are required to have an implicit function f(x,y)=0.\n * * They MAY (but are not required to) implement a parametric evaluator radiansToPoint2d.\n * @internal\n */\nexport abstract class ImplicitCurve2d {\n  /**\n   * Return the implicit function value at xy, i.e, f(x,y).\n   * @param xy point for evaluation.\n   */\n  public abstract functionValue(xy: XAndY): number;\n  /**\n   * Return the implicit function gradient at xy.\n   * @param xy point for evaluation.\n   */\n  public abstract gradient(xy: XAndY): Vector2d;\n  /** Map a gradient vector (du,dv) from its local frame to global. */\n  public static gradientLocalToGlobal(du: number, dv: number, vectorU: Vector2d, vectorV: Vector2d): Vector2d {\n    const result = Vector2d.create();\n    // use INVERSE of TRANSPOSE of [UV] matrix to map gradient terms\n    if (SmallSystem.linearSystem2d(vectorU.x, vectorU.y, vectorV.x, vectorV.y, du, dv, result))\n      return result;\n    return Vector2d.create(0, 0);\n  }\n  /**\n   * Find all perpendiculars from space point to the curve.\n   * Pass each in turn to the handler.\n   * @param spacePoint the space point.\n   * @handler the handler to receive all the points on the curve and radians where perpendicular happens.\n   */\n  public abstract emitPerpendiculars(\n    spacePoint: Point2d, handler: (curvePoint: Point2d, radians: number | undefined) => any,\n  ): any;\n  /**\n   * Call emitPerpendiculars. Return the closest of the perpendiculars.\n   * * Return undefined if no perpendiculars are received.\n   * @param spacePoint the space point.\n   */\n  public closestPoint(spacePoint: Point2d): Point2d | undefined {\n    let minDistanceSquared: number = Number.MAX_SAFE_INTEGER;\n    let point: Point2d | undefined;\n    // console.log ({space: spacePoint.toJSON()});\n    this.emitPerpendiculars(\n      spacePoint,\n      (curvePoint: Point2d, _radians: number | undefined) => {\n        const distanceSquared = curvePoint.distanceSquared(spacePoint);\n        // console.log ({distanceSquared, xy: curvePoint.toJSON(), minD: minDistanceSquared});\n        if (distanceSquared < minDistanceSquared) {\n          point = curvePoint.clone();\n          minDistanceSquared = distanceSquared;\n        }\n      }\n    );\n    return point;\n  }\n  /** Return true if the item has degenerate defining data. */\n  public abstract isDegenerate(): boolean;\n  /** Return a clone of the curve. */\n  public abstract clone(): ImplicitCurve2d;\n  /**\n   * OPTIONAL method to return a Point2d at given radians value.\n   * * The default implementation returns undefined.\n   * * Concrete classes that can be expressed as a function of radians should implement this.\n   */\n  public radiansToPoint2d(_radians: number): Point2d | undefined {\n    return undefined;\n  }\n  /**\n   * OPTIONAL method to return the tangent at given radians value.\n   * * The default implementation returns undefined.\n   * * Concrete classes that can be expressed as a function of radians should implement this.\n   */\n  public radiansToTangentVector2d(_radians: number): Vector2d | undefined {\n    return undefined;\n  }\n}\n\n/**\n * Carrier class containing:\n * * a point\n * * the curve to which the point is related.\n * @internal\n */\nexport class Point2dImplicitCurve2d {\n  public point: Point2d;\n  public curve: ImplicitCurve2d;\n  /**\n   * CAPTURE a point and curve.\n   * @param point point member\n   * @param curve curve member\n   */\n  public constructor(point: Point2d, curve: ImplicitCurve2d) {\n    this.point = point;\n    this.curve = curve;\n  }\n}\n/**\n * Carrier class containing:\n * * a curve which is a subclass of ImplicitCurve2d\n * * an array of paired point and ImplicitCurve2d.\n * @internal\n */\nexport class ImplicitGeometryMarkup<GeometryType extends ImplicitCurve2d> {\n  public curve: GeometryType;\n  public data: Point2dImplicitCurve2d[];\n  /**\n   * Construct a new carrier. The data array is created empty.\n   * @param curve curve to CAPTURE\n   */\n  public constructor(curve: GeometryType) {\n    this.curve = curve;\n    this.data = [];\n  }\n  /**\n   * * Use the otherCurve's emitPerpendiculars method to examine all perpendiculars from spacePoint to the curve.\n   * * For each such point, compute distance from bias point.\n   * * Choose the one whose distance is closest to biasDistance.\n   * * push the chosen point on the data array.\n   * @param spacePoint point to project to otherCurve\n   * @param otherCurve target curve for projection\n   * @param referencePoint reference point for point selection\n   * @param biasDistance preferred distance.\n   */\n  public appendClosePoint(\n    spacePoint: Point2d, otherCurve: ImplicitCurve2d, referencePoint: XAndY, biasDistance: number,\n  ): boolean {\n    let dMin: undefined | number;\n    \n    let closestPoint;\n    otherCurve.emitPerpendiculars(\n      spacePoint,\n      (curvePoint: Point2d, _radians: number | undefined) => {\n        const d = Math.abs(curvePoint.distance(referencePoint) - Math.abs(biasDistance));\n        if (dMin === undefined || d < dMin) {\n          dMin = d;\n          closestPoint = curvePoint.clone();\n        }\n      }\n    );\n    if (closestPoint !== undefined) {\n      this.data.push(new Point2dImplicitCurve2d(closestPoint, otherCurve));\n      return true;\n    }\n    return false;\n  }\n  /**\n   * Find closest points of an array of curves.\n   * @param spacePoint point to project to otherCurve\n   * @param referencePoint reference point for point selection\n   * @param biasDistance preferred distance.\n   * @param otherCurves array of curves to check.\n   */\n  public closePointsOfGeometry(\n    spacePoint: Point2d, referencePoint: Point2d, biasRadius: number, otherCurves: ImplicitCurve2d[],\n  ): void {\n    for (const c of otherCurves)\n      this.appendClosePoint(spacePoint, c, referencePoint, biasRadius);\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.d.ts

@@ -0,0 +1,27 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { CurvePrimitive } from "../../CurvePrimitive";
+import { ImplicitCurve2d } from "./ImplicitCurve2d";
+/**
+ * Class to convert between `CurvePrimitive` and `ImplicitCurve2d`.
+ * @internal
+ */
+export declare class ImplicitCurve2dConverter {
+    /**
+     * Return an implicit curve for the XY parts of the given curve3d.
+     * * z components of the input curve are completely ignored
+     * * input Arc3d can convert to UnboundedEllipse2d or circle
+     * * Returned curves are untrimmed, i.e. lines do not record endpoints and arcs have no angle range.
+     * @param curve3d curve to convert. Must be a LineSegment3d or Arc3d. Other curve types return `undefined`.
+     */
+    static createImplicitCurve2dFromCurvePrimitiveXY(curve3d: CurvePrimitive): ImplicitCurve2d | ImplicitCurve2d[] | undefined;
+    /**
+     *  Create a curve primitive from an implicit curve.
+     * @param source the implicit curve(s) to convert.
+     * @param sizeHint for unbounded curves, the size hint is used when creating a curve primitive. Larger values create a
+     * longer curve primitive. Ignored for bounded curves. Default is 10.
+     */
+    static createCurvePrimitiveFromImplicitCurve(source: ImplicitCurve2d | ImplicitCurve2d[], sizeHint?: number): CurvePrimitive | CurvePrimitive[] | undefined;
+}
+//# sourceMappingURL=ImplicitCurve2dConverter.d.ts.map

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImplicitCurve2dConverter.d.ts","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.ts"],"names":[],"mappings":"AAIA;;GAEG;AAOH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAOpD;;;GAGG;AACH,qBAAa,wBAAwB;IACnC;;;;;;OAMG;WACW,yCAAyC,CAAC,OAAO,EAAE,cAAc,GAC7E,eAAe,GAAG,eAAe,EAAE,GAAG,SAAS;IAqBjD;;;;;OAKG;WACW,qCAAqC,CACjD,MAAM,EAAE,eAAe,GAAG,eAAe,EAAE,EAAE,QAAQ,GAAE,MAAW,GACjE,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;CA4FjD"}

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.js

@@ -0,0 +1,152 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ImplicitCurve2dConverter = void 0;
+const BezierCurve3dH_1 = require("../../../bspline/BezierCurve3dH");
+const Point2dVector2d_1 = require("../../../geometry3d/Point2dVector2d");
+const Point3dVector3d_1 = require("../../../geometry3d/Point3dVector3d");
+const Point4d_1 = require("../../../geometry4d/Point4d");
+const Arc3d_1 = require("../../Arc3d");
+const CurvePrimitive_1 = require("../../CurvePrimitive");
+const LineSegment3d_1 = require("../../LineSegment3d");
+const UnboundedCircle2d_1 = require("./UnboundedCircle2d");
+const UnboundedEllipse2d_1 = require("./UnboundedEllipse2d");
+const UnboundedHyperbola2d_1 = require("./UnboundedHyperbola2d");
+const UnboundedLine2d_1 = require("./UnboundedLine2d");
+const UnboundedParabola2d_1 = require("./UnboundedParabola2d");
+/**
+ * Class to convert between `CurvePrimitive` and `ImplicitCurve2d`.
+ * @internal
+ */
+class ImplicitCurve2dConverter {
+    /**
+     * Return an implicit curve for the XY parts of the given curve3d.
+     * * z components of the input curve are completely ignored
+     * * input Arc3d can convert to UnboundedEllipse2d or circle
+     * * Returned curves are untrimmed, i.e. lines do not record endpoints and arcs have no angle range.
+     * @param curve3d curve to convert. Must be a LineSegment3d or Arc3d. Other curve types return `undefined`.
+     */
+    static createImplicitCurve2dFromCurvePrimitiveXY(curve3d) {
+        if (curve3d instanceof LineSegment3d_1.LineSegment3d) {
+            const pointA = curve3d.startPoint();
+            const pointB = curve3d.endPoint();
+            return UnboundedLine2d_1.UnboundedLine2dByPointAndNormal.createPointXYPointXY(pointA.x, pointA.y, pointB.x, pointB.y);
+        }
+        else if (curve3d instanceof Arc3d_1.Arc3d) {
+            const center = curve3d.center;
+            const columnX = curve3d.matrixRef.columnX();
+            const columnY = curve3d.matrixRef.columnY();
+            if (curve3d.isCircularXY || curve3d.isDegenerateCircle) {
+                return UnboundedCircle2d_1.UnboundedCircle2dByCenterAndRadius.createXYRadius(center.x, center.y, columnX.magnitudeXY());
+            }
+            else {
+                return UnboundedEllipse2d_1.UnboundedEllipse2d.createCenterAndAxisVectors(center, Point2dVector2d_1.Vector2d.createFrom(columnX), Point2dVector2d_1.Vector2d.createFrom(columnY));
+            }
+        }
+        return undefined;
+    }
+    /**
+     *  Create a curve primitive from an implicit curve.
+     * @param source the implicit curve(s) to convert.
+     * @param sizeHint for unbounded curves, the size hint is used when creating a curve primitive. Larger values create a
+     * longer curve primitive. Ignored for bounded curves. Default is 10.
+     */
+    static createCurvePrimitiveFromImplicitCurve(source, sizeHint = 10) {
+        if (Array.isArray(source)) {
+            const result = [];
+            for (const s of source) {
+                const c = this.createCurvePrimitiveFromImplicitCurve(s);
+                if (c === undefined) {
+                    // ignore it
+                }
+                else if (c instanceof CurvePrimitive_1.CurvePrimitive) {
+                    result.push(c);
+                }
+                else if (Array.isArray(c)) {
+                    for (const c1 of c)
+                        result.push(c1);
+                }
+            }
+            return result;
+        }
+        // source is a single curve
+        if (source instanceof UnboundedCircle2d_1.UnboundedCircle2dByCenterAndRadius) {
+            return Arc3d_1.Arc3d.createXY(Point3dVector3d_1.Point3d.createFrom(source.center), source.radius);
+        }
+        else if (source instanceof UnboundedLine2d_1.UnboundedLine2dByPointAndNormal) {
+            const vectorAlong = source.vectorAlongLine();
+            return LineSegment3d_1.LineSegment3d.createXYXY(source.point.x - sizeHint * vectorAlong.x, source.point.y - sizeHint * vectorAlong.y, source.point.x + sizeHint * vectorAlong.x, source.point.y + sizeHint * vectorAlong.y);
+        }
+        else if (source instanceof UnboundedHyperbola2d_1.UnboundedHyperbola2d) {
+            const result = [];
+            /* COMMENTED CODE FOR LINESTRING APPROXIMATION
+            const degreeStep = 10.0;
+            const degreeLimit = 80.0;
+            for (const signX of [1, -1]) {
+              const strokes = [];
+              for (const theta = Angle.createDegrees(-degreeLimit);
+                theta.degrees < degreeLimit + 1;
+                theta.setDegrees(theta.degrees + degreeStep)) {
+                const c = signX * theta.cos();
+                const s = theta.sin();
+                const xy = Point3d.createFrom(source.pointA.plus2Scaled(source.vectorU, 1.0 / c, source.vectorV, s / c));
+                strokes.push(Point3d.createFrom(xy));
+              }
+              result.push(LineString3d.create(strokes));
+            }
+            */
+            // The bezier branches open on plus and minus u axes, with asymptotes at 45 degree angles in local space
+            // Construct a bezier for 180 degrees of unit circle from negative y to plus 1 with (c,s,w)
+            // Reverse c and w so its normalized form is (sec, tan, 1)
+            // Map those so bezier 0 maps to U-V asymptote, bezier 1 maps to U+v, and bezier 0.5 maps to A
+            // but the secants have 0 weight and evaluate at infinity
+            // so subdivide to safely within 0..1
+            // Repeat with negated sign for U to get the other branch.
+            for (const signU of [1, -1]) {
+                const poles = [
+                    Point4d_1.Point4d.create(signU * source.vectorU.x + source.vectorV.x, signU * source.vectorU.y + source.vectorV.y, 0, 0),
+                    Point4d_1.Point4d.create(source.center.x, source.center.y, 0, 1),
+                    Point4d_1.Point4d.create(signU * source.vectorU.x - source.vectorV.x, signU * source.vectorU.y - source.vectorV.y, 0, 0),
+                ];
+                const fullBezier = BezierCurve3dH_1.BezierCurve3dH.create(poles);
+                if (fullBezier) {
+                    const branch = fullBezier?.clonePartialCurve(0.05, 0.95);
+                    result.push(branch);
+                }
+            }
+            return result;
+        }
+        else if (source instanceof UnboundedEllipse2d_1.UnboundedEllipse2d) {
+            return Arc3d_1.Arc3d.create(Point3dVector3d_1.Point3d.createFrom(source.center), Point3dVector3d_1.Vector3d.createFrom(source.vectorU), Point3dVector3d_1.Vector3d.createFrom(source.vectorV));
+        }
+        else if (source instanceof UnboundedParabola2d_1.UnboundedParabola2d) {
+            /*
+            const halfParabolaPoles = [
+              Point4d.create (2 * source.pointA.x, 2 *source.pointA.y, 0, 2),
+              Point4d.create (source.vectorU.x, source.vectorU.y, 0, 0),
+              Point4d.create (2 * source.vectorV.x, 2 * source.vectorV.y, 0, 0),
+            ];
+            */
+            const point0 = source.center.plus2Scaled(source.vectorU, 1, source.vectorV, 1);
+            const point1 = source.center.minus(source.vectorV);
+            const point2 = source.center.plus2Scaled(source.vectorU, -1, source.vectorV, 1);
+            const poles = [
+                Point4d_1.Point4d.create(point0.x, point0.y, 0, 1),
+                Point4d_1.Point4d.create(point1.x, point1.y, 0, 1),
+                Point4d_1.Point4d.create(point2.x, point2.y, 0, 1),
+            ];
+            const centerBezier = BezierCurve3dH_1.BezierCurve3dH.create(poles);
+            if (centerBezier !== undefined)
+                return centerBezier.clonePartialCurve(-2, 3);
+        }
+        return undefined;
+    }
+}
+exports.ImplicitCurve2dConverter = ImplicitCurve2dConverter;
+//# sourceMappingURL=ImplicitCurve2dConverter.js.map

package/lib/cjs/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImplicitCurve2dConverter.js","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/ImplicitCurve2dConverter.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,oEAAiE;AACjE,yEAA+D;AAC/D,yEAAwE;AACxE,yDAAsD;AACtD,uCAAoC;AACpC,yDAAsD;AACtD,uDAAoD;AAEpD,2DAAyE;AACzE,6DAA0D;AAC1D,iEAA8D;AAC9D,uDAAoE;AACpE,+DAA4D;AAE5D;;;GAGG;AACH,MAAa,wBAAwB;IACnC;;;;;;OAMG;IACI,MAAM,CAAC,yCAAyC,CAAC,OAAuB;QAE7E,IAAI,OAAO,YAAY,6BAAa,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAClC,OAAO,iDAA+B,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACtG,CAAC;aAAM,IAAI,OAAO,YAAY,aAAK,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;YAC9B,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,CAAA;YAC3C,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,CAAA;YAC3C,IAAI,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;gBACvD,OAAO,sDAAkC,CAAC,cAAc,CACtD,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,EAAE,CAC1C,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,OAAO,uCAAkB,CAAC,0BAA0B,CAClD,MAAM,EAAE,0BAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,0BAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CACnE,CAAC;YACJ,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qCAAqC,CACjD,MAA2C,EAAE,WAAmB,EAAE;QAElE,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,CAAC,CAAC,CAAC;gBACxD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;oBACpB,YAAY;gBACd,CAAC;qBAAM,IAAI,CAAC,YAAY,+BAAc,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;qBAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5B,KAAK,MAAM,EAAE,IAAI,CAAC;wBAChB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,2BAA2B;QAC3B,IAAI,MAAM,YAAY,sDAAkC,EAAE,CAAC;YACzD,OAAO,aAAK,CAAC,QAAQ,CAAC,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,MAAM,YAAY,iDAA+B,EAAE,CAAC;YAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,eAAe,EAAE,CAAC;YAC7C,OAAO,6BAAa,CAAC,UAAU,CAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC,CAAC,EACpF,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC,CAAC,CACrF,CAAC;QACJ,CAAC;aAAM,IAAI,MAAM,YAAY,2CAAoB,EAAE,CAAC;YAClD,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC;;;;;;;;;;;;;;;cAeE;YACF,wGAAwG;YACxG,2FAA2F;YAC3F,0DAA0D;YAC1D,8FAA8F;YAC9F,yDAAyD;YACzD,qCAAqC;YACrC,0DAA0D;YAC1D,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5B,MAAM,KAAK,GAAG;oBACZ,iBAAO,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC9G,iBAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACtD,iBAAO,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBAC/G,CAAC;gBACF,MAAM,UAAU,GAAG,+BAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChD,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,MAAM,GAAG,UAAU,EAAE,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBACzD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;aAAM,IAAI,MAAM,YAAY,uCAAkB,EAAE,CAAC;YAChD,OAAO,aAAK,CAAC,MAAM,CACjB,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,EACjC,0BAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,EACnC,0BAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CACpC,CAAC;QACJ,CAAC;aAAM,IAAI,MAAM,YAAY,yCAAmB,EAAE,CAAC;YACjD;;;;;;cAME;YACF,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG;gBACZ,iBAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxC,iBAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxC,iBAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACzC,CAAC;YAEF,MAAM,YAAY,GAAG,+BAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAClD,IAAI,YAAY,KAAK,SAAS;gBAC5B,OAAO,YAAY,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAlID,4DAkIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { BezierCurve3dH } from \"../../../bspline/BezierCurve3dH\";\nimport { Vector2d } from \"../../../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../../../geometry3d/Point3dVector3d\";\nimport { Point4d } from \"../../../geometry4d/Point4d\";\nimport { Arc3d } from \"../../Arc3d\";\nimport { CurvePrimitive } from \"../../CurvePrimitive\";\nimport { LineSegment3d } from \"../../LineSegment3d\";\nimport { ImplicitCurve2d } from \"./ImplicitCurve2d\";\nimport { UnboundedCircle2dByCenterAndRadius } from \"./UnboundedCircle2d\";\nimport { UnboundedEllipse2d } from \"./UnboundedEllipse2d\";\nimport { UnboundedHyperbola2d } from \"./UnboundedHyperbola2d\";\nimport { UnboundedLine2dByPointAndNormal } from \"./UnboundedLine2d\";\nimport { UnboundedParabola2d } from \"./UnboundedParabola2d\";\n\n/**\n * Class to convert between `CurvePrimitive` and `ImplicitCurve2d`.\n * @internal\n */\nexport class ImplicitCurve2dConverter {\n  /**\n   * Return an implicit curve for the XY parts of the given curve3d.\n   * * z components of the input curve are completely ignored\n   * * input Arc3d can convert to UnboundedEllipse2d or circle\n   * * Returned curves are untrimmed, i.e. lines do not record endpoints and arcs have no angle range.\n   * @param curve3d curve to convert. Must be a LineSegment3d or Arc3d. Other curve types return `undefined`.\n   */\n  public static createImplicitCurve2dFromCurvePrimitiveXY(curve3d: CurvePrimitive):\n    ImplicitCurve2d | ImplicitCurve2d[] | undefined {\n    if (curve3d instanceof LineSegment3d) {\n      const pointA = curve3d.startPoint();\n      const pointB = curve3d.endPoint();\n      return UnboundedLine2dByPointAndNormal.createPointXYPointXY(pointA.x, pointA.y, pointB.x, pointB.y);\n    } else if (curve3d instanceof Arc3d) {\n      const center = curve3d.center;\n      const columnX = curve3d.matrixRef.columnX()\n      const columnY = curve3d.matrixRef.columnY()\n      if (curve3d.isCircularXY || curve3d.isDegenerateCircle) {\n        return UnboundedCircle2dByCenterAndRadius.createXYRadius(\n          center.x, center.y, columnX.magnitudeXY(),\n        );\n      } else {\n        return UnboundedEllipse2d.createCenterAndAxisVectors(\n          center, Vector2d.createFrom(columnX), Vector2d.createFrom(columnY),\n        );\n      }\n    }\n    return undefined;\n  }\n  /**\n   *  Create a curve primitive from an implicit curve.\n   * @param source the implicit curve(s) to convert.\n   * @param sizeHint for unbounded curves, the size hint is used when creating a curve primitive. Larger values create a\n   * longer curve primitive. Ignored for bounded curves. Default is 10.\n   */\n  public static createCurvePrimitiveFromImplicitCurve(\n    source: ImplicitCurve2d | ImplicitCurve2d[], sizeHint: number = 10,\n  ): CurvePrimitive | CurvePrimitive[] | undefined {\n    if (Array.isArray(source)) {\n      const result: CurvePrimitive[] = [];\n      for (const s of source) {\n        const c = this.createCurvePrimitiveFromImplicitCurve(s);\n        if (c === undefined) {\n          // ignore it\n        } else if (c instanceof CurvePrimitive) {\n          result.push(c);\n        } else if (Array.isArray(c)) {\n          for (const c1 of c)\n            result.push(c1);\n        }\n      }\n      return result;\n    }\n    // source is a single curve\n    if (source instanceof UnboundedCircle2dByCenterAndRadius) {\n      return Arc3d.createXY(Point3d.createFrom(source.center), source.radius);\n    } else if (source instanceof UnboundedLine2dByPointAndNormal) {\n      const vectorAlong = source.vectorAlongLine();\n      return LineSegment3d.createXYXY(\n        source.point.x - sizeHint * vectorAlong.x, source.point.y - sizeHint * vectorAlong.y,\n        source.point.x + sizeHint * vectorAlong.x, source.point.y + sizeHint * vectorAlong.y,\n      );\n    } else if (source instanceof UnboundedHyperbola2d) {\n      const result: CurvePrimitive[] = [];\n      /* COMMENTED CODE FOR LINESTRING APPROXIMATION\n      const degreeStep = 10.0;\n      const degreeLimit = 80.0;\n      for (const signX of [1, -1]) {\n        const strokes = [];\n        for (const theta = Angle.createDegrees(-degreeLimit);\n          theta.degrees < degreeLimit + 1;\n          theta.setDegrees(theta.degrees + degreeStep)) {\n          const c = signX * theta.cos();\n          const s = theta.sin();\n          const xy = Point3d.createFrom(source.pointA.plus2Scaled(source.vectorU, 1.0 / c, source.vectorV, s / c));\n          strokes.push(Point3d.createFrom(xy));\n        }\n        result.push(LineString3d.create(strokes));\n      }\n      */\n      // The bezier branches open on plus and minus u axes, with asymptotes at 45 degree angles in local space\n      // Construct a bezier for 180 degrees of unit circle from negative y to plus 1 with (c,s,w)\n      // Reverse c and w so its normalized form is (sec, tan, 1)\n      // Map those so bezier 0 maps to U-V asymptote, bezier 1 maps to U+v, and bezier 0.5 maps to A\n      // but the secants have 0 weight and evaluate at infinity\n      // so subdivide to safely within 0..1\n      // Repeat with negated sign for U to get the other branch.\n      for (const signU of [1, -1]) {\n        const poles = [\n          Point4d.create(signU * source.vectorU.x + source.vectorV.x, signU * source.vectorU.y + source.vectorV.y, 0, 0),\n          Point4d.create(source.center.x, source.center.y, 0, 1),\n          Point4d.create(signU * source.vectorU.x - source.vectorV.x, signU * source.vectorU.y - source.vectorV.y, 0, 0),\n        ];\n        const fullBezier = BezierCurve3dH.create(poles);\n        if (fullBezier) {\n          const branch = fullBezier?.clonePartialCurve(0.05, 0.95);\n          result.push(branch);\n        }\n      }\n      return result;\n    } else if (source instanceof UnboundedEllipse2d) {\n      return Arc3d.create(\n        Point3d.createFrom(source.center),\n        Vector3d.createFrom(source.vectorU),\n        Vector3d.createFrom(source.vectorV),\n      );\n    } else if (source instanceof UnboundedParabola2d) {\n      /*\n      const halfParabolaPoles = [\n        Point4d.create (2 * source.pointA.x, 2 *source.pointA.y, 0, 2),\n        Point4d.create (source.vectorU.x, source.vectorU.y, 0, 0),\n        Point4d.create (2 * source.vectorV.x, 2 * source.vectorV.y, 0, 0),\n      ];\n      */\n      const point0 = source.center.plus2Scaled(source.vectorU, 1, source.vectorV, 1);\n      const point1 = source.center.minus(source.vectorV);\n      const point2 = source.center.plus2Scaled(source.vectorU, -1, source.vectorV, 1);\n      const poles = [\n        Point4d.create(point0.x, point0.y, 0, 1),\n        Point4d.create(point1.x, point1.y, 0, 1),\n        Point4d.create(point2.x, point2.y, 0, 1),\n      ];\n\n      const centerBezier = BezierCurve3dH.create(poles);\n      if (centerBezier !== undefined)\n        return centerBezier.clonePartialCurve(-2, 3);\n    }\n    return undefined;\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/geometry2d/UnboundedCircle2d.d.ts

@@ -0,0 +1,81 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Point2d, Vector2d } from "../../../geometry3d/Point2dVector2d";
+import { XAndY } from "../../../geometry3d/XYZProps";
+import { ImplicitCurve2d } from "./ImplicitCurve2d";
+import { UnboundedLine2dByPointAndNormal } from "./UnboundedLine2d";
+/**
+ * Internal class for a complete circle in the xy plane, with center and radius stored.
+ * @internal
+ */
+export declare class UnboundedCircle2dByCenterAndRadius extends ImplicitCurve2d {
+    /** The circle's center. */
+    center: Point2d;
+    /** The circle radius. */
+    radius: number;
+    private constructor();
+    /** Return a clone of this circle. */
+    clone(): UnboundedCircle2dByCenterAndRadius;
+    /** Return a clone of this circle, with radius negated. */
+    cloneNegateRadius(): UnboundedCircle2dByCenterAndRadius;
+    /**
+     * Create an ImplicitCircle2d from XY parts of its center and its radius.
+     * @param centerX x coordinate of center
+     * @param centerY y coordinate of center
+     * @param radius circle radius
+     * @returns newly created circle object
+     */
+    static createXYRadius(centerX: number, centerY: number, radius: number): UnboundedCircle2dByCenterAndRadius;
+    /**
+     * Create an ImplicitCircle2d from an xy object and a radius.
+     * * Zero radius is valid.
+     * * The input coordinates are copied -- the center is NOT captured.
+     * @param center xy coordinates of center
+     * @param radius circle radius
+     * @returns newly created circle object
+     */
+    static createPointRadius(center: XAndY, radius: number): UnboundedCircle2dByCenterAndRadius;
+    /**
+     * Returns gradient of the implicit function.
+     * @param xy space point
+     * @returns squared distance to center minus squared radius.
+     */
+    functionValue(xy: XAndY): number;
+    /**
+     * Returns gradient of the implicit function.
+     * @param xy space point
+     */
+    gradient(xy: XAndY): Vector2d;
+    /**
+     * Emit circle points for which a vector to the space point is perpendicular to the circle.
+     * * For a non-zero radius circle, there are two perpendiculars. The one on the side of the space point is emitted first.
+     * * For a zero radius circle, the vector from center to the space point is the only perpendicular.
+     * @param spacePoint the space point.
+     * @handler the handler to receive all the points on the curve and radians where perpendicular happens.
+     */
+    emitPerpendiculars(spacePoint: Point2d, handler: (curvePoint: Point2d, radians: number | undefined) => any): void;
+    /**
+     * Returns true if the circle radius is near zero.
+     */
+    isDegenerate(): boolean;
+    /**
+     * Test if the centers and radii of two circles are close.
+     * @param other second circle
+     * @returns true if identical to tolerance.
+     */
+    isSameCircle(other: UnboundedCircle2dByCenterAndRadius, negatedRadiiAreEqual: boolean): boolean;
+    /**
+     * Compute intersections with another circle.
+     * @param other second circle
+     * @return array of 0, 1, or 2 points of intersection
+     */
+    intersectCircle(other: UnboundedCircle2dByCenterAndRadius): Point2d[];
+    /**
+     * Compute intersections with a line
+     * @param line the line.
+     * @return array of 0, 1, or 2 points of intersection
+     */
+    intersectLine(line: UnboundedLine2dByPointAndNormal): Point2d[];
+}
+//# sourceMappingURL=UnboundedCircle2d.d.ts.map

package/lib/cjs/curve/internalContexts/geometry2d/UnboundedCircle2d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnboundedCircle2d.d.ts","sourceRoot":"","sources":["../../../../../src/curve/internalContexts/geometry2d/UnboundedCircle2d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AACxE,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAErD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,+BAA+B,EAAE,MAAM,mBAAmB,CAAC;AAEpE;;;GAGG;AACH,qBAAa,kCAAmC,SAAQ,eAAe;IACrE,2BAA2B;IACpB,MAAM,EAAE,OAAO,CAAC;IACvB,yBAAyB;IAClB,MAAM,EAAE,MAAM,CAAC;IAEtB,OAAO;IAKP,qCAAqC;IAC9B,KAAK,IAAI,kCAAkC;IAIlD,0DAA0D;IACnD,iBAAiB,IAAI,kCAAkC;IAI9D;;;;;;OAMG;WACW,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,kCAAkC;IAGlH;;;;;;;OAOG;WACW,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,kCAAkC;IAGlG;;;;OAIG;IACa,aAAa,CAAC,EAAE,EAAE,KAAK,GAAG,MAAM;IAGhD;;;OAGG;IACa,QAAQ,CAAC,EAAE,EAAE,KAAK,GAAG,QAAQ;IAG7C;;;;;;OAMG;IACa,kBAAkB,CAChC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS,KAAK,GAAG;IAUzF;;OAEG;IAEa,YAAY,IAAI,OAAO;IAGvC;;;;OAIG;IACI,YAAY,CAAC,KAAK,EAAE,kCAAkC,EAAE,oBAAoB,EAAE,OAAO,GAAG,OAAO;IAOtG;;;;OAIG;IACI,eAAe,CAAC,KAAK,EAAE,kCAAkC,GAAG,OAAO,EAAE;IA0B5E;;;;OAIG;IACI,aAAa,CAAC,IAAI,EAAE,+BAA+B,GAAG,OAAO,EAAE;CAqBvE"}