@itwin/core-geometry 3.4.0-dev.8 → 3.4.0

package/lib/cjs/polyface/PolyfaceQuery.d.ts

@@ -1,6 +1,3 @@
-/** @packageDocumentation
- * @module Polyface
- */
 import { BagOfCurves, CurveCollection } from "../curve/CurveCollection";
 import { LineSegment3d } from "../curve/LineSegment3d";
 import { LineString3d } from "../curve/LineString3d";
@@ -14,6 +11,22 @@ import { MomentData } from "../geometry4d/MomentData";
 import { IndexedEdgeMatcher } from "./IndexedEdgeMatcher";
 import { IndexedPolyface, Polyface, PolyfaceVisitor } from "./Polyface";
 import { RangeLengthData } from "./RangeLengthData";
+/**
+ * Options carrier for cloneWithHolesFilled
+ * @public
+ */
+export interface HoleFillOptions {
+    /** REJECT hole candidates if its boundary chain is longer than this limit. */
+    maxPerimeter?: number;
+    /** REJECT hole candidates if they have more than this number of edges */
+    maxEdgesAroundHole?: number;
+    /** REJECT hole candidates if their orientation is not COUNTERCLOCKWISE around this vector.
+     * * For instance, use an upward Z vector for a DTM whose facets face upward.  This suppresses incorrectly treating the outer boundary as a hole.
+     */
+    upVector?: Vector3d;
+    /** requests that all content from the original mesh be copied to the mesh with filled holes. */
+    includeOriginalMesh?: boolean;
+}
 /**
  * Structure to return multiple results from volume between facets and plane
  * @public
@@ -96,11 +109,25 @@ export declare class PolyfaceQuery {
     */
     static isPolyfaceManifold(source: Polyface, allowSimpleBoundaries?: boolean): boolean;
     /**
-    * Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume.
-    * If not, extract the boundary edges as lines.
-    * @param source
-    */
+     * construct a CurveCollection containing boundary edges.
+     *   * each edge is a LineSegment3d
+     * @param source polyface or visitor
+     * @param includeDanglers true to in include typical boundary edges with a single incident facet
+     * @param includeMismatch true to include edges with more than 2 incident facets
+     * @param includeNull true to include edges with identical start and end vertex indices.
+     * @returns
+     */
     static boundaryEdges(source: Polyface | PolyfaceVisitor | undefined, includeDanglers?: boolean, includeMismatch?: boolean, includeNull?: boolean): CurveCollection | undefined;
+    /**
+  * Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume.
+  * If not, extract the boundary edges as lines.
+  * @param source polyface or visitor
+  * @param announceEdge function to be called with each boundary edge. The announcement is start and end points, start and end indices, and facet index.
+  * @param includeDanglers true to in include typical boundary edges with a single incident facet
+  * @param includeMismatch true to include edges with more than 2 incident facets
+  * @param includeNull true to include edges with identical start and end vertex indices.
+  */
+    static announceBoundaryEdges(source: Polyface | PolyfaceVisitor | undefined, announceEdge: (pointA: Point3d, pointB: Point3d, indexA: number, indexB: number, facetIndex: number) => void, includeDanglers?: boolean, includeMismatch?: boolean, includeNull?: boolean): void;
     /** Find segments (within the linestring) which project to facets.
      * * Announce each pair of linestring segment and on-facet segment through a callback.
      * * Facets are ASSUMED to be convex and planar.
@@ -154,9 +181,40 @@ export declare class PolyfaceQuery {
      * @param sideAngleTolerance
      */
     static boundaryOfVisibleSubset(polyface: IndexedPolyface, visibilitySelect: 0 | 1 | 2, vectorToEye: Vector3d, sideAngleTolerance?: Angle): CurveCollection | undefined;
-    /** Clone the facets in each partition to a separate polyface.
-     *
+    /**
+     * Search for edges with only 1 incident facet.
+     * * chain them into loops
+     * * emit the loops to the announceLoop function
+     * @param mesh
      */
