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

package/lib/esm/clipping/AlternatingConvexClipTree.d.ts

@@ -0,0 +1,165 @@
+import { CurveCollection } from "../curve/CurveCollection";
+import { CurveLocationDetailPair } from "../curve/CurveLocationDetail";
+import { CurvePrimitive } from "../curve/CurvePrimitive";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { ClipPlane } from "./ClipPlane";
+import { PolygonClipper } from "./ClipUtils";
+import { ConvexClipPlaneSet } from "./ConvexClipPlaneSet";
+import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
+import { GrowableXYZArrayCache } from "../geometry3d/ReusableObjectCache";
+/**
+ * An AlternatingConvexClipTreeNode is a node in a tree structure in which
+ *   <ul>
+ *   <li>Each node contains a ConvexClipPlaneSet
+ *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.
+ *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if
+ *   <ul>
+ *   <li>It is IN the node's ConvexClipPlaneSet.
+ *   <li>It is NOT IN any of the children.
+ *   </ul>
+ *   <li>Applying "NOT IN any of the children" locally to children at each level means that the ConvexClipPlaneSet
+ *       at adjacent levels flip between being positive areas and holes.
+ *   <li>Use an AlternatingConvexClipTreeNodeBuilder to construct the tree from a polygon.
+ *   <li>It is possible for the root clip plane set to be empty.  An empty clip plane set returns "true"
+ *         for all point tests, so the meaning is just that holes are to be subtracted from the rest
+ *         of space.
+ *   <li>Although the interpretation of in/out alternates with tree levels, the ConvexClipPlaneSets
+ *         at each level are all "enclosing" planes in the usual way.
+ *   </ul>
+ */
+export declare class AlternatingCCTreeNode implements PolygonClipper {
+    points: Point3d[];
+    planes: ConvexClipPlaneSet;
+    children: AlternatingCCTreeNode[];
+    startIdx: number;
+    numPoints: number;
+    private constructor();
+    /** Initialize this node with index data referencing the parent polygon. */
+    static createWithIndices(index0: number, numPoints: number, result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
+    /**
+     * <ul>
+     * <li>Build the tree for a polygon.
+     * <li>Caller creates the root node with empty constructor AlternatingConvexClipTreeNode.
+     * </ul>
+     */
+    static createTreeForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
+    /**
+     * Build the outer convex hull will inlets as first level children
+     */
+    static createHullAndInletsForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
+    private extractLoopsGo;
+    /**
+     * Return an array with all the loops in the tree.
+     * This looses the alternating structure of the tree, but the collection still matches well-formed polygons by parity rules.
+     */
+    extractLoops(): Point3d[][];
+    /** Resets this AlternatingConvexClipTreeNode to a newly-created state */
+    empty(): void;
+    /** Creates a deep copy of this node (expensive - copies Geometry, and is recursive for children array). */
+    clone(result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
+    /** Add a new child that has an empty plane set and given indices. */
+    addEmptyChild(index0: number, numPoints: number): void;
+    /** Add a plane to the ConvexClipPlaneSet */
+    addPlane(plane: ClipPlane): void;
+    /** Search with alternating in and out semantics. */
+    isPointOnOrInside(point: Point3d): boolean;
+    /** Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
+     * * The child pointer is pushed directly to the tree -- not cloned.
+     */
+    captureConvexClipPlaneSetAsVoid(child: AlternatingCCTreeNode): void;
+    /** Append start-end positions for curve intervals classified as inside or outside. */
+    appendCurvePrimitiveClipIntervals(curve: CurvePrimitive, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]): void;
+    /** Append start-end positions for curve intervals classified as inside or outside. */
+    appendCurveCollectionClipIntervals(curves: CurveCollection, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]): void;
+    /**
+     *
+     * @param xyz input polygon.  This is not changed.
+     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param arrayCache cache for reusable GrowableXYZArray.
+     */
+    appendPolygonClip(xyz: GrowableXYZArray, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
+    /**
+     *
+     */
+    depth(): number;
+}
+/**
+ *  Context structure for building an AlternatingConvexClipTreeNode from a polygon.
+ *  <ul>
+ *  <li> The polygon is copied to the local m_points structure.
+ *  <li> During construction, m_stack contains indices of a sequence of points with uniform concavity.
+ *  </ul>
+ */
+export declare class AlternatingCCTreeBuilder {
+    private _points;
+    private _stack;
+    private constructor();
+    static createPointsRef(points: Point3d[], result?: AlternatingCCTreeBuilder): AlternatingCCTreeBuilder;
+    get period(): number;
+    indexAfter(i: number): number;
+    indexBefore(i: number): number;
+    pushIndex(primaryPointIndex: number): void;
+    private static cross;
+    cyclicStackPoint(cyclicIndex: number): Point3d;
+    signFromStackTip(pointIndex: number, sign: number): 1 | -1;
+    get indexOfMaxX(): number;
+    /** Pop from the stack until the sign condition is satisfied */
+    extendHullChain(k: number, sign: number, pushAfterPops: boolean): void;
+    collectHullChain(kStart: number, numK: number, sign: number): void;
+    collectHullPointsInArray(points: Point3d[], kStart: number, numK: number, _sign: number): void;
+    private buildHullTreeGo;
+    /**
+     * <ul>
+     * <li> Input a ClipTreeRoot that has start and count data
+     * <li> Build the hull for that data range
+     * <li> Store the hull points in the root
+     * <li> Add children with start and count data
+     * <li> Recursively move to children
+     * </ul>
+     */
+    buildHullAndInletsForPolygon(root: AlternatingCCTreeNode): boolean;
+    /**
+     * <ul>
+     * <li> Input a ClipTreeRoot that has start and count data
+     * <li> Build the hull for that data range
+     * <li> Store the hull points in the root
+     * <li> Add children with start and count data
+     * <li> Recursively move to children
+     * </ul>
+     */
+    buildHullTree(root: AlternatingCCTreeNode): boolean;
+}
+export declare class AlternatingCCTreeNodeCurveClipper {
+    private _curve;
+    private _intervalStack;
+    private _stackDepth;
+    constructor();
+    private setCurveRef;
+    private popSegmentFrame;
+    private clearSegmentStack;
+    private pushEmptySegmentFrame;
+    private get _topOfStack();
+    private set _topOfStack(value);
+    /** Access entry [topOfStack() - numSkip] */
+    private stackEntry;
+    private isTopOfStackEmpty;
+    private static _fractionIntervals;
+    private appendSingleClipToStack;
+    /**
+     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack has clip for this node
+     * (expensive -- must clone items of arrays during "swaps")
+     */
+    private recurse;
+    /**
+     * Modifies the insideIntervals array given in place.
+     * Note: curve given is passed by reference and stored.
+     */
+    appendSingleClipPrimitive(root: AlternatingCCTreeNode, curve: CurvePrimitive, insideIntervals: CurveLocationDetailPair[], _outsideIntervals: CurveLocationDetailPair[]): void;
+    /**
+     * Modifies the insideIntervals array given in place.
+     * Note: curve given is passed by reference and stored.
+     */
+    appendCurveCollectionClip(root: AlternatingCCTreeNode, curve: CurveCollection, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]): void;
+}
+//# sourceMappingURL=AlternatingConvexClipTree.d.ts.map

