@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/topology/ChainMerge.js

@@ -0,0 +1,280 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { LineString3d } from "../curve/LineString3d";
+import { Geometry } from "../Geometry";
+import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
+import { Vector3d } from "../geometry3d/Point3dVector3d";
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
+import { HalfEdgeGraphOps } from "./Merging";
+/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */
+class ChainMergeContextValidatedOptions {
+    /**
+     * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!
+     * @param tolerance
+     * @param unitVectorForPrimarySort
+     */
+    constructor(tolerance, unitVectorForPrimarySort) {
+        this.tolerance = tolerance;
+        this.primarySortDirection = unitVectorForPrimarySort;
+    }
+    /** return a unit vector aligned with optional direction.
+     * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points
+     */
+    static createPrimarySortVector(vector) {
+        if (vector === undefined) {
+            vector = this._defaultPrimarySortDirection.clone();
+        }
+        return vector.normalizeWithDefault(ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x, ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y, ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);
+    }
+    /** return the default option set. */
+    static createFromUnValidated(options) {
+        const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());
+        if (options !== undefined) {
+            if (options.tolerance !== undefined)
+                result.tolerance = options.tolerance;
+            if (options.primarySortDirection !== undefined)
+                result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();
+        }
+        return result;
+    }
+    /** Clone this context. */
+    clone() {
+        return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);
+    }
+}
+/** UNNORMALIZED base vector for sorting.
+ * * Actual vector hoisted into an instance is normalized.
+ */
+ChainMergeContextValidatedOptions._defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);
+/**
+ * * Context for assembling line segments into chains.
+ * * Use the context in phases:
+ *   * Create the context:   `context = ChainMergeContext.create ()`
+ *   * Add line with any combination of:
+ *      * `context.addSegment(pointA, pointB)`
+ *      * `context.addLineSegment3dArray (segments)`
+ *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:
+ *      * `context.clusterAndMergeVerticesXYZ ()`
+ *   * Collect the chains:
+ *      * myLinestringArray = context.collectMaximalChains();
+ * * The context carries an optional plane which is used by addSegmentsOnPlane
+ *
+ * @internal
+ */
+export class ChainMergeContext {
+    constructor(options) {
+        this._graph = new HalfEdgeGraph();
+        this._options = options;
+    }
+    /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */
+    set plane(value) { this._plane = value; }
+    /** Property access for the reference plane. */
+    get plane() { return this._plane; }
+    /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */
+    set convexClipper(value) { this._convexClipper = value; }
+    /** Property access for the reference plane. */
+    get convexClipper() { return this._convexClipper; }
+    /**
+     * * Construct an empty chain merge graph.
+     * * The options parameter may contain any combination of the options values.
+     *   * tolerance = absolute tolerance for declaring points equal.
+     *     * Default is `Geometry.smallMetricDistance`
+     *   * primarySortDirection = direction for first sort.
+     *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.
+     *     * The default points into the first octant with non-obvious components.
+     */
+    static create(options) {
+        const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);
+        return new ChainMergeContext(validatedOptions);
+    }
+    /** Add a segment to the evolving graph. */
+    addSegment(pointA, pointB) {
+        this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);
+    }
+    /** Add all segments from an array to the graph. */
+    addLineSegment3dArray(data) {
+        for (const segment of data) {
+            this.addSegment(segment.point0Ref, segment.point1Ref);
+        }
+    }
+    /** Add edges for all segments that are "on" the plane.
+     * * No action if `this.plane` is undefined.
+     */
+    addSegmentsOnPlane(points, addClosure = false) {
+        if (!this._plane)
+            return;
+        const plane = this._plane;
+        let i0 = addClosure ? points.length - 1 : 0;
+        let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);
+        let i1 = addClosure ? 0 : 1;
+        let a1;
+        for (; i1 < points.length; i0 = i1++, a0 = a1) {
+            a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);
+            if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))
+                this._graph.createEdgeXYZXYZ(points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0, points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);
+        }
+    }
+    /**
+     * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.
+     * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.
+     * * Hence take dot product of x,y,z with non-trivial fraction values.
+     * @param node node with x,y,z coordinates
+     */
+    primarySortKey(node) {
+        return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);
+    }
+    /** Return difference of sortData members as sort comparison */
+    static nodeCompareSortData(nodeA, nodeB) {
+        return nodeA.sortData - nodeB.sortData;
+    }
+    /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */
+    static isIsolatedEnd(nodeA) {
+        return nodeA.vertexSuccessor === nodeA;
+    }
+    /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */
+    static isChainInteriorVertex(nodeA) {
+        const nodeB = nodeA.vertexSuccessor;
+        return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;
+    }
+    /**
+     * * isolate all edge ends.
+     * * perform cluster analysis to determine nearly coincident points.
+     * * pinch all edges together at each vertex.
+     */
+    clusterAndMergeVerticesXYZ() {
+        HalfEdgeGraphOps.isolateAllEdges(this._graph);
+        for (const p of this._graph.allHalfEdges) {
+            p.sortData = this.primarySortKey(p);
+        }
+        const sortArray = this._graph.allHalfEdges.slice();
+        sortArray.sort(ChainMergeContext.nodeCompareSortData);
+        const xyzTolerance = this._options.tolerance;
+        // A node is unvisited if it is its own vertex successor !!!
+        // otherwise the node has already been twisted into a base vertex.
+        const n = sortArray.length;
+        for (let i0 = 0; i0 < n; i0++) {
+            const node0 = sortArray[i0];
+            const qMin = node0.sortData;
+            const qMax = qMin + xyzTolerance;
+            if (ChainMergeContext.isIsolatedEnd(node0)) {
+                for (let i1 = i0 + 1; i1 < n; i1++) {
+                    const node1 = sortArray[i1];
+                    if (ChainMergeContext.isIsolatedEnd(node1)) {
+                        if (node1.sortData > qMax)
+                            break;
+                        if (node0.distanceXYZ(node1) <= xyzTolerance) {
+                            HalfEdge.pinch(node0, node1);
+                            node1.setXYZFrom(node0); // force true equal coordinates.
+                        }
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.
+     * @param chains growing array of chains.
+     * @param node0 start node for search.
+     */
+    collectMaximalLineString3dFromStartNode(chains, node0, visitMask) {
+        if (!node0.isMaskSet(visitMask)) {
+            const ls = LineString3d.create();
+            ls.addPointXYZ(node0.x, node0.y, node0.z);
+            for (;;) {
+                node0.setMask(visitMask);
+                node0.edgeMate.setMask(visitMask);
+                node0 = node0.faceSuccessor;
+                ls.addPointXYZ(node0.x, node0.y, node0.z);
+                if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))
+                    break;
+            }
+            chains.push(ls);
+        }
+    }
+    /**
+     * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.
+     * @param chains growing array of chains.
+     * @param node0 start node for search.
+     */
+    collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask) {
+        if (!node0.isMaskSet(visitMask)) {
+            const points = new GrowableXYZArray();
+            points.pushXYZ(node0.x, node0.y, node0.z);
+            for (;;) {
+                node0.setMask(visitMask);
+                node0.edgeMate.setMask(visitMask);
+                node0 = node0.faceSuccessor;
+                points.pushXYZ(node0.x, node0.y, node0.z);
+                if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))
+                    break;
+            }
+            if (points.length > 0)
+                result.push(points);
+        }
+    }
+    /**
+     * * find edges with start, end in same vertex loop.
+     * * pinch them away from the loop
+     * * set mask on both sides.
+     * * Return the number of excisions.
+     */
+    exciseAndMarkSlingEdges(mask) {
+        let n = 0;
+        for (const p of this._graph.allHalfEdges) {
+            if (p.distanceXYZ(p.edgeMate) < this._options.tolerance
+                && !p.isMaskSet(mask)) {
+                const q = p.edgeMate;
+                HalfEdge.pinch(p, p.vertexPredecessor);
+                HalfEdge.pinch(q, q.vertexPredecessor);
+                p.setMask(mask);
+                q.setMask(mask);
+                n++;
+            }
+        }
+        return n;
+    }
+    /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.
+     * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`
+     */
+    collectMaximalChains() {
+        const result = [];
+        const visitMask = HalfEdgeMask.VISITED;
+        // Pass 0: excise and mark zero-length edges.
+        this.exciseAndMarkSlingEdges(visitMask);
+        this._graph.clearMask(visitMask);
+        // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.
+        // (Note that collectMaximalChain checks the visit mask.)
+        for (const node0 of this._graph.allHalfEdges) {
+            if (!ChainMergeContext.isChainInteriorVertex(node0)) {
+                this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);
+            }
+        }
+        // Pass 2: start anywhere in an unvisited loop.
+        for (const node0 of this._graph.allHalfEdges) {
+            this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);
+        }
+        return result;
+    }
+    collectMaximalGrowableXYZArrays() {
+        const result = [];
+        const visitMask = HalfEdgeMask.VISITED;
+        // Pass 0: excise and mark zero-length edges.
+        this.exciseAndMarkSlingEdges(visitMask);
+        this._graph.clearMask(visitMask);
+        // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.
+        // (Note that collectMaximalChain checks the visit mask.)
+        for (const node0 of this._graph.allHalfEdges) {
+            if (!ChainMergeContext.isChainInteriorVertex(node0)) {
+                this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);
+            }
+        }
+        // Pass 2: start anywhere in an unvisited loop.
+        for (const node0 of this._graph.allHalfEdges) {
+            this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=ChainMerge.js.map

package/lib/esm/topology/ChainMerge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChainMerge.js","sourceRoot":"","sources":["../../../src/topology/ChainMerge.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAA0B,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAoB7C,oGAAoG;AACpG,MAAM,iCAAiC;IAyBrC;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,wBAAkC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,oBAAoB,GAAG,wBAAwB,CAAC;IACvD,CAAC;IApBD;;OAEG;IACI,MAAM,CAAC,uBAAuB,CAAC,MAAiB;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE;YACxB,MAAM,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC;SACpD;QACD,OAAO,MAAM,CAAC,oBAAoB,CAChC,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAUD,qCAAqC;IAC9B,MAAM,CAAC,qBAAqB,CAAC,OAAkC;QACpE,MAAM,MAAM,GAAG,IAAI,iCAAiC,CAAC,QAAQ,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAChJ,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBACjC,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACvC,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAC5C,MAAM,CAAC,oBAAoB,GAAG,iCAAiC,CAAC,uBAAuB,EAAE,CAAC;SAC7F;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,iCAAiC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC1F,CAAC;;AA3CD;;GAEG;AACqB,8DAA4B,GAAG,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;AA0CjH;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,iBAAiB;IAM5B,YAAoB,OAA0C;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,IAAW,KAAK,CAAC,KAAyC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,IAAW,KAAK,KAAyC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9E,uEAAuE;IACvE,IAAW,aAAa,CAAC,KAAqC,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;IAChG,+CAA+C;IAC/C,IAAW,aAAa,KAAqC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAE1F;;;;;;;;OAQG;IACI,MAAM,CAAC,MAAM,CAAC,OAAkC;QACrD,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IACD,2CAA2C;IACpC,UAAU,CAAC,MAAe,EAAE,MAAe;QAChD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,mDAAmD;IAC5C,qBAAqB,CAAC,IAAqB;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;SACvD;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,MAAwB,EAAE,aAAsB,KAAK;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAG,EAAE,GAAG,EAAE,EAAE;YAC9C,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,QAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC1B,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,EACnH,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SAC1H;IACH,CAAC;IACD;;;;;OAKG;IACK,cAAc,CAAC,IAAc;QACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,+DAA+D;IACvD,MAAM,CAAC,mBAAmB,CAAC,KAAe,EAAE,KAAe;QACjE,OAAO,KAAK,CAAC,QAAS,GAAG,KAAK,CAAC,QAAS,CAAC;IAC3C,CAAC;IACD,gIAAgI;IACxH,MAAM,CAAC,aAAa,CAAC,KAAe;QAC1C,OAAO,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IACzC,CAAC;IAED,6IAA6I;IACrI,MAAM,CAAC,qBAAqB,CAAC,KAAe;QAClD,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,0BAA0B;QAC/B,gBAAgB,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YACxC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;SACrC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,4DAA4D;QAC5D,kEAAkE;QAClE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE;YAC7B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAS,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;YACjC,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE;gBAC1C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE;oBAClC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE;wBAC1C,IAAI,KAAK,CAAC,QAAS,GAAG,IAAI;4BACxB,MAAM;wBACR,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,YAAY,EAAE;4BAC5C,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAI,gCAAgC;yBAC7D;qBACF;iBACF;aACF;SACF;IACH,CAAC;IACD;;;;OAIG;IACK,uCAAuC,CAAC,MAAsB,EAAE,KAAe,EAAE,SAAuB;QAC9G,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YAC/B,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACjC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU;gBACR,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;aACT;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACjB;IACH,CAAC;IACD;;;;OAIG;IACK,2CAA2C,CAAC,MAA0B,EAAE,KAAe,EAAE,SAAuB;QACtH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YAC/B,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU;gBACR,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;aACT;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACvB;IACH,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,IAAkB;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YACxC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS;mBAClD,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACrB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,EAAE,CAAC;aACL;SACF;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,oBAAoB;QACzB,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE;gBACnD,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;aACxE;SACF;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;SACxE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,+BAA+B;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE;gBACnD,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;aAC5E;SACF;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;SAC5E;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","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\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * interface containing various options appropriate to merging lines segments into chains.\n * @internal\n */\nexport interface ChainMergeContextOptions {\n  /**\n   * Tolerance for declaring points equal\n   * * Default is `Geometry.smallMetricDistance`\n   */\n  tolerance?: number;\n  /**\n   * Direction for primary sort.\n   * * Default is `Vector3d.create(0.294234298, 0.72391399, 0.45234328798)`\n   * * this vector should NOT be along a principal x,y,z direction.\n   * * The internal form will be normalized.\n   */\n  primarySortDirection?: Vector3d;\n}\n/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */\nclass ChainMergeContextValidatedOptions {\n  /**\n   * Tolerance for declaring points equal.\n   */\n  public tolerance: number;\n  /** UNNORMALIZED base vector for sorting.\n   * * Actual vector hoisted into an instance is normalized.\n   */\n  private static readonly _defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);\n  /**\n   * Direction for primary sort.  This is normalized !!!\n   */\n  public primarySortDirection: Vector3d;\n  /** return a unit vector aligned with optional direction.\n   * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points\n   */\n  public static createPrimarySortVector(vector?: Vector3d): Vector3d {\n    if (vector === undefined) {\n      vector = this._defaultPrimarySortDirection.clone();\n    }\n    return vector.normalizeWithDefault(\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);\n  }\n  /**\n   * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!\n   * @param tolerance\n   * @param unitVectorForPrimarySort\n   */\n  private constructor(tolerance: number, unitVectorForPrimarySort: Vector3d) {\n    this.tolerance = tolerance;\n    this.primarySortDirection = unitVectorForPrimarySort;\n  }\n  /** return the default option set. */\n  public static createFromUnValidated(options?: ChainMergeContextOptions): ChainMergeContextValidatedOptions {\n    const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());\n    if (options !== undefined) {\n      if (options.tolerance !== undefined)\n        result.tolerance = options.tolerance;\n      if (options.primarySortDirection !== undefined)\n        result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();\n    }\n    return result;\n  }\n  /** Clone this context. */\n  public clone(): ChainMergeContextValidatedOptions {\n    return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);\n  }\n}\n/**\n * * Context for assembling line segments into chains.\n * * Use the context in phases:\n *   * Create the context:   `context = ChainMergeContext.create ()`\n *   * Add line with any combination of:\n *      * `context.addSegment(pointA, pointB)`\n *      * `context.addLineSegment3dArray (segments)`\n *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:\n *      * `context.clusterAndMergeVerticesXYZ ()`\n *   * Collect the chains:\n *      * myLinestringArray = context.collectMaximalChains();\n * * The context carries an optional plane which is used by addSegmentsOnPlane\n *\n * @internal\n */\nexport class ChainMergeContext {\n\n  private _graph: HalfEdgeGraph;\n  private _options: ChainMergeContextValidatedOptions;\n  private _plane?: PlaneAltitudeEvaluator;\n  private _convexClipper?: ConvexClipPlaneSet;\n  private constructor(options: ChainMergeContextValidatedOptions) {\n    this._graph = new HalfEdgeGraph();\n    this._options = options;\n  }\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set plane(value: PlaneAltitudeEvaluator | undefined) { this._plane = value; }\n  /** Property access for the reference plane. */\n  public get plane(): PlaneAltitudeEvaluator | undefined { return this._plane; }\n\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set convexClipper(value: ConvexClipPlaneSet | undefined) { this._convexClipper = value; }\n  /** Property access for the reference plane. */\n  public get convexClipper(): ConvexClipPlaneSet | undefined { return this._convexClipper; }\n\n  /**\n   * * Construct an empty chain merge graph.\n   * * The options parameter may contain any combination of the options values.\n   *   * tolerance = absolute tolerance for declaring points equal.\n   *     * Default is `Geometry.smallMetricDistance`\n   *   * primarySortDirection = direction for first sort.\n   *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.\n   *     * The default points into the first octant with non-obvious components.\n   */\n  public static create(options?: ChainMergeContextOptions): ChainMergeContext {\n    const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);\n    return new ChainMergeContext(validatedOptions);\n  }\n  /** Add a segment to the evolving graph. */\n  public addSegment(pointA: Point3d, pointB: Point3d) {\n    this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);\n  }\n  /** Add all segments from an array to the graph. */\n  public addLineSegment3dArray(data: LineSegment3d[]) {\n    for (const segment of data) {\n      this.addSegment(segment.point0Ref, segment.point1Ref);\n    }\n  }\n  /** Add edges for all segments that are \"on\" the plane.\n   * * No action if `this.plane` is undefined.\n   */\n  public addSegmentsOnPlane(points: GrowableXYZArray, addClosure: boolean = false) {\n    if (!this._plane)\n      return;\n    const plane = this._plane;\n    let i0 = addClosure ? points.length - 1 : 0;\n    let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);\n    let i1 = addClosure ? 0 : 1;\n    let a1;\n    for (; i1 < points.length; i0 = i1++ , a0 = a1) {\n      a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);\n      if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))\n        this._graph.createEdgeXYZXYZ(\n          points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0,\n          points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);\n    }\n  }\n  /**\n   * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.\n   * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.\n   * * Hence take dot product of x,y,z with non-trivial fraction values.\n   * @param node node with x,y,z coordinates\n   */\n  private primarySortKey(node: HalfEdge): number {\n    return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);\n  }\n  /** Return difference of sortData members as sort comparison */\n  private static nodeCompareSortData(nodeA: HalfEdge, nodeB: HalfEdge): number {\n    return nodeA.sortData! - nodeB.sortData!;\n  }\n  /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */\n  private static isIsolatedEnd(nodeA: HalfEdge): boolean {\n    return nodeA.vertexSuccessor === nodeA;\n  }\n\n  /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */\n  private static isChainInteriorVertex(nodeA: HalfEdge): boolean {\n    const nodeB = nodeA.vertexSuccessor;\n    return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;\n  }\n\n  /**\n   * * isolate all edge ends.\n   * * perform cluster analysis to determine nearly coincident points.\n   * * pinch all edges together at each vertex.\n   */\n  public clusterAndMergeVerticesXYZ() {\n    HalfEdgeGraphOps.isolateAllEdges(this._graph);\n    for (const p of this._graph.allHalfEdges) {\n      p.sortData = this.primarySortKey(p);\n    }\n    const sortArray = this._graph.allHalfEdges.slice();\n    sortArray.sort(ChainMergeContext.nodeCompareSortData);\n    const xyzTolerance = this._options.tolerance;\n    // A node is unvisited if it is its own vertex successor !!!\n    // otherwise the node has already been twisted into a base vertex.\n    const n = sortArray.length;\n    for (let i0 = 0; i0 < n; i0++) {\n      const node0 = sortArray[i0];\n      const qMin = node0.sortData!;\n      const qMax = qMin + xyzTolerance;\n      if (ChainMergeContext.isIsolatedEnd(node0)) {\n        for (let i1 = i0 + 1; i1 < n; i1++) {\n          const node1 = sortArray[i1];\n          if (ChainMergeContext.isIsolatedEnd(node1)) {\n            if (node1.sortData! > qMax)\n              break;\n            if (node0.distanceXYZ(node1) <= xyzTolerance) {\n              HalfEdge.pinch(node0, node1);\n              node1.setXYZFrom(node0);    // force true equal coordinates.\n            }\n          }\n        }\n      }\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalLineString3dFromStartNode(chains: LineString3d[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const ls = LineString3d.create();\n      ls.addPointXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        ls.addPointXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      chains.push(ls);\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalGrowableXYXArrayFromStartNode(result: GrowableXYZArray[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const points = new GrowableXYZArray();\n      points.pushXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        points.pushXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      if (points.length > 0)\n        result.push(points);\n    }\n  }\n\n  /**\n   * * find edges with start, end in same vertex loop.\n   * * pinch them away from the loop\n   * * set mask on both sides.\n   * * Return the number of excisions.\n   */\n  private exciseAndMarkSlingEdges(mask: HalfEdgeMask): number {\n    let n = 0;\n    for (const p of this._graph.allHalfEdges) {\n      if (p.distanceXYZ(p.edgeMate) < this._options.tolerance\n        && !p.isMaskSet(mask)) {\n        const q = p.edgeMate;\n        HalfEdge.pinch(p, p.vertexPredecessor);\n        HalfEdge.pinch(q, q.vertexPredecessor);\n        p.setMask(mask);\n        q.setMask(mask);\n        n++;\n      }\n    }\n    return n;\n  }\n  /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.\n   * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`\n   */\n  public collectMaximalChains(): LineString3d[] {\n    const result: LineString3d[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n  public collectMaximalGrowableXYZArrays(): GrowableXYZArray[] {\n    const result: GrowableXYZArray[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n}\n"]}