+    static announceBoundaryChainsAsLineString3d(mesh: Polyface | PolyfaceVisitor, announceLoop: (points: LineString3d) => void): void;
+    /**
+     * Return a mesh with
+     *  * clusters of adjacent, coplanar facets merged into larger facets.
+     *  * other facets included unchanged.
+     * @param mesh existing mesh
+     * @returns
+     */
+    static cloneWithMaximalPlanarFacets(mesh: IndexedPolyface): IndexedPolyface | undefined;
+    /**
+     * Return a mesh with "some" holes filled in with new facets.
+     *  * The candidates to be filled are all loops returned by boundaryChainsAsLineString3d
+     *  * unclosed chains are rejected.
+     *  * optionally also copy the original mesh, so the composite is a clone with holes filled.
+     *  * The options structure enforces restrictions on how complicated the hole filling can be:
+     *     * maxEdgesAroundHole -- holes with more edges are skipped
+     *     * maxPerimeter -- holes with larger summed edge lengths are skipped.
+     *     * upVector -- holes that do not have positive area along this view are skipped.
+     *     * includeOriginalMesh -- includes the original mesh in the output mesh.
+     * @param mesh existing mesh
+     * @param options options controlling the hole fill.
+     * @param unfilledChains optional array to receive the points around holes that were not filled.
+     * @returns
+     */
+    static fillSimpleHoles(mesh: IndexedPolyface | PolyfaceVisitor, options: HoleFillOptions, unfilledChains?: LineString3d[]): IndexedPolyface | undefined;
+    /** Clone the facets in each partition to a separate polyface.
+   *
+   */
     static clonePartitions(polyface: Polyface | PolyfaceVisitor, partitions: number[][]): Polyface[];
     /** Clone facets that pass an filter function
      */
