@itwin/core-geometry 4.1.0-dev.8 → 4.1.0-dev.81

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

@@ -26,22 +26,26 @@ export type ConvexClipPlaneSetProps = ClipPlaneProps[];
 export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
     /** Value acting as "at infinity" for coordinates along a ray. */
     static readonly hugeVal = 1e+37;
+    /** Planes that define the convex set. */
     private _planes;
     private constructor();
-    /** Return an array containing all the planes of the convex set.
+    /**
+     * Return an array containing all the planes of the convex set.
      * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
      */
     toJSON(): ConvexClipPlaneSetProps;
-    /** Extract clip planes from a json array `[  clipPlane, clipPlane ]`.
+    /**
+     * Extract clip planes from a json array `[ clipPlane, clipPlane ]`.
      * * Non-clipPlane members are ignored.
      */
     static fromJSON(json: ConvexClipPlaneSetProps | undefined, result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
     /**
-     * Return true if all members are almostEqual to corresponding members of other.  This includes identical order in array.
+     * Return true if all members are almostEqual to corresponding members of other. This includes identical order in array.
      * @param other clip plane to compare
      */
     isAlmostEqual(other: ConvexClipPlaneSet): boolean;
-    /** create from an array of planes.
+    /**
+     * Create ConvexClipPlaneSet from an array of planes.
      * * Each plane reference in the `planes` array is taken into the result.
      * * The input array itself is NOT taken into the result.
      */
@@ -57,20 +61,23 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param highZ true to clip at the high z plane
      */
     static createRange3dPlanes(range: Range3d, lowX?: boolean, highX?: boolean, lowY?: boolean, highY?: boolean, lowZ?: boolean, highZ?: boolean): ConvexClipPlaneSet;
-    /** create an empty `ConvexClipPlaneSet` */
+    /** Create an empty `ConvexClipPlaneSet` */
     static createEmpty(result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
-    /** negate all planes of the set. */
+    /** Negate all planes of the set. */
     negateAllPlanes(): void;
-    /** Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
+    /**
+     * Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
      * * Note that there is no test for the usual ordering `x0 <= x1` or `y0 <= y1`.
-     *    * if the usual ordering is violated, the convex set is an empty set.
+     * * if the usual ordering is violated, the convex set is an empty set.
      */
     static createXYBox(x0: number, y0: number, x1: number, y1: number, result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
-    /** Create a convex set containing a half space for each edge between points of a polyline.
+    /**
+     * Create a convex set containing a half space for each edge between points of a polyline.
      * * Caller is responsible for assuring the polyline is convex.
-     * @param points array of points.  Only xy parts are considered.
-     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the succeeding segment.   If this array is not provided, both are false.
-     * @param leftIsInside if true, the interior is "to the left" of the segments.  If false, interior is "to the right"
+     * @param points array of points. Only xy parts are considered.
+     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the
+     * succeeding segment. If this array is not provided, both are false.
+     * @param leftIsInside if true, the interior is "to the left" of the segments. If false, interior is "to the right".
      */
     static createXYPolyLine(points: Point3d[], interior: boolean[] | undefined, leftIsInside: boolean, result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
     /**
@@ -79,7 +86,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      */
     static createXYPolyLineInsideLeft(points: Point3d[], result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
     /**
-     * (re)set a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
+     * Set (or reset) a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
      * * The planeOfPolygon is (re)initialized with the normal from 3 points, but not otherwise referenced.
      * * The ConvexClipPlaneSet is filled with outward normals of the facet edges as viewed to xy plane.
      * @param points
@@ -94,7 +101,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * Test if there is any intersection with a ray defined by origin and direction.
      * * Optionally record the range (null or otherwise) in caller-allocated result.
      * * If the ray is unbounded inside the clip, result can contain positive or negative
-     * "Geometry.largeCoordinateResult" values
+     *  "Geometry.largeCoordinateResult" values.
      * * If no result is provide, there are no object allocations.
      * @param result optional Range1d to receive parameters along the ray.
      */
@@ -104,7 +111,8 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
      * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect
+     * on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
      * @param matrix matrix to apply
@@ -120,13 +128,15 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param radius radius of sphere.
      */
     isSphereInside(centerPoint: Point3d, radius: number): boolean;
-    /** Find the parts of the line segment  (if any) that is within the convex clip volume.
-     * * The input fractional interval from fraction0 to fraction1 (increasing!!) is the active part to consider.
-     * * To clip to the usual bounded line segment, starts with fractions (0,1).
+    /**
+     * Find the parts of the line segment (if any) that is within the convex clip volume.
+     * * The line segment is defined by `pointA` and `pointB`.
+     * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.
+     * * To clip to the usual bounded line segment, start with fractions (0,1).
      * If the clip volume is unbounded, the line interval may also be unbounded.
-     * * An unbounded line portion will have fraction coordinates positive or negative Number.MAX_VALUE.
-     * @param fraction0 fraction that is the initial lower fraction of the active interval. (e.g. 0.0 for bounded segment)
-     * @param fraction1 fraction that is the initial upper fraction of the active interval.  (e.g. 1.0 for bounded segment)
+     * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.
+     * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).
+     * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -134,11 +144,13 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      */
     announceClippedSegmentIntervals(f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber): boolean;
     private static _clipArcFractionArray;
-    /** Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
+    /**
+     * Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
      * * `announce(fraction, fraction, curve)`
      */
     announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;
-    /** Find the parts of the (unbounded) line segment  (if any) that is within the convex clip volume.
+    /**
+     * Find the parts of the (unbounded) line segment (if any) that is within the convex clip volume.
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -156,27 +168,30 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param tolerance tolerance for "on plane" decision.
      */
     clipConvexPolygonInPlace(xyz: GrowableXYZArray, work: GrowableXYZArray, tolerance?: number): void;
-    /** Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
+    /**
+     * Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
      * @param xyz input polygon.
      * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
      * @param arrayCache cache for work arrays.
      * @return the surviving inside part (if any)
      */
     clipInsidePushOutside(xyz: GrowableXYZArray, outsideFragments: GrowableXYZArray[] | undefined, arrayCache: GrowableXYZArrayCache): GrowableXYZArray | undefined;
-    /** Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
+    /**
+     * Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
      * * This has a peculiar expected use case as a very fast pre-filter for more precise clipping.
      * * The expected point set is for a polygon.
      * * Hence any clipping will eventually have to consider the lines between the points.
      * * This method looks for the special case of a single clip plane that has all the points outside.
      * * In this case the whole polygon must be outside.
      * * Note that this does not detect a polygon that is outside but "crosses a corner" -- it is mixed with respect to
-     *     multiple planes.
+     * multiple planes.
      */
     classifyPointContainment(points: Point3d[], onIsOutside: boolean): ClipPlaneContainment;
     /**
      * * Create a convex clip set for a polygon swept with possible tilt angle.
      * * planes are constructed by ClipPlane.createEdgeAndUpVector, using successive points from the array.
-     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in reverse order.
+     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in
+     * reverse order.
      * * If first and last points do not match, points are used in order given
      * @param points polygon points. (Closure point optional)
      * @param upVector primary sweep direction, as applied by ClipPlane.createEdgeAndUpVector
@@ -189,7 +204,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      */
     addPlaneToConvexSet(plane: ClipPlane | Plane3dByOriginAndUnitNormal | undefined): void;
     /**
-     * test many points.  Distribute them to arrays depending on in/out result.
+     * Test many points. Distribute them to arrays depending on in/out result.
      * @param points points to test
      * @param inOrOn points that are in or on the set
      * @param out points that are out.
@@ -198,8 +213,10 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
     /**
      * Clip a polygon to the planes of the clip plane set.
      * * For a convex input polygon, the output is another convex polygon.
-     * * For a non-convex input, the output may have double-back edges along plane intersections.  This is still a valid clip in a parity sense.
-     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain the polygon
+     * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
+     * valid clip in a parity sense.
+     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
+     * the polygon.
      * @param input input polygon, usually convex.
      * @param output output polygon
      * @param work work array.
@@ -220,13 +237,16 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * * optionally throw out points that are not in the set.
      * * optionally push the points in the caller-supplied point array.
      * * optionally extend a caller supplied range.
-     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the range is the range of the convex set.
-     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the range is not a representative of the "range of all points in the set" .
+     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the
+     * range is the range of the convex set.
+     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the
+     * range is not a representative of the "range of all points in the set".
      * @param transform (optional) transform to apply to the points.
      * @param points (optional) array to which computed points are to be added.
      * @param range (optional) range to be extended by the computed points
      * @param transform (optional) transform to apply to the accepted points.
-     * @param testContainment if true, test each point to see if it is within the convex set.  (Send false if confident that the convex set is rectilinear set such as a slab.  Send true if chiseled corners are possible)
+     * @param testContainment if true, test each point to see if it is within the convex set. (send false if confident
+     * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).
      * @returns number of points.
      */
     computePlanePlanePlaneIntersections(points: Point3d[] | undefined, rangeToExtend: Range3d | undefined, transform?: Transform, testContainment?: boolean): number;
@@ -242,15 +262,18 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param zHigh high z value.  The plane clips out points with z above this.
      */
     addZClipPlanes(invisible: boolean, zLow?: number, zHigh?: number): void;
-    /** Implement appendPolygonClip, as defined in interface PolygonClipper.  /**
-     *
+    /**
+     * Implement appendPolygonClip, as defined in interface PolygonClipper.
      * @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 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;
-    /** Create a convex clip set from a convex mesh.
+    /**
+     * Create a convex clip set from a convex mesh.
      * * Create a plane for each facet.
      * * Assemble the planes as a single clip plane set.
      * * If the facets are closed by edge pairing, use the sign of the computed volume to point the plane normals inward.

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

@@ -1 +1 @@
-{"version":3,"file":"ConvexClipPlaneSet.d.ts","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,oBAAoB,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAE3F;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,cAAc,EAAE,CAAC;AAEvD;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,OAAO,EAAE,cAAc;IAChE,iEAAiE;IACjE,gBAAuB,OAAO,SAAQ;IACtC,OAAO,CAAC,OAAO,CAAc;IAI7B,OAAO;IAIP;;OAEG;IACI,MAAM,IAAI,uBAAuB;IAQxC;;OAEG;WACW,QAAQ,CAAC,IAAI,EAAE,uBAAuB,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAclH;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO;IAQxD;;;OAGG;WACW,YAAY,CAAC,MAAM,EAAE,CAAC,SAAS,GAAG,4BAA4B,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAajI;;;;;;;;;OASG;WACW,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAC9C,IAAI,GAAE,OAAc,EAAE,KAAK,GAAE,OAAc,EAC3C,IAAI,GAAE,OAAc,EAAE,KAAK,GAAE,OAAc,EAC3C,IAAI,GAAE,OAAc,EAAE,KAAK,GAAE,OAAc,GAAG,kBAAkB;IAoBlE,2CAA2C;WAC7B,WAAW,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO1E,oCAAoC;IAC7B,eAAe,IAAI,IAAI;IAI9B;;;OAGG;WACW,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAY1H;;;;;OAKG;WACW,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAwB1J;;;OAGG;WACW,0BAA0B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAgB5G;;;;;;OAMG;WACW,oBAAoB,CAAC,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB;IAuBnH,gCAAgC;IACzB,KAAK,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO7D,yDAAyD;IACzD,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IAED;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAmCtH;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAY7G,4EAA4E;IACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAQ7C,gFAAgF;IACzE,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAQnG;;;;OAIG;IACI,cAAc,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAUpE;;;;;;;;;;;OAWG;IACI,+BAA+B,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GAAG,OAAO;IAoC1I,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;OAEG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAStG;;;;;OAKG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GAAG,OAAO;IAGvG,qCAAqC;IAC9B,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAM5C;;;;;;;OAOG;IACI,wBAAwB,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,SAAS,GAAE,MAAqC;IAO/H;;;;;OAKG;IACI,qBAAqB,CAAC,GAAG,EAAE,gBAAgB,EAChD,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAChD,UAAU,EAAE,qBAAqB,GAAG,gBAAgB,GAAG,SAAS;IAqClE;;;;;;;;OAQG;IACI,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,oBAAoB;IAqB9F;;;;;;;;OAQG;WACW,mBAAmB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,GAAG,kBAAkB,GAAG,SAAS;IA4B3H;;;OAGG;IACI,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,4BAA4B,GAAG,SAAS;IAMtF;;;;;OAKG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;IAWhF;;;;;;;;;OASG;IACI,WAAW,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,EAAE,SAAS;IAcjI;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IA0ClG;;;;;;;;;;;;;OAaG;IACI,mCAAmC,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,aAAa,EAAE,OAAO,GAAG,SAAS,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,eAAe,GAAE,OAAc,GAAG,MAAM;IA8B7K;;;OAGG;IACI,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC;;;;;OAKG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAMvE;;;;;;OAMG;IACI,iBAAiB,CACtB,GAAG,EAAE,gBAAgB,EACrB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAAG,IAAI;IAK1C;;;;;;;;;MASE;WACY,oBAAoB,CAAC,UAAU,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG;QAAE,OAAO,EAAE,kBAAkB,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;CAsCzJ"}
+{"version":3,"file":"ConvexClipPlaneSet.d.ts","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,oBAAoB,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAE3F;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,cAAc,EAAE,CAAC;AAEvD;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,OAAO,EAAE,cAAc;IAChE,iEAAiE;IACjE,gBAAuB,OAAO,SAAQ;IACtC,yCAAyC;IACzC,OAAO,CAAC,OAAO,CAAc;IAI7B,OAAO;IAIP;;;OAGG;IACI,MAAM,IAAI,uBAAuB;IAMxC;;;OAGG;WACW,QAAQ,CAAC,IAAI,EAAE,uBAAuB,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAYlH;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO;IAQxD;;;;OAIG;WACW,YAAY,CACxB,MAAM,EAAE,CAAC,SAAS,GAAG,4BAA4B,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAChF,kBAAkB;IAYrB;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,KAAK,EAAE,OAAO,EACd,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,GACpB,kBAAkB;IAoBrB,2CAA2C;WAC7B,WAAW,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO1E,oCAAoC;IAC7B,eAAe,IAAI,IAAI;IAI9B;;;;OAIG;WACW,WAAW,CACvB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAC1E,kBAAkB;IAYrB;;;;;;;OAOG;WACW,gBAAgB,CAC5B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,kBAAkB,GACrG,kBAAkB;IAsBrB;;;OAGG;WACW,0BAA0B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAgB5G;;;;;;OAMG;WACW,oBAAoB,CAAC,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB;IAsBnH,gCAAgC;IACzB,KAAK,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO7D,yDAAyD;IACzD,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IACD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAmCtH;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAY7G,4EAA4E;IACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAS7C,gFAAgF;IACzE,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAQnG;;;;OAIG;IACI,cAAc,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IASpE;;;;;;;;;;;;;OAaG;IACI,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO;IAmCV,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAStG;;;;;;OAMG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GAAG,OAAO;IAGvG,qCAAqC;IAC9B,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAK5C;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,SAAS,GAAE,MAAqC,GAC9F,IAAI;IAOP;;;;;;OAMG;IACI,qBAAqB,CAC1B,GAAG,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,qBAAqB,GACzG,gBAAgB,GAAG,SAAS;IAuC/B;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,oBAAoB;IAkB9F;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,GACvD,kBAAkB,GAAG,SAAS;IA4BjC;;;OAGG;IACI,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,4BAA4B,GAAG,SAAS;IAMtF;;;;;OAKG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;IAWhF;;;;;;;;;;;OAWG;IACI,WAAW,CAChB,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,EAAE,SAAS,GAC7G,IAAI;IAcP;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAyClG;;;;;;;;;;;;;;;;OAgBG;IACI,mCAAmC,CACxC,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAC7B,aAAa,EAAE,OAAO,GAAG,SAAS,EAClC,SAAS,CAAC,EAAE,SAAS,EACrB,eAAe,GAAE,OAAc,GAC9B,MAAM;IA6BT;;;OAGG;IACI,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC;;;;;OAKG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAMvE;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAG,EAAE,gBAAgB,EACrB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAKP;;;;;;;;;;MAUE;WACY,oBAAoB,CAChC,UAAU,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAClE;QAAE,OAAO,EAAE,kBAAkB,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;CAsCnD"}

package/lib/esm/clipping/ConvexClipPlaneSet.js

@@ -26,7 +26,8 @@ class ConvexClipPlaneSet {
         // this._parity = 1;
         this._planes = planes ? planes : [];
     }
-    /** Return an array containing all the planes of the convex set.
+    /**
+     * Return an array containing all the planes of the convex set.
      * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
      */
     toJSON() {
@@ -35,7 +36,8 @@ class ConvexClipPlaneSet {
             val.push(plane.toJSON());
         return val;
     }
-    /** Extract clip planes from a json array `[  clipPlane, clipPlane ]`.
+    /**
+     * Extract clip planes from a json array `[ clipPlane, clipPlane ]`.
      * * Non-clipPlane members are ignored.
      */
     static fromJSON(json, result) {
@@ -51,7 +53,7 @@ class ConvexClipPlaneSet {
         return result;
     }
     /**
-     * Return true if all members are almostEqual to corresponding members of other.  This includes identical order in array.
+     * Return true if all members are almostEqual to corresponding members of other. This includes identical order in array.
      * @param other clip plane to compare
      */
     isAlmostEqual(other) {
@@ -62,7 +64,8 @@ class ConvexClipPlaneSet {
                 return false;
         return true;
     }
-    /** create from an array of planes.
+    /**
+     * Create ConvexClipPlaneSet from an array of planes.
      * * Each plane reference in the `planes` array is taken into the result.
      * * The input array itself is NOT taken into the result.
      */
@@ -105,7 +108,7 @@ class ConvexClipPlaneSet {
             result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 0, -1, 0, 0, range.high.z));
         return result;
     }
-    /** create an empty `ConvexClipPlaneSet` */
+    /** Create an empty `ConvexClipPlaneSet` */
     static createEmpty(result) {
         if (result) {
             result._planes.length = 0;
@@ -113,14 +116,15 @@ class ConvexClipPlaneSet {
         }
         return new ConvexClipPlaneSet();
     }
-    /** negate all planes of the set. */
+    /** Negate all planes of the set. */
     negateAllPlanes() {
         for (const plane of this._planes)
             plane.negateInPlace();
     }
-    /** Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
+    /**
+     * Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
      * * Note that there is no test for the usual ordering `x0 <= x1` or `y0 <= y1`.
-     *    * if the usual ordering is violated, the convex set is an empty set.
+     * * if the usual ordering is violated, the convex set is an empty set.
      */
     static createXYBox(x0, y0, x1, y1, result) {
         result = result ? result : new ConvexClipPlaneSet();
@@ -134,11 +138,13 @@ class ConvexClipPlaneSet {
         }
         return result;
     }
-    /** Create a convex set containing a half space for each edge between points of a polyline.
+    /**
+     * Create a convex set containing a half space for each edge between points of a polyline.
      * * Caller is responsible for assuring the polyline is convex.
-     * @param points array of points.  Only xy parts are considered.
-     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the succeeding segment.   If this array is not provided, both are false.
-     * @param leftIsInside if true, the interior is "to the left" of the segments.  If false, interior is "to the right"
+     * @param points array of points. Only xy parts are considered.
+     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the
+     * succeeding segment. If this array is not provided, both are false.
+     * @param leftIsInside if true, the interior is "to the left" of the segments. If false, interior is "to the right".
      */
     static createXYPolyLine(points, interior, leftIsInside, result) {
         result = result ? result : new ConvexClipPlaneSet();
@@ -182,7 +188,7 @@ class ConvexClipPlaneSet {
         return result;
     }
     /**
-     * (re)set a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
+     * Set (or reset) a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
      * * The planeOfPolygon is (re)initialized with the normal from 3 points, but not otherwise referenced.
      * * The ConvexClipPlaneSet is filled with outward normals of the facet edges as viewed to xy plane.
      * @param points
@@ -226,7 +232,7 @@ class ConvexClipPlaneSet {
      * Test if there is any intersection with a ray defined by origin and direction.
      * * Optionally record the range (null or otherwise) in caller-allocated result.
      * * If the ray is unbounded inside the clip, result can contain positive or negative
-     * "Geometry.largeCoordinateResult" values
+     *  "Geometry.largeCoordinateResult" values.
      * * If no result is provide, there are no object allocations.
      * @param result optional Range1d to receive parameters along the ray.
      */
@@ -271,7 +277,8 @@ class ConvexClipPlaneSet {
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
      * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect
+     * on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
      * @param matrix matrix to apply
@@ -291,7 +298,8 @@ class ConvexClipPlaneSet {
     /** Return true if `point` satisfies `point.isPointInside` for all planes */
     isPointInside(point) {
         for (const plane of this._planes) {
-            if (!plane.isPointInside(point)) // Defaults to strict inside check. Other clipping classes may use "on or inside" check for the "on" case
+            // Defaults to strict inside check. Other clipping classes may use "on or inside" check for the "on" case
+            if (!plane.isPointInside(point))
                 return false;
         }
         return true;
@@ -319,13 +327,15 @@ class ConvexClipPlaneSet {
         }
         return true;
     }
-    /** Find the parts of the line segment  (if any) that is within the convex clip volume.
-     * * The input fractional interval from fraction0 to fraction1 (increasing!!) is the active part to consider.
-     * * To clip to the usual bounded line segment, starts with fractions (0,1).
+    /**
+     * Find the parts of the line segment (if any) that is within the convex clip volume.
+     * * The line segment is defined by `pointA` and `pointB`.
+     * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.
+     * * To clip to the usual bounded line segment, start with fractions (0,1).
      * If the clip volume is unbounded, the line interval may also be unbounded.
-     * * An unbounded line portion will have fraction coordinates positive or negative Number.MAX_VALUE.
-     * @param fraction0 fraction that is the initial lower fraction of the active interval. (e.g. 0.0 for bounded segment)
-     * @param fraction1 fraction that is the initial upper fraction of the active interval.  (e.g. 1.0 for bounded segment)
+     * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.
+     * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).
+     * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -340,7 +350,7 @@ class ConvexClipPlaneSet {
             const hB = -plane.altitude(pointB);
             fraction = Geometry.conditionalDivideFraction(-hA, (hB - hA));
             if (fraction === undefined) {
-                // LIne parallel to the plane.  If positive, it is all OUT
+                // Line parallel to the plane. If positive, it is all OUT
                 if (hA > 0.0)
                     return false;
             }
@@ -369,7 +379,8 @@ class ConvexClipPlaneSet {
         }
         return false;
     }
-    /** Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
+    /**
+     * Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
      * * `announce(fraction, fraction, curve)`
      */
     announceClippedArcIntervals(arc, announce) {
@@ -381,7 +392,8 @@ class ConvexClipPlaneSet {
         arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);
         return ClipUtilities.selectIntervals01(arc, breaks, this, announce);
     }
-    /** Find the parts of the (unbounded) line segment  (if any) that is within the convex clip volume.
+    /**
+     * Find the parts of the (unbounded) line segment (if any) that is within the convex clip volume.
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -411,7 +423,8 @@ class ConvexClipPlaneSet {
                 return;
         }
     }
-    /** Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
+    /**
+     * Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
      * @param xyz input polygon.
      * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
      * @param arrayCache cache for work arrays.
@@ -454,14 +467,15 @@ class ConvexClipPlaneSet {
         arrayCache.dropToCache(insidePart);
         return undefined;
     }
-    /** Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
+    /**
+     * Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
      * * This has a peculiar expected use case as a very fast pre-filter for more precise clipping.
      * * The expected point set is for a polygon.
      * * Hence any clipping will eventually have to consider the lines between the points.
      * * This method looks for the special case of a single clip plane that has all the points outside.
      * * In this case the whole polygon must be outside.
      * * Note that this does not detect a polygon that is outside but "crosses a corner" -- it is mixed with respect to
-     *     multiple planes.
+     * multiple planes.
      */
     classifyPointContainment(points, onIsOutside) {
         let allInside = true;
@@ -483,7 +497,8 @@ class ConvexClipPlaneSet {
     /**
      * * Create a convex clip set for a polygon swept with possible tilt angle.
      * * planes are constructed by ClipPlane.createEdgeAndUpVector, using successive points from the array.
-     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in reverse order.
+     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in
+     * reverse order.
      * * If first and last points do not match, points are used in order given
      * @param points polygon points. (Closure point optional)
      * @param upVector primary sweep direction, as applied by ClipPlane.createEdgeAndUpVector
@@ -531,7 +546,7 @@ class ConvexClipPlaneSet {
             this._planes.push(ClipPlane.createPlane(plane));
     }
     /**
-     * test many points.  Distribute them to arrays depending on in/out result.
+     * Test many points. Distribute them to arrays depending on in/out result.
      * @param points points to test
      * @param inOrOn points that are in or on the set
      * @param out points that are out.
@@ -551,8 +566,10 @@ class ConvexClipPlaneSet {
     /**
      * Clip a polygon to the planes of the clip plane set.
      * * For a convex input polygon, the output is another convex polygon.
-     * * For a non-convex input, the output may have double-back edges along plane intersections.  This is still a valid clip in a parity sense.
-     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain the polygon
+     * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
+     * valid clip in a parity sense.
+     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
+     * the polygon.
      * @param input input polygon, usually convex.
      * @param output output polygon
      * @param work work array.
@@ -597,7 +614,7 @@ class ConvexClipPlaneSet {
             const inwardNormal = Vector3d.createCrossProduct(sweepDirection.x, sweepDirection.y, sweepDirection.z, edgeVector.x, edgeVector.y, edgeVector.z);
             const inwardNormalNormalized = inwardNormal.normalize();
             let distance;
-            if (inwardNormalNormalized) { // Should never fail... simply a check due to the format of the normalize function return
+            if (inwardNormalNormalized) { // should never fail... simply a check due to the format of the normalize function return
                 distance = inwardNormalNormalized.dotProduct(xyz0);
                 const clipToAdd = ClipPlane.createNormalAndDistance(inwardNormalNormalized, distance, false, false);
                 if (clipToAdd) {
@@ -626,13 +643,16 @@ class ConvexClipPlaneSet {
      * * optionally throw out points that are not in the set.
      * * optionally push the points in the caller-supplied point array.
      * * optionally extend a caller supplied range.
-     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the range is the range of the convex set.
-     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the range is not a representative of the "range of all points in the set" .
+     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the
+     * range is the range of the convex set.
+     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the
+     * range is not a representative of the "range of all points in the set".
      * @param transform (optional) transform to apply to the points.
      * @param points (optional) array to which computed points are to be added.
      * @param range (optional) range to be extended by the computed points
      * @param transform (optional) transform to apply to the accepted points.
-     * @param testContainment if true, test each point to see if it is within the convex set.  (Send false if confident that the convex set is rectilinear set such as a slab.  Send true if chiseled corners are possible)
+     * @param testContainment if true, test each point to see if it is within the convex set. (send false if confident
+     * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).
      * @returns number of points.
      */
     computePlanePlanePlaneIntersections(points, rangeToExtend, transform, testContainment = true) {
@@ -681,11 +701,13 @@ class ConvexClipPlaneSet {
         if (zHigh !== undefined)
             this._planes.push(ClipPlane.createNormalAndDistance(Vector3d.create(0, 0, -1), -zHigh, invisible));
     }
-    /** Implement appendPolygonClip, as defined in interface PolygonClipper.  /**
-     *
+    /**
+     * Implement appendPolygonClip, as defined in interface PolygonClipper.
      * @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 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, insideFragments, outsideFragments, arrayCache) {
@@ -693,7 +715,8 @@ class ConvexClipPlaneSet {
         if (newInside)
             insideFragments.push(newInside);
     }
-    /** Create a convex clip set from a convex mesh.
+    /**
+     * Create a convex clip set from a convex mesh.
      * * Create a plane for each facet.
      * * Assemble the planes as a single clip plane set.
      * * If the facets are closed by edge pairing, use the sign of the computed volume to point the plane normals inward.