package/lib/esm/clipping/AlternatingConvexClipTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AlternatingConvexClipTree.d.ts","sourceRoot":"","sources":["../../../src/clipping/AlternatingConvexClipTree.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAuB,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAIzD,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAIlE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAG1E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,qBAAsB,YAAW,cAAc;IACnD,MAAM,EAAE,OAAO,EAAE,CAAM;IACvB,MAAM,EAAE,kBAAkB,CAAoC;IAC9D,QAAQ,EAAE,qBAAqB,EAAE,CAAM;IACvC,QAAQ,EAAE,MAAM,CAAM;IACtB,SAAS,EAAE,MAAM,CAAM;IAE9B,OAAO;IAEP,2EAA2E;WAC7D,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAQzH;;;;;OAKG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAQ5G;;OAEG;WACY,6BAA6B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAOtH,OAAO,CAAC,cAAc;IAKxB;;;OAGG;IACM,YAAY,IAAI,OAAO,EAAE,EAAE;IAKlC,yEAAyE;IAClE,KAAK;IAQZ,2GAA2G;IACpG,KAAK,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAcnE,qEAAqE;IAC9D,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAKtD,4CAA4C;IACrC,QAAQ,CAAC,KAAK,EAAE,SAAS;IAIhC,oDAAoD;IAC7C,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAYjD;;OAEG;IACI,+BAA+B,CAAC,KAAK,EAAE,qBAAqB;IAInE,sFAAsF;IAC/E,iCAAiC,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;IAKvJ,sFAAsF;IAC/E,kCAAkC,CAAC,MAAM,EAAE,eAAe,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;IAI1J;;;;;;OAMG;IACI,iBAAiB,CACtB,GAAG,EAAE,gBAAgB,EACrB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAAG,IAAI;IA6B1C;;OAEG;IACI,KAAK,IAAI,MAAM;CAQvB;AACD;;;;;;GAMG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,MAAM,CAAgB;IAE9B,OAAO;WAEO,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,wBAAwB,GAAG,wBAAwB;IAU7G,IAAW,MAAM,IAAI,MAAM,CAAgC;IAEpD,UAAU,CAAC,CAAC,EAAE,MAAM;IACpB,WAAW,CAAC,CAAC,EAAE,MAAM;IAErB,SAAS,CAAC,iBAAiB,EAAE,MAAM;IAI1C,OAAO,CAAC,MAAM,CAAC,KAAK;IAQb,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAW9C,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAwBxD,IAAW,WAAW,WASrB;IAED,+DAA+D;IACxD,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO;IAO/D,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAW3D,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAW9F,OAAO,CAAC,eAAe;IAuCvB;;;;;;;;OAQG;IACI,4BAA4B,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;IAIzE;;;;;;;;OAQG;IACK,aAAa,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;CAK5D;AAED,qBAAa,iCAAiC;IAC5C,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,cAAc,CAAc;IACpC,OAAO,CAAC,WAAW,CAAS;;IAO5B,OAAO,CAAC,WAAW;IAEnB,OAAO,CAAC,eAAe;IAOvB,OAAO,CAAC,iBAAiB;IAKzB,OAAO,CAAC,qBAAqB;IAO7B,OAAO,KAAK,WAAW,GAAmE;IAE1F,OAAO,KAAK,WAAW,QAItB;IAED,4CAA4C;IAC5C,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,iBAAiB;IAKzB,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAAgB;IAEjD,OAAO,CAAC,uBAAuB;IAkD/B;;;OAGG;IACH,OAAO,CAAC,OAAO;IAqBf;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,cAAc,EACjF,eAAe,EAAE,uBAAuB,EAAE,EAAE,iBAAiB,EAAE,uBAAuB,EAAE;IAqB1F;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,eAAe,EAClF,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;CAQ1F"}