@@ -168,7 +226,7 @@ export declare class PolyfaceQuery {
     /** Search the facets for facet subsets that are connected with at least edge contact.
      * * Return array of arrays of facet indices.
      */
-    static partitionFacetIndicesByEdgeConnectedComponent(polyface: Polyface | PolyfaceVisitor): number[][];
+    static partitionFacetIndicesByEdgeConnectedComponent(polyface: Polyface | PolyfaceVisitor, stopAtVisibleEdges?: boolean): number[][];
     /** Find segments (within the linestring) which project to facets.
      * * Assemble each segment pair as a facet in a new polyface
      * * Facets are ASSUMED to be convex and planar.
@@ -252,7 +310,7 @@ export declare class PolyfaceQuery {
     /**
     * * Find mated pairs among facet edges.
     * * Mated pairs have the same vertex indices appearing in opposite order.
-    * * Mark all non-mated pairs invisible.
+    * * Mark all non-mated pairs visible.
     * * At mated pairs
     *    * if angle across the edge is larger than `sharpEdgeAngle`, mark visible
     *    * otherwise mark invisible.

package/lib/cjs/polyface/PolyfaceQuery.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PolyfaceQuery.d.ts","sourceRoot":"","sources":["../../../src/polyface/PolyfaceQuery.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAExE,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAGrC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAItD,OAAO,EAAE,kBAAkB,EAAqC,MAAM,sBAAsB,CAAC;AAK7F,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAExE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,qDAAqD;IACrD,iCAAiC,CAAC,EAAE,UAAU,CAAC;IAC/C,qDAAqD;IACrD,iCAAiC,CAAC,EAAE,UAAU,CAAC;CAChD;AACD;;;GAGG;AACH,oBAAY,6BAA6B;IACvC,oCAAoC;IACpC,UAAU,IAAI;IACd,6CAA6C;IAC7C,SAAS,IAAI;IACb,0CAA0C;IAC1C,SAAS,IAAI;IACb,8DAA8D;IAC9D,iBAAiB,IAAI;CACtB;AACD;;GAEG;AACH,qBAAa,aAAa;IACxB,0EAA0E;WAC5D,aAAa,CAAC,OAAO,EAAE,eAAe;IAIpD,+DAA+D;WACjD,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,WAAW;IASrE;;MAEE;WACY,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS,EAAE,WAAW,CAAC,EAAE,QAAQ,GAAG,MAAM;IAsB3G;;;;;MAKE;WACY,qBAAqB,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM;IAqBjG;;;;;MAKE;WACY,8BAA8B,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,KAAK,EAAE,4BAA4B,GAAG,wBAAwB;IAgE/I,gHAAgH;WAClG,gCAAgC,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,OAAO,GAAG,QAAQ;IAU7G,6GAA6G;WAC/F,kCAAkC,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,OAAO,GAAG,QAAQ;IAW/G;;;;OAIG;WACW,2BAA2B,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAMnF;;;;;;OAMG;WACW,6BAA6B,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAOrF;;OAEG;WACW,6BAA6B,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO;IAGtE;;;;;MAKE;WACY,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,qBAAqB,GAAE,OAAe,GAAG,OAAO;IAenG;;;;MAIE;WACY,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS,EAAE,eAAe,GAAE,OAAc,EAAE,eAAe,GAAE,OAAc,EAAE,WAAW,GAAE,OAAc,GAAG,eAAe,GAAG,SAAS;IAyCvM;;;OAGG;WACW,yCAAyC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAC5G,QAAQ,EAAE,kBAAkB,GAAG,GAAG;IAUpC,yFAAyF;mBACpE,iDAAiD;IAStE,OAAO,CAAC,MAAM,CAAC,eAAe,CAAS;IACvC;;;OAGG;WACW,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACtD;;OAEG;IACH,WAAkB,cAAc,IAAI,MAAM,CAAiC;IAC3E;;OAEG;IACH,OAAc,eAAe,SAAK;IAElC;;;;;;OAMG;WACiB,8CAA8C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EACvH,QAAQ,EAAE,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC;IAkBhD;;OAEG;WACW,+CAA+C,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,MAAM,EAAE,EAAE;IA6B/G;;;;;;;OAOG;WACW,uCAAuC,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE;IA6BzJ;;;;;;;;;OASG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,GAAE,KAAmC,GAAG,eAAe,GAAG,SAAS;IAQ1M;;OAEG;WACW,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,GAAG,QAAQ,EAAE;IAuBvG;OACG;WACY,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,CAAC,OAAO,EAAE,eAAe,KAAK,OAAO,GAAG,QAAQ;IAkBzH;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IActC;;OAEG;WACW,6CAA6C,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,MAAM,EAAE,EAAE;IA8C7G;;;OAGG;WACW,0CAA0C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IAa1H;;OAEG;WACW,oCAAoC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,aAAa,EAAE;IAU3H;;OAEG;WACW,qCAAqC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,YAAY,EAAE;IAW3H;;;;;OAKG;WACiB,0CAA0C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAa/I;;;OAGG;WACW,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,eAAe;IAW3F;;OAEG;WACW,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe;IAkDxE;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAUhD;;;;OAIG;WACW,4BAA4B,CAAC,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAE,OAAe,GAAG,MAAM,EAAE,EAAE;IAS9G;;;;OAIG;WACW,6BAA6B,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC,mBAAmB,EAAE,MAAM,EAAE,KAAK,IAAI;IAyCxH;;;OAGG;WACW,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,eAAe,EAAE,6BAA6B,GAAG,QAAQ;IAwB7I;;OAEG;WACW,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IA4CtE;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;;;OAMG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO;IAQxH;;MAEE;WACY,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,kBAAkB;IAa1F;;;;;;;;MAQE;WACY,wBAAwB,CAAC,IAAI,EAAE,eAAe,EAAE,cAAc,CAAC,EAAE,KAAK;IA4BpF;;OAEG;WACW,sBAAsB,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAS3H;;;;MAIE;WAEY,qBAAqB,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,OAAO;IAKzE;;;;OAIG;WACW,uDAAuD,CAAC,IAAI,EAAE,eAAe,GAAG,OAAO;IAIrG;;;OAGG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe;IAI3D;;;;;;;;;MASE;WACY,mBAAmB,CAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,GAAE,KAAiC;CAI/G;AAED;;;;;;;;;GASG;AACH,oBAAY,kBAAkB,GAAG,CAAC,UAAU,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,EAClF,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,KAAK,GAAG,CAAC"}
+{"version":3,"file":"PolyfaceQuery.d.ts","sourceRoot":"","sources":["../../../src/polyface/PolyfaceQuery.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAGxE,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAGrC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAOtD,OAAO,EAAE,kBAAkB,EAAqC,MAAM,sBAAsB,CAAC;AAK7F,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAExE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,8EAA8E;IAC9E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,gGAAgG;IAChG,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AACD;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,qDAAqD;IACrD,iCAAiC,CAAC,EAAE,UAAU,CAAC;IAC/C,qDAAqD;IACrD,iCAAiC,CAAC,EAAE,UAAU,CAAC;CAChD;AACD;;;GAGG;AACH,oBAAY,6BAA6B;IACvC,oCAAoC;IACpC,UAAU,IAAI;IACd,6CAA6C;IAC7C,SAAS,IAAI;IACb,0CAA0C;IAC1C,SAAS,IAAI;IACb,8DAA8D;IAC9D,iBAAiB,IAAI;CACtB;AACD;;GAEG;AACH,qBAAa,aAAa;IACxB,0EAA0E;WAC5D,aAAa,CAAC,OAAO,EAAE,eAAe;IAIpD,+DAA+D;WACjD,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,WAAW;IASrE;;MAEE;WACY,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS,EAAE,WAAW,CAAC,EAAE,QAAQ,GAAG,MAAM;IAsB3G;;;;;MAKE;WACY,qBAAqB,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM;IAqBjG;;;;;MAKE;WACY,8BAA8B,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,KAAK,EAAE,4BAA4B,GAAG,wBAAwB;IAgE/I,gHAAgH;WAClG,gCAAgC,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,OAAO,GAAG,QAAQ;IAU7G,6GAA6G;WAC/F,kCAAkC,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,OAAO,GAAG,QAAQ;IAW/G;;;;OAIG;WACW,2BAA2B,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAMnF;;;;;;OAMG;WACW,6BAA6B,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAOrF;;OAEG;WACW,6BAA6B,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO;IAGtE;;;;;MAKE;WACY,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,qBAAqB,GAAE,OAAe,GAAG,OAAO;IAcrG;;;;;;;;OAQG;WACa,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS,EACxE,eAAe,GAAE,OAAc,EAAE,eAAe,GAAE,OAAc,EAAE,WAAW,GAAE,OAAc,GAAG,eAAe,GAAG,SAAS;IAU3H;;;;;;;;IAQA;WACc,qBAAqB,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,GAAG,SAAS,EAChF,YAAY,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,IAAI,EAC5G,eAAe,GAAE,OAAc,EAAE,eAAe,GAAE,OAAc,EAAE,WAAW,GAAE,OAAc,GAAG,IAAI;IAuCxG;;;OAGG;WACW,yCAAyC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAC5G,QAAQ,EAAE,kBAAkB,GAAG,GAAG;IAUpC,yFAAyF;mBACpE,iDAAiD;IAStE,OAAO,CAAC,MAAM,CAAC,eAAe,CAAS;IACvC;;;OAGG;WACW,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACtD;;OAEG;IACH,WAAkB,cAAc,IAAI,MAAM,CAAiC;IAC3E;;OAEG;IACH,OAAc,eAAe,SAAK;IAElC;;;;;;OAMG;WACiB,8CAA8C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EACvH,QAAQ,EAAE,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC;IAkBhD;;OAEG;WACW,+CAA+C,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,MAAM,EAAE,EAAE;IA6B/G;;;;;;;OAOG;WACW,uCAAuC,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE;IA6BzJ;;;;;;;;;OASG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,GAAE,KAAmC,GAAG,eAAe,GAAG,SAAS;IAO1M;;;;;OAKG;WACW,oCAAoC,CAAC,IAAI,EAAE,QAAQ,GAAG,eAAe,EACjF,YAAY,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,IAAI;IAQhD;;;;;;OAMG;WACW,4BAA4B,CAAC,IAAI,EAAE,eAAe,GAAG,eAAe,GAAG,SAAS;IAkD9F;;;;;;;;;;;;;;OAcG;WACY,eAAe,CAAC,IAAI,EAAE,eAAe,GAAG,eAAe,EAAE,OAAO,EAAE,eAAe,EAAE,cAAc,CAAC,EAAE,YAAY,EAAE,GAAG,eAAe,GAAG,SAAS;IAuC3J;;KAEC;WACW,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,GAAG,QAAQ,EAAE;IAuBvG;OACG;WACY,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,EAAE,CAAC,OAAO,EAAE,eAAe,KAAK,OAAO,GAAG,QAAQ;IAkBzH;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IActC;;OAEG;WACW,6CAA6C,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,EAAE,kBAAkB,GAAE,OAAe,GAAG,MAAM,EAAE,EAAE;IAkDlJ;;;OAGG;WACW,0CAA0C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IAa1H;;OAEG;WACW,oCAAoC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,aAAa,EAAE;IAU3H;;OAEG;WACW,qCAAqC,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,YAAY,EAAE;IAW3H;;;;;OAKG;WACiB,0CAA0C,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAa/I;;;OAGG;WACW,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,eAAe;IAW3F;;OAEG;WACW,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe;IAkDxE;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAUhD;;;;OAIG;WACW,4BAA4B,CAAC,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAE,OAAe,GAAG,MAAM,EAAE,EAAE;IAS9G;;;;OAIG;WACW,6BAA6B,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC,mBAAmB,EAAE,MAAM,EAAE,KAAK,IAAI;IAyCxH;;;OAGG;WACW,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,OAAO,EAAE,eAAe,EAAE,6BAA6B,GAAG,QAAQ;IAwB7I;;OAEG;WACW,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IA4CtE;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;;;OAMG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO;IAQxH;;MAEE;WACY,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG,kBAAkB;IAa1F;;;;;;;;MAQE;WACY,wBAAwB,CAAC,IAAI,EAAE,eAAe,EAAE,cAAc,CAAC,EAAE,KAAK;IA4BpF;;OAEG;WACW,sBAAsB,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAS3H;;;;MAIE;WAEY,qBAAqB,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,OAAO;IAKzE;;;;OAIG;WACW,uDAAuD,CAAC,IAAI,EAAE,eAAe,GAAG,OAAO;IAIrG;;;OAGG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe;IAI3D;;;;;;;;;MASE;WACY,mBAAmB,CAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,GAAE,KAAiC;CAI/G;AAED;;;;;;;;;GASG;AACH,oBAAY,kBAAkB,GAAG,CAAC,UAAU,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,EAClF,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,KAAK,GAAG,CAAC"}

package/lib/cjs/polyface/PolyfaceQuery.js

@@ -10,13 +10,16 @@ exports.PolyfaceQuery = exports.DuplicateFacetClusterSelector = void 0;
  */
 // import { Point2d } from "./Geometry2d";
 /* eslint-disable @typescript-eslint/naming-convention, no-empty */
+const PointHelpers_1 = require("../geometry3d/PointHelpers");
 const CurveCollection_1 = require("../curve/CurveCollection");
+const MultiChainCollector_1 = require("../curve/internalContexts/MultiChainCollector");
 const LineSegment3d_1 = require("../curve/LineSegment3d");
 const LineString3d_1 = require("../curve/LineString3d");
 const Loop_1 = require("../curve/Loop");
 const StrokeOptions_1 = require("../curve/StrokeOptions");
 const Geometry_1 = require("../Geometry");
 const Angle_1 = require("../geometry3d/Angle");
+const FrameBuilder_1 = require("../geometry3d/FrameBuilder");
 const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
 const PolygonOps_1 = require("../geometry3d/PolygonOps");
 const Range_1 = require("../geometry3d/Range");
@@ -24,6 +27,9 @@ const Matrix4d_1 = require("../geometry4d/Matrix4d");
 const MomentData_1 = require("../geometry4d/MomentData");
 const UnionFind_1 = require("../numerics/UnionFind");
 const ChainMerge_1 = require("../topology/ChainMerge");
+const Graph_1 = require("../topology/Graph");
+const HalfEdgeGraphSearch_1 = require("../topology/HalfEdgeGraphSearch");
+const Merging_1 = require("../topology/Merging");
 const FacetOrientation_1 = require("./FacetOrientation");
 const IndexedEdgeMatcher_1 = require("./IndexedEdgeMatcher");
 const IndexedPolyfaceVisitor_1 = require("./IndexedPolyfaceVisitor");
@@ -33,6 +39,7 @@ const XYPointBuckets_1 = require("./multiclip/XYPointBuckets");
 const Polyface_1 = require("./Polyface");
 const PolyfaceBuilder_1 = require("./PolyfaceBuilder");
 const RangeLengthData_1 = require("./RangeLengthData");
+const SpaceTriangulation_1 = require("../topology/SpaceTriangulation");
 /**
  * Enumeration of cases for retaining facets among duplicates
  * @public
@@ -259,15 +266,39 @@ class PolyfaceQuery {
         return badClusters.length === 0;
     }
     /**
-    * Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume.
-    * If not, extract the boundary edges as lines.
-    * @param source
-    */
+     * construct a CurveCollection containing boundary edges.
+     *   * each edge is a LineSegment3d
+     * @param source polyface or visitor
+     * @param includeDanglers true to in include typical boundary edges with a single incident facet
+     * @param includeMismatch true to include edges with more than 2 incident facets
+     * @param includeNull true to include edges with identical start and end vertex indices.
+     * @returns
+     */
     static boundaryEdges(source, includeDanglers = true, includeMismatch = true, includeNull = true) {
+        const result = new CurveCollection_1.BagOfCurves();
+        const announceEdge = (pointA, pointB, _indexA, _indexB, _readIndex) => {
+            result.tryAddChild(LineSegment3d_1.LineSegment3d.create(pointA, pointB));
+        };
+        PolyfaceQuery.announceBoundaryEdges(source, announceEdge, includeDanglers, includeMismatch, includeNull);
+        if (result.children.length === 0)
+            return undefined;
+        return result;
+    }
+    /**
+  * Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume.
+  * If not, extract the boundary edges as lines.
+  * @param source polyface or visitor
+  * @param announceEdge function to be called with each boundary edge. The announcement is start and end points, start and end indices, and facet index.
+  * @param includeDanglers true to in include typical boundary edges with a single incident facet
+  * @param includeMismatch true to include edges with more than 2 incident facets
+  * @param includeNull true to include edges with identical start and end vertex indices.
+  */
+    static announceBoundaryEdges(source, announceEdge, includeDanglers = true, includeMismatch = true, includeNull = true) {
         if (source === undefined)
             return undefined;
         const edges = new IndexedEdgeMatcher_1.IndexedEdgeMatcher();
         const visitor = source instanceof Polyface_1.Polyface ? source.createVisitor(1) : source;
+        visitor.setNumWrap(1);
         visitor.reset();
         while (visitor.moveToNextFacet()) {
             const numEdges = visitor.pointCount - 1;
@@ -289,7 +320,6 @@ class PolyfaceQuery {
         if (badList.length === 0)
             return undefined;
         const sourcePolyface = visitor.clientPolyface();
-        const result = new CurveCollection_1.BagOfCurves();
         for (const list of badList) {
             for (const e of list) {
                 const e1 = e instanceof IndexedEdgeMatcher_1.SortableEdge ? e : e[0];
@@ -298,10 +328,9 @@ class PolyfaceQuery {
                 const pointA = sourcePolyface.data.getPoint(indexA);
                 const pointB = sourcePolyface.data.getPoint(indexB);
                 if (pointA && pointB)
-                    result.tryAddChild(LineSegment3d_1.LineSegment3d.create(pointA, pointB));
+                    announceEdge(pointA, pointB, indexA, indexB, visitor.currentReadIndex());
             }
         }
-        return result;
     }
     /** Find segments (within the linestring) which project to facets.
      * * Announce each pair of linestring segment and on-facet segment through a callback.
@@ -444,9 +473,124 @@ class PolyfaceQuery {
         const visitor = IndexedPolyfaceVisitor_1.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(polyface, partitionedIndices[visibilitySelect], 1);
         return this.boundaryEdges(visitor, true, false, false);
     }
-    /** Clone the facets in each partition to a separate polyface.
-     *
+    /**
+     * Search for edges with only 1 incident facet.
+     * * chain them into loops
+     * * emit the loops to the announceLoop function
+     * @param mesh
+     */
+    static announceBoundaryChainsAsLineString3d(mesh, announceLoop) {
+        const collector = new MultiChainCollector_1.MultiChainCollector(Geometry_1.Geometry.smallMetricDistance, 1000);
+        PolyfaceQuery.announceBoundaryEdges(mesh, (pointA, pointB, _indexA, _indexB) => collector.captureCurve(LineSegment3d_1.LineSegment3d.create(pointA, pointB)), true, false, false);
+        collector.announceChainsAsLineString3d(announceLoop);
+    }
+    /**
+     * Return a mesh with
+     *  * clusters of adjacent, coplanar facets merged into larger facets.
+     *  * other facets included unchanged.
+     * @param mesh existing mesh
+     * @returns
+     */
+    static cloneWithMaximalPlanarFacets(mesh) {
+        PolyfaceQuery.markPairedEdgesInvisible(mesh, Angle_1.Angle.createRadians(Geometry_1.Geometry.smallAngleRadians));
+        const partitions = PolyfaceQuery.partitionFacetIndicesByEdgeConnectedComponent(mesh, true);
+        const builder = PolyfaceBuilder_1.PolyfaceBuilder.create();
+        const visitor = mesh.createVisitor(0);
+        const planarPartitions = [];
+        for (const partition of partitions) {
+            if (partition.length === 1) {
+                if (visitor.moveToReadIndex(partition[0]))
+                    builder.addFacetFromVisitor(visitor);
+            }
+            else {
+                // This is a non-trivial set of contiguous coplanar facets
+                planarPartitions.push(partition);
+            }
+        }
+        const fragmentPolyfaces = PolyfaceQuery.clonePartitions(mesh, planarPartitions);
+        const gapTolerance = 1.0e-4;
+        const planarityTolerance = 1.0e-4;
+        for (const fragment of fragmentPolyfaces) {
+            const edges = [];
+            const edgeStrings = [];
+            PolyfaceQuery.announceBoundaryEdges(fragment, (pointA, pointB, _indexA, _indexB) => {
+                edges.push(LineSegment3d_1.LineSegment3d.create(pointA, pointB));
+                edgeStrings.push([pointA.clone(), pointB.clone()]);
+            });
+            const chains = MultiChainCollector_1.OffsetHelpers.collectChains(edges, gapTolerance, planarityTolerance);
+            if (chains) {
+                const frameBuilder = new FrameBuilder_1.FrameBuilder();
+                frameBuilder.announce(chains);
+                const frame = frameBuilder.getValidatedFrame(false);
+                if (frame !== undefined) {
+                    const inverseFrame = frame.inverse();
+                    if (inverseFrame !== undefined) {
+                        inverseFrame.multiplyPoint3dArrayArrayInPlace(edgeStrings);
+                        const graph = Merging_1.HalfEdgeGraphMerge.formGraphFromChains(edgeStrings, true, Graph_1.HalfEdgeMask.BOUNDARY_EDGE);
+                        if (graph) {
+                            HalfEdgeGraphSearch_1.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, new HalfEdgeGraphSearch_1.HalfEdgeMaskTester(Graph_1.HalfEdgeMask.BOUNDARY_EDGE), Graph_1.HalfEdgeMask.EXTERIOR);
+                            // this.purgeNullFaces(HalfEdgeMask.EXTERIOR);
+                            const polyface1 = PolyfaceBuilder_1.PolyfaceBuilder.graphToPolyface(graph);
+                            builder.addIndexedPolyface(polyface1, false, frame);
+                        }
+                    }
+                }
+            }
+        }
+        return builder.claimPolyface(true);
+    }
+    /**
+     * Return a mesh with "some" holes filled in with new facets.
+     *  * The candidates to be filled are all loops returned by boundaryChainsAsLineString3d
+     *  * unclosed chains are rejected.
+     *  * optionally also copy the original mesh, so the composite is a clone with holes filled.
+     *  * The options structure enforces restrictions on how complicated the hole filling can be:
+     *     * maxEdgesAroundHole -- holes with more edges are skipped
+     *     * maxPerimeter -- holes with larger summed edge lengths are skipped.
+     *     * upVector -- holes that do not have positive area along this view are skipped.
+     *     * includeOriginalMesh -- includes the original mesh in the output mesh.
+     * @param mesh existing mesh
+     * @param options options controlling the hole fill.
+     * @param unfilledChains optional array to receive the points around holes that were not filled.
+     * @returns
      */
+    static fillSimpleHoles(mesh, options, unfilledChains) {
+        if (mesh instanceof Polyface_1.IndexedPolyface)
+            return this.fillSimpleHoles(mesh.createVisitor(0), options, unfilledChains);
+        const builder = PolyfaceBuilder_1.PolyfaceBuilder.create();
+        const chains = [];
+        PolyfaceQuery.announceBoundaryChainsAsLineString3d(mesh, (ls) => { ls.reverseInPlace(); chains.push(ls); });
+        for (const c of chains) {
+            const points = c.points;
+            let rejected = false;
+            if (!c.isPhysicallyClosed)
+                rejected = true;
+            else if (options.maxEdgesAroundHole !== undefined && points.length > options.maxEdgesAroundHole)
+                rejected = true;
+            else if (options.maxPerimeter !== undefined && PointHelpers_1.Point3dArray.sumEdgeLengths(points, false) > options.maxPerimeter)
+                rejected = true;
+            else if (options.upVector !== undefined && PolygonOps_1.PolygonOps.sumTriangleAreasPerpendicularToUpVector(points, options.upVector) <= 0.0)
+                rejected = true;
+            if (!rejected && SpaceTriangulation_1.SpacePolygonTriangulation.triangulateSimplestSpaceLoop(points, (_loop, triangles) => {
+                for (const t of triangles)
+                    builder.addPolygon(t);
+            })) {
+            }
+            else {
+                rejected = true;
+            }
+            if (rejected && unfilledChains !== undefined)
+                unfilledChains.push(c); // yes, capture it -- this scope owns the chains and has no further use for it.
+        }
+        if (options.includeOriginalMesh !== undefined && options.includeOriginalMesh) {
+            for (mesh.reset(); mesh.moveToNextFacet();)
+                builder.addFacetFromVisitor(mesh);
+        }
+        return builder.claimPolyface(true);
+    }
+    /** Clone the facets in each partition to a separate polyface.
+   *
+   */
     static clonePartitions(polyface, partitions) {
         if (polyface instanceof Polyface_1.Polyface) {
             return this.clonePartitions(polyface.createVisitor(0), partitions);
@@ -508,9 +652,9 @@ class PolyfaceQuery {
     /** Search the facets for facet subsets that are connected with at least edge contact.
      * * Return array of arrays of facet indices.
      */
-    static partitionFacetIndicesByEdgeConnectedComponent(polyface) {
+    static partitionFacetIndicesByEdgeConnectedComponent(polyface, stopAtVisibleEdges = false) {
         if (polyface instanceof Polyface_1.Polyface) {
-            return this.partitionFacetIndicesByEdgeConnectedComponent(polyface.createVisitor(0));
+            return this.partitionFacetIndicesByEdgeConnectedComponent(polyface.createVisitor(0), stopAtVisibleEdges);
         }
         polyface.setNumWrap(1);
         const matcher = new IndexedEdgeMatcher_1.IndexedEdgeMatcher();
@@ -520,7 +664,11 @@ class PolyfaceQuery {
             const numEdges = polyface.pointCount - 1;
             numFacets++;
             for (let i = 0; i < numEdges; i++) {
-                matcher.addEdge(polyface.clientPointIndex(i), polyface.clientPointIndex(i + 1), polyface.currentReadIndex());
+                if (stopAtVisibleEdges && polyface.edgeVisible[i]) {
+                }
+                else {
+                    matcher.addEdge(polyface.clientPointIndex(i), polyface.clientPointIndex(i + 1), polyface.currentReadIndex());
+                }
             }
         }
         const allEdges = [];
@@ -664,7 +812,7 @@ class PolyfaceQuery {
                     }
                 }
             }
-            builder.addFacetFromGrowableArrays(newFacetVisitor.point, newFacetVisitor.normal, newFacetVisitor.param, newFacetVisitor.color);
+            builder.addFacetFromGrowableArrays(newFacetVisitor.point, newFacetVisitor.normal, newFacetVisitor.param, newFacetVisitor.color, newFacetVisitor.edgeVisible);
         }
         return builder.claimPolyface();
     }
@@ -819,7 +967,7 @@ class PolyfaceQuery {
                 }
             }
             if (newFacetVisitor.point.length > 2)
-                builder.addFacetFromGrowableArrays(newFacetVisitor.point, newFacetVisitor.normal, newFacetVisitor.param, newFacetVisitor.color);
+                builder.addFacetFromGrowableArrays(newFacetVisitor.point, newFacetVisitor.normal, newFacetVisitor.param, newFacetVisitor.color, newFacetVisitor.edgeVisible);
         }
         return builder.claimPolyface();
     }
@@ -874,7 +1022,7 @@ class PolyfaceQuery {
     /**
     * * Find mated pairs among facet edges.
     * * Mated pairs have the same vertex indices appearing in opposite order.
-    * * Mark all non-mated pairs invisible.
+    * * Mark all non-mated pairs visible.
     * * At mated pairs
     *    * if angle across the edge is larger than `sharpEdgeAngle`, mark visible
     *    * otherwise mark invisible.