@itwin/core-geometry 5.2.0-dev.8 → 5.2.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (800) hide show
  1. package/CHANGELOG.md +46 -1
  2. package/lib/cjs/Constant.js.map +1 -1
  3. package/lib/cjs/Geometry.d.ts +30 -10
  4. package/lib/cjs/Geometry.d.ts.map +1 -1
  5. package/lib/cjs/Geometry.js +74 -10
  6. package/lib/cjs/Geometry.js.map +1 -1
  7. package/lib/cjs/bspline/AkimaCurve3d.d.ts +19 -6
  8. package/lib/cjs/bspline/AkimaCurve3d.d.ts.map +1 -1
  9. package/lib/cjs/bspline/AkimaCurve3d.js +21 -5
  10. package/lib/cjs/bspline/AkimaCurve3d.js.map +1 -1
  11. package/lib/cjs/bspline/BSpline1dNd.js.map +1 -1
  12. package/lib/cjs/bspline/BSplineCurve.d.ts +3 -3
  13. package/lib/cjs/bspline/BSplineCurve.d.ts.map +1 -1
  14. package/lib/cjs/bspline/BSplineCurve.js +6 -6
  15. package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
  16. package/lib/cjs/bspline/BSplineCurve3dH.js.map +1 -1
  17. package/lib/cjs/bspline/BSplineCurveOps.d.ts.map +1 -1
  18. package/lib/cjs/bspline/BSplineCurveOps.js +1 -1
  19. package/lib/cjs/bspline/BSplineCurveOps.js.map +1 -1
  20. package/lib/cjs/bspline/BSplineSurface.js.map +1 -1
  21. package/lib/cjs/bspline/Bezier1dNd.js.map +1 -1
  22. package/lib/cjs/bspline/BezierCurve3d.js.map +1 -1
  23. package/lib/cjs/bspline/BezierCurve3dH.js.map +1 -1
  24. package/lib/cjs/bspline/BezierCurveBase.d.ts +2 -2
  25. package/lib/cjs/bspline/BezierCurveBase.d.ts.map +1 -1
  26. package/lib/cjs/bspline/BezierCurveBase.js +4 -6
  27. package/lib/cjs/bspline/BezierCurveBase.js.map +1 -1
  28. package/lib/cjs/bspline/InterpolationCurve3d.d.ts +27 -17
  29. package/lib/cjs/bspline/InterpolationCurve3d.d.ts.map +1 -1
  30. package/lib/cjs/bspline/InterpolationCurve3d.js +17 -7
  31. package/lib/cjs/bspline/InterpolationCurve3d.js.map +1 -1
  32. package/lib/cjs/bspline/KnotVector.js.map +1 -1
  33. package/lib/cjs/bspline/SurfaceLocationDetail.js.map +1 -1
  34. package/lib/cjs/clipping/AlternatingConvexClipTree.js.map +1 -1
  35. package/lib/cjs/clipping/BooleanClipFactory.js.map +1 -1
  36. package/lib/cjs/clipping/BooleanClipNode.js.map +1 -1
  37. package/lib/cjs/clipping/ClipPlane.d.ts +19 -6
  38. package/lib/cjs/clipping/ClipPlane.d.ts.map +1 -1
  39. package/lib/cjs/clipping/ClipPlane.js +17 -2
  40. package/lib/cjs/clipping/ClipPlane.js.map +1 -1
  41. package/lib/cjs/clipping/ClipPrimitive.js.map +1 -1
  42. package/lib/cjs/clipping/ClipUtils.d.ts +14 -1
  43. package/lib/cjs/clipping/ClipUtils.d.ts.map +1 -1
  44. package/lib/cjs/clipping/ClipUtils.js +21 -3
  45. package/lib/cjs/clipping/ClipUtils.js.map +1 -1
  46. package/lib/cjs/clipping/ClipVector.js.map +1 -1
  47. package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts +14 -11
  48. package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
  49. package/lib/cjs/clipping/ConvexClipPlaneSet.js +23 -16
  50. package/lib/cjs/clipping/ConvexClipPlaneSet.js.map +1 -1
  51. package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts +20 -3
  52. package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
  53. package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js +22 -5
  54. package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
  55. package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
  56. package/lib/cjs/core-geometry.js.map +1 -1
  57. package/lib/cjs/curve/Arc3d.d.ts +27 -17
  58. package/lib/cjs/curve/Arc3d.d.ts.map +1 -1
  59. package/lib/cjs/curve/Arc3d.js +66 -42
  60. package/lib/cjs/curve/Arc3d.js.map +1 -1
  61. package/lib/cjs/curve/ConstructCurveBetweenCurves.js.map +1 -1
  62. package/lib/cjs/curve/CoordinateXYZ.js.map +1 -1
  63. package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map +1 -1
  64. package/lib/cjs/curve/CurveCollection.d.ts +1 -0
  65. package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
  66. package/lib/cjs/curve/CurveCollection.js +1 -0
  67. package/lib/cjs/curve/CurveCollection.js.map +1 -1
  68. package/lib/cjs/curve/CurveCurve.js.map +1 -1
  69. package/lib/cjs/curve/CurveExtendMode.js.map +1 -1
  70. package/lib/cjs/curve/CurveFactory.js.map +1 -1
  71. package/lib/cjs/curve/CurveLocationDetail.d.ts +8 -7
  72. package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
  73. package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
  74. package/lib/cjs/curve/CurveOps.d.ts +48 -1
  75. package/lib/cjs/curve/CurveOps.d.ts.map +1 -1
  76. package/lib/cjs/curve/CurveOps.js +94 -3
  77. package/lib/cjs/curve/CurveOps.js.map +1 -1
  78. package/lib/cjs/curve/CurvePrimitive.js.map +1 -1
  79. package/lib/cjs/curve/CurveProcessor.js.map +1 -1
  80. package/lib/cjs/curve/CurveTypes.js.map +1 -1
  81. package/lib/cjs/curve/CurveWireMomentsXYZ.js.map +1 -1
  82. package/lib/cjs/curve/GeometryQuery.js.map +1 -1
  83. package/lib/cjs/curve/LineSegment3d.js.map +1 -1
  84. package/lib/cjs/curve/LineString3d.d.ts +4 -4
  85. package/lib/cjs/curve/LineString3d.d.ts.map +1 -1
  86. package/lib/cjs/curve/LineString3d.js +8 -8
  87. package/lib/cjs/curve/LineString3d.js.map +1 -1
  88. package/lib/cjs/curve/Loop.js.map +1 -1
  89. package/lib/cjs/curve/OffsetOptions.js.map +1 -1
  90. package/lib/cjs/curve/ParityRegion.js.map +1 -1
  91. package/lib/cjs/curve/Path.js.map +1 -1
  92. package/lib/cjs/curve/PointString3d.js.map +1 -1
  93. package/lib/cjs/curve/ProxyCurve.js.map +1 -1
  94. package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js +3 -3
  95. package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
  96. package/lib/cjs/curve/Query/CurveSplitContext.js.map +1 -1
  97. package/lib/cjs/curve/Query/CylindricalRange.js.map +1 -1
  98. package/lib/cjs/curve/Query/InOutTests.js.map +1 -1
  99. package/lib/cjs/curve/Query/PlanarSubdivision.d.ts +51 -12
  100. package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map +1 -1
  101. package/lib/cjs/curve/Query/PlanarSubdivision.js +106 -83
  102. package/lib/cjs/curve/Query/PlanarSubdivision.js.map +1 -1
  103. package/lib/cjs/curve/Query/StrokeCountChain.js.map +1 -1
  104. package/lib/cjs/curve/Query/StrokeCountMap.js.map +1 -1
  105. package/lib/cjs/curve/RegionMomentsXY.js.map +1 -1
  106. package/lib/cjs/curve/RegionOps.d.ts +49 -25
  107. package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
  108. package/lib/cjs/curve/RegionOps.js +79 -39
  109. package/lib/cjs/curve/RegionOps.js.map +1 -1
  110. package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
  111. package/lib/cjs/curve/RegionOpsClassificationSweeps.js +8 -8
  112. package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
  113. package/lib/cjs/curve/StrokeOptions.js.map +1 -1
  114. package/lib/cjs/curve/UnionRegion.js.map +1 -1
  115. package/lib/cjs/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
  116. package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -1
  117. package/lib/cjs/curve/internalContexts/ChainCollectorContext.js.map +1 -1
  118. package/lib/cjs/curve/internalContexts/CloneCurvesContext.js.map +1 -1
  119. package/lib/cjs/curve/internalContexts/CloneWithExpandedLineStrings.js.map +1 -1
  120. package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
  121. package/lib/cjs/curve/internalContexts/CountLinearPartsSearchContext.js.map +1 -1
  122. package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
  123. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts +1 -0
  124. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
  125. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js +104 -93
  126. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
  127. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
  128. package/lib/cjs/curve/internalContexts/CurveLengthContext.js.map +1 -1
  129. package/lib/cjs/curve/internalContexts/CurveOffsetXYHandler.js.map +1 -1
  130. package/lib/cjs/curve/internalContexts/EllipticalArcApproximationContext.js.map +1 -1
  131. package/lib/cjs/curve/internalContexts/GapSearchContext.js.map +1 -1
  132. package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts +4 -4
  133. package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts.map +1 -1
  134. package/lib/cjs/curve/internalContexts/MultiChainCollector.js +21 -18
  135. package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map +1 -1
  136. package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -1
  137. package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
  138. package/lib/cjs/curve/internalContexts/PolygonOffsetContext.d.ts.map +1 -1
  139. package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js +30 -50
  140. package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
  141. package/lib/cjs/curve/internalContexts/SumLengthsContext.js.map +1 -1
  142. package/lib/cjs/curve/internalContexts/TransferWithSplitArcs.js.map +1 -1
  143. package/lib/cjs/curve/internalContexts/TransformInPlaceContext.js.map +1 -1
  144. package/lib/cjs/curve/spiral/AustralianRailCorpXYEvaluator.js.map +1 -1
  145. package/lib/cjs/curve/spiral/ClothoidSeries.js.map +1 -1
  146. package/lib/cjs/curve/spiral/CubicEvaluator.js.map +1 -1
  147. package/lib/cjs/curve/spiral/CzechSpiralEvaluator.js.map +1 -1
  148. package/lib/cjs/curve/spiral/DirectHalfCosineSpiralEvaluator.js.map +1 -1
  149. package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts +2 -2
  150. package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
  151. package/lib/cjs/curve/spiral/DirectSpiral3d.js +6 -2
  152. package/lib/cjs/curve/spiral/DirectSpiral3d.js.map +1 -1
  153. package/lib/cjs/curve/spiral/IntegratedSpiral3d.d.ts +2 -2
  154. package/lib/cjs/curve/spiral/IntegratedSpiral3d.d.ts.map +1 -1
  155. package/lib/cjs/curve/spiral/IntegratedSpiral3d.js +6 -2
  156. package/lib/cjs/curve/spiral/IntegratedSpiral3d.js.map +1 -1
  157. package/lib/cjs/curve/spiral/MXCubicAlongArcSpiralEvaluator.js.map +1 -1
  158. package/lib/cjs/curve/spiral/NormalizedTransition.js.map +1 -1
  159. package/lib/cjs/curve/spiral/PolishCubicSpiralEvaluator.js.map +1 -1
  160. package/lib/cjs/curve/spiral/TransitionConditionalProperties.js.map +1 -1
  161. package/lib/cjs/curve/spiral/TransitionSpiral3d.d.ts +5 -1
  162. package/lib/cjs/curve/spiral/TransitionSpiral3d.d.ts.map +1 -1
  163. package/lib/cjs/curve/spiral/TransitionSpiral3d.js +0 -3
  164. package/lib/cjs/curve/spiral/TransitionSpiral3d.js.map +1 -1
  165. package/lib/cjs/curve/spiral/XYCurveEvaluator.js.map +1 -1
  166. package/lib/cjs/geometry3d/Angle.js.map +1 -1
  167. package/lib/cjs/geometry3d/AngleSweep.d.ts +6 -2
  168. package/lib/cjs/geometry3d/AngleSweep.d.ts.map +1 -1
  169. package/lib/cjs/geometry3d/AngleSweep.js +12 -3
  170. package/lib/cjs/geometry3d/AngleSweep.js.map +1 -1
  171. package/lib/cjs/geometry3d/BarycentricTriangle.js.map +1 -1
  172. package/lib/cjs/geometry3d/BilinearPatch.js.map +1 -1
  173. package/lib/cjs/geometry3d/CoincidentGeometryOps.js.map +1 -1
  174. package/lib/cjs/geometry3d/Ellipsoid.js.map +1 -1
  175. package/lib/cjs/geometry3d/FrameBuilder.d.ts +2 -1
  176. package/lib/cjs/geometry3d/FrameBuilder.d.ts.map +1 -1
  177. package/lib/cjs/geometry3d/FrameBuilder.js +14 -18
  178. package/lib/cjs/geometry3d/FrameBuilder.js.map +1 -1
  179. package/lib/cjs/geometry3d/FrustumAnimation.js.map +1 -1
  180. package/lib/cjs/geometry3d/GeometryHandler.js.map +1 -1
  181. package/lib/cjs/geometry3d/GrowableBlockedArray.js.map +1 -1
  182. package/lib/cjs/geometry3d/GrowableFloat64Array.js.map +1 -1
  183. package/lib/cjs/geometry3d/GrowableXYArray.d.ts +2 -1
  184. package/lib/cjs/geometry3d/GrowableXYArray.d.ts.map +1 -1
  185. package/lib/cjs/geometry3d/GrowableXYArray.js +2 -1
  186. package/lib/cjs/geometry3d/GrowableXYArray.js.map +1 -1
  187. package/lib/cjs/geometry3d/GrowableXYZArray.d.ts +2 -1
  188. package/lib/cjs/geometry3d/GrowableXYZArray.d.ts.map +1 -1
  189. package/lib/cjs/geometry3d/GrowableXYZArray.js +2 -1
  190. package/lib/cjs/geometry3d/GrowableXYZArray.js.map +1 -1
  191. package/lib/cjs/geometry3d/IndexedCollectionInterval.js.map +1 -1
  192. package/lib/cjs/geometry3d/IndexedXYCollection.js.map +1 -1
  193. package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts +9 -16
  194. package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
  195. package/lib/cjs/geometry3d/IndexedXYZCollection.js +3 -3
  196. package/lib/cjs/geometry3d/IndexedXYZCollection.js.map +1 -1
  197. package/lib/cjs/geometry3d/LongitudeLatitudeAltitude.js.map +1 -1
  198. package/lib/cjs/geometry3d/Matrix3d.d.ts +1 -1
  199. package/lib/cjs/geometry3d/Matrix3d.js +1 -1
  200. package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
  201. package/lib/cjs/geometry3d/OrderedRotationAngles.js.map +1 -1
  202. package/lib/cjs/geometry3d/Plane3d.js.map +1 -1
  203. package/lib/cjs/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
  204. package/lib/cjs/geometry3d/Plane3dByOriginAndVectors.js.map +1 -1
  205. package/lib/cjs/geometry3d/Point2dArrayCarrier.js.map +1 -1
  206. package/lib/cjs/geometry3d/Point2dVector2d.d.ts +18 -2
  207. package/lib/cjs/geometry3d/Point2dVector2d.d.ts.map +1 -1
  208. package/lib/cjs/geometry3d/Point2dVector2d.js +37 -4
  209. package/lib/cjs/geometry3d/Point2dVector2d.js.map +1 -1
  210. package/lib/cjs/geometry3d/Point3dArrayCarrier.js.map +1 -1
  211. package/lib/cjs/geometry3d/Point3dVector3d.d.ts +1 -1
  212. package/lib/cjs/geometry3d/Point3dVector3d.d.ts.map +1 -1
  213. package/lib/cjs/geometry3d/Point3dVector3d.js +1 -0
  214. package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
  215. package/lib/cjs/geometry3d/PointHelpers.js.map +1 -1
  216. package/lib/cjs/geometry3d/PointStreaming.d.ts +8 -0
  217. package/lib/cjs/geometry3d/PointStreaming.d.ts.map +1 -1
  218. package/lib/cjs/geometry3d/PointStreaming.js +18 -2
  219. package/lib/cjs/geometry3d/PointStreaming.js.map +1 -1
  220. package/lib/cjs/geometry3d/PolygonOps.d.ts +18 -9
  221. package/lib/cjs/geometry3d/PolygonOps.d.ts.map +1 -1
  222. package/lib/cjs/geometry3d/PolygonOps.js +53 -26
  223. package/lib/cjs/geometry3d/PolygonOps.js.map +1 -1
  224. package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.d.ts +8 -2
  225. package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.d.ts.map +1 -1
  226. package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js +10 -4
  227. package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
  228. package/lib/cjs/geometry3d/PolylineOps.d.ts +14 -3
  229. package/lib/cjs/geometry3d/PolylineOps.d.ts.map +1 -1
  230. package/lib/cjs/geometry3d/PolylineOps.js +20 -4
  231. package/lib/cjs/geometry3d/PolylineOps.js.map +1 -1
  232. package/lib/cjs/geometry3d/Range.d.ts +34 -32
  233. package/lib/cjs/geometry3d/Range.d.ts.map +1 -1
  234. package/lib/cjs/geometry3d/Range.js +28 -21
  235. package/lib/cjs/geometry3d/Range.js.map +1 -1
  236. package/lib/cjs/geometry3d/Ray2d.d.ts +16 -6
  237. package/lib/cjs/geometry3d/Ray2d.d.ts.map +1 -1
  238. package/lib/cjs/geometry3d/Ray2d.js +28 -4
  239. package/lib/cjs/geometry3d/Ray2d.js.map +1 -1
  240. package/lib/cjs/geometry3d/Ray3d.d.ts.map +1 -1
  241. package/lib/cjs/geometry3d/Ray3d.js +3 -4
  242. package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
  243. package/lib/cjs/geometry3d/ReusableObjectCache.js.map +1 -1
  244. package/lib/cjs/geometry3d/Segment1d.js.map +1 -1
  245. package/lib/cjs/geometry3d/SortablePolygon.js.map +1 -1
  246. package/lib/cjs/geometry3d/Transform.d.ts +1 -1
  247. package/lib/cjs/geometry3d/Transform.js +1 -1
  248. package/lib/cjs/geometry3d/Transform.js.map +1 -1
  249. package/lib/cjs/geometry3d/UVSurfaceOps.js.map +1 -1
  250. package/lib/cjs/geometry3d/XYZProps.d.ts +12 -1
  251. package/lib/cjs/geometry3d/XYZProps.d.ts.map +1 -1
  252. package/lib/cjs/geometry3d/XYZProps.js +17 -2
  253. package/lib/cjs/geometry3d/XYZProps.js.map +1 -1
  254. package/lib/cjs/geometry3d/YawPitchRollAngles.js.map +1 -1
  255. package/lib/cjs/geometry4d/Map4d.js.map +1 -1
  256. package/lib/cjs/geometry4d/Matrix4d.d.ts +16 -0
  257. package/lib/cjs/geometry4d/Matrix4d.d.ts.map +1 -1
  258. package/lib/cjs/geometry4d/Matrix4d.js +26 -0
  259. package/lib/cjs/geometry4d/Matrix4d.js.map +1 -1
  260. package/lib/cjs/geometry4d/MomentData.js.map +1 -1
  261. package/lib/cjs/geometry4d/PlaneByOriginAndVectors4d.js.map +1 -1
  262. package/lib/cjs/geometry4d/Point4d.js.map +1 -1
  263. package/lib/cjs/numerics/BandedSystem.js.map +1 -1
  264. package/lib/cjs/numerics/BezierPolynomials.d.ts.map +1 -1
  265. package/lib/cjs/numerics/BezierPolynomials.js +5 -9
  266. package/lib/cjs/numerics/BezierPolynomials.js.map +1 -1
  267. package/lib/cjs/numerics/ClusterableArray.d.ts.map +1 -1
  268. package/lib/cjs/numerics/ClusterableArray.js +2 -2
  269. package/lib/cjs/numerics/ClusterableArray.js.map +1 -1
  270. package/lib/cjs/numerics/Complex.js.map +1 -1
  271. package/lib/cjs/numerics/ConvexPolygon2d.js.map +1 -1
  272. package/lib/cjs/numerics/Newton.js.map +1 -1
  273. package/lib/cjs/numerics/PascalCoefficients.js.map +1 -1
  274. package/lib/cjs/numerics/PolarData.js.map +1 -1
  275. package/lib/cjs/numerics/Polynomials.js.map +1 -1
  276. package/lib/cjs/numerics/Quadrature.js.map +1 -1
  277. package/lib/cjs/numerics/Range1dArray.js.map +1 -1
  278. package/lib/cjs/numerics/SmallSystem.d.ts +13 -7
  279. package/lib/cjs/numerics/SmallSystem.d.ts.map +1 -1
  280. package/lib/cjs/numerics/SmallSystem.js +13 -7
  281. package/lib/cjs/numerics/SmallSystem.js.map +1 -1
  282. package/lib/cjs/numerics/TriDiagonalSystem.js.map +1 -1
  283. package/lib/cjs/numerics/UnionFind.js.map +1 -1
  284. package/lib/cjs/numerics/UsageSums.js.map +1 -1
  285. package/lib/cjs/polyface/AuxData.js.map +1 -1
  286. package/lib/cjs/polyface/BoxTopology.js.map +1 -1
  287. package/lib/cjs/polyface/FacetFaceData.js.map +1 -1
  288. package/lib/cjs/polyface/FacetLocationDetail.js.map +1 -1
  289. package/lib/cjs/polyface/FacetOrientation.js.map +1 -1
  290. package/lib/cjs/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
  291. package/lib/cjs/polyface/IndexedEdgeMatcher.js.map +1 -1
  292. package/lib/cjs/polyface/IndexedPolyfaceVisitor.js.map +1 -1
  293. package/lib/cjs/polyface/IndexedPolyfaceWalker.js.map +1 -1
  294. package/lib/cjs/polyface/Polyface.d.ts +1 -3
  295. package/lib/cjs/polyface/Polyface.d.ts.map +1 -1
  296. package/lib/cjs/polyface/Polyface.js +2 -6
  297. package/lib/cjs/polyface/Polyface.js.map +1 -1
  298. package/lib/cjs/polyface/PolyfaceBuilder.d.ts +25 -6
  299. package/lib/cjs/polyface/PolyfaceBuilder.d.ts.map +1 -1
  300. package/lib/cjs/polyface/PolyfaceBuilder.js +59 -8
  301. package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
  302. package/lib/cjs/polyface/PolyfaceClip.js.map +1 -1
  303. package/lib/cjs/polyface/PolyfaceData.d.ts +2 -0
  304. package/lib/cjs/polyface/PolyfaceData.d.ts.map +1 -1
  305. package/lib/cjs/polyface/PolyfaceData.js +7 -3
  306. package/lib/cjs/polyface/PolyfaceData.js.map +1 -1
  307. package/lib/cjs/polyface/PolyfaceQuery.d.ts.map +1 -1
  308. package/lib/cjs/polyface/PolyfaceQuery.js +8 -10
  309. package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
  310. package/lib/cjs/polyface/RangeLengthData.js.map +1 -1
  311. package/lib/cjs/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
  312. package/lib/cjs/polyface/RangeTree/MinimumValueTester.js.map +1 -1
  313. package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts +8 -5
  314. package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts.map +1 -1
  315. package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.js +8 -4
  316. package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.js.map +1 -1
  317. package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts +3 -3
  318. package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts.map +1 -1
  319. package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.js +1 -1
  320. package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.js.map +1 -1
  321. package/lib/cjs/polyface/RangeTree/RangeTreeNode.d.ts +4 -2
  322. package/lib/cjs/polyface/RangeTree/RangeTreeNode.d.ts.map +1 -1
  323. package/lib/cjs/polyface/RangeTree/RangeTreeNode.js +9 -12
  324. package/lib/cjs/polyface/RangeTree/RangeTreeNode.js.map +1 -1
  325. package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.d.ts +8 -3
  326. package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map +1 -1
  327. package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.js +13 -6
  328. package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
  329. package/lib/cjs/polyface/TaggedNumericData.js.map +1 -1
  330. package/lib/cjs/polyface/TriangleCandidate.js.map +1 -1
  331. package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
  332. package/lib/cjs/polyface/multiclip/GriddedRaggedRange2dSet.js.map +1 -1
  333. package/lib/cjs/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map +1 -1
  334. package/lib/cjs/polyface/multiclip/LinearSearchRange2dArray.js.map +1 -1
  335. package/lib/cjs/polyface/multiclip/OffsetMeshContext.js.map +1 -1
  336. package/lib/cjs/polyface/multiclip/Range2dSearchInterface.js.map +1 -1
  337. package/lib/cjs/polyface/multiclip/RangeSearch.js.map +1 -1
  338. package/lib/cjs/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
  339. package/lib/cjs/polyface/multiclip/XYPointBuckets.js.map +1 -1
  340. package/lib/cjs/serialization/BGFBAccessors.js.map +1 -1
  341. package/lib/cjs/serialization/BGFBReader.js.map +1 -1
  342. package/lib/cjs/serialization/BGFBWriter.js.map +1 -1
  343. package/lib/cjs/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
  344. package/lib/cjs/serialization/DeepCompare.js +1 -1
  345. package/lib/cjs/serialization/DeepCompare.js.map +1 -1
  346. package/lib/cjs/serialization/GeometrySamples.d.ts +2 -1
  347. package/lib/cjs/serialization/GeometrySamples.d.ts.map +1 -1
  348. package/lib/cjs/serialization/GeometrySamples.js +2 -1
  349. package/lib/cjs/serialization/GeometrySamples.js.map +1 -1
  350. package/lib/cjs/serialization/IModelJsonSchema.js.map +1 -1
  351. package/lib/cjs/serialization/SerializationHelpers.js.map +1 -1
  352. package/lib/cjs/solid/Box.js.map +1 -1
  353. package/lib/cjs/solid/Cone.js.map +1 -1
  354. package/lib/cjs/solid/LinearSweep.js.map +1 -1
  355. package/lib/cjs/solid/RotationalSweep.js.map +1 -1
  356. package/lib/cjs/solid/RuledSweep.js.map +1 -1
  357. package/lib/cjs/solid/SolidPrimitive.js.map +1 -1
  358. package/lib/cjs/solid/Sphere.js.map +1 -1
  359. package/lib/cjs/solid/SweepContour.js.map +1 -1
  360. package/lib/cjs/solid/TorusPipe.js.map +1 -1
  361. package/lib/cjs/topology/ChainMerge.js.map +1 -1
  362. package/lib/cjs/topology/Graph.d.ts +38 -12
  363. package/lib/cjs/topology/Graph.d.ts.map +1 -1
  364. package/lib/cjs/topology/Graph.js +91 -23
  365. package/lib/cjs/topology/Graph.js.map +1 -1
  366. package/lib/cjs/topology/HalfEdgeGraphFromIndexedLoopsContext.d.ts +5 -4
  367. package/lib/cjs/topology/HalfEdgeGraphFromIndexedLoopsContext.d.ts.map +1 -1
  368. package/lib/cjs/topology/HalfEdgeGraphFromIndexedLoopsContext.js +6 -5
  369. package/lib/cjs/topology/HalfEdgeGraphFromIndexedLoopsContext.js.map +1 -1
  370. package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts +20 -11
  371. package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
  372. package/lib/cjs/topology/HalfEdgeGraphSearch.js +43 -39
  373. package/lib/cjs/topology/HalfEdgeGraphSearch.js.map +1 -1
  374. package/lib/cjs/topology/HalfEdgeGraphSpineContext.js.map +1 -1
  375. package/lib/cjs/topology/HalfEdgeGraphValidation.js.map +1 -1
  376. package/lib/cjs/topology/HalfEdgeMarkSet.js.map +1 -1
  377. package/lib/cjs/topology/HalfEdgeNodeXYZUV.js.map +1 -1
  378. package/lib/cjs/topology/HalfEdgePointInGraphSearch.js.map +1 -1
  379. package/lib/cjs/topology/HalfEdgePositionDetail.js.map +1 -1
  380. package/lib/cjs/topology/HalfEdgePriorityQueue.js.map +1 -1
  381. package/lib/cjs/topology/InsertAndRetriangulateContext.js.map +1 -1
  382. package/lib/cjs/topology/MaskManager.js.map +1 -1
  383. package/lib/cjs/topology/Merging.d.ts +22 -11
  384. package/lib/cjs/topology/Merging.d.ts.map +1 -1
  385. package/lib/cjs/topology/Merging.js +31 -21
  386. package/lib/cjs/topology/Merging.js.map +1 -1
  387. package/lib/cjs/topology/RegularizeFace.js.map +1 -1
  388. package/lib/cjs/topology/SignedDataSummary.js.map +1 -1
  389. package/lib/cjs/topology/SpaceTriangulation.js.map +1 -1
  390. package/lib/cjs/topology/Triangulation.d.ts +13 -11
  391. package/lib/cjs/topology/Triangulation.d.ts.map +1 -1
  392. package/lib/cjs/topology/Triangulation.js +40 -36
  393. package/lib/cjs/topology/Triangulation.js.map +1 -1
  394. package/lib/cjs/topology/Voronoi.d.ts +195 -0
  395. package/lib/cjs/topology/Voronoi.d.ts.map +1 -0
  396. package/lib/cjs/topology/Voronoi.js +700 -0
  397. package/lib/cjs/topology/Voronoi.js.map +1 -0
  398. package/lib/cjs/topology/XYParitySearchContext.d.ts +1 -1
  399. package/lib/cjs/topology/XYParitySearchContext.d.ts.map +1 -1
  400. package/lib/cjs/topology/XYParitySearchContext.js.map +1 -1
  401. package/lib/esm/Constant.js.map +1 -1
  402. package/lib/esm/Geometry.d.ts +30 -10
  403. package/lib/esm/Geometry.d.ts.map +1 -1
  404. package/lib/esm/Geometry.js +74 -10
  405. package/lib/esm/Geometry.js.map +1 -1
  406. package/lib/esm/bspline/AkimaCurve3d.d.ts +19 -6
  407. package/lib/esm/bspline/AkimaCurve3d.d.ts.map +1 -1
  408. package/lib/esm/bspline/AkimaCurve3d.js +21 -5
  409. package/lib/esm/bspline/AkimaCurve3d.js.map +1 -1
  410. package/lib/esm/bspline/BSpline1dNd.js.map +1 -1
  411. package/lib/esm/bspline/BSplineCurve.d.ts +3 -3
  412. package/lib/esm/bspline/BSplineCurve.d.ts.map +1 -1
  413. package/lib/esm/bspline/BSplineCurve.js +6 -6
  414. package/lib/esm/bspline/BSplineCurve.js.map +1 -1
  415. package/lib/esm/bspline/BSplineCurve3dH.js.map +1 -1
  416. package/lib/esm/bspline/BSplineCurveOps.d.ts.map +1 -1
  417. package/lib/esm/bspline/BSplineCurveOps.js +1 -1
  418. package/lib/esm/bspline/BSplineCurveOps.js.map +1 -1
  419. package/lib/esm/bspline/BSplineSurface.js.map +1 -1
  420. package/lib/esm/bspline/Bezier1dNd.js.map +1 -1
  421. package/lib/esm/bspline/BezierCurve3d.js.map +1 -1
  422. package/lib/esm/bspline/BezierCurve3dH.js.map +1 -1
  423. package/lib/esm/bspline/BezierCurveBase.d.ts +2 -2
  424. package/lib/esm/bspline/BezierCurveBase.d.ts.map +1 -1
  425. package/lib/esm/bspline/BezierCurveBase.js +4 -6
  426. package/lib/esm/bspline/BezierCurveBase.js.map +1 -1
  427. package/lib/esm/bspline/InterpolationCurve3d.d.ts +27 -17
  428. package/lib/esm/bspline/InterpolationCurve3d.d.ts.map +1 -1
  429. package/lib/esm/bspline/InterpolationCurve3d.js +17 -7
  430. package/lib/esm/bspline/InterpolationCurve3d.js.map +1 -1
  431. package/lib/esm/bspline/KnotVector.js.map +1 -1
  432. package/lib/esm/bspline/SurfaceLocationDetail.js.map +1 -1
  433. package/lib/esm/clipping/AlternatingConvexClipTree.js.map +1 -1
  434. package/lib/esm/clipping/BooleanClipFactory.js.map +1 -1
  435. package/lib/esm/clipping/BooleanClipNode.js.map +1 -1
  436. package/lib/esm/clipping/ClipPlane.d.ts +19 -6
  437. package/lib/esm/clipping/ClipPlane.d.ts.map +1 -1
  438. package/lib/esm/clipping/ClipPlane.js +17 -2
  439. package/lib/esm/clipping/ClipPlane.js.map +1 -1
  440. package/lib/esm/clipping/ClipPrimitive.js.map +1 -1
  441. package/lib/esm/clipping/ClipUtils.d.ts +14 -1
  442. package/lib/esm/clipping/ClipUtils.d.ts.map +1 -1
  443. package/lib/esm/clipping/ClipUtils.js +21 -3
  444. package/lib/esm/clipping/ClipUtils.js.map +1 -1
  445. package/lib/esm/clipping/ClipVector.js.map +1 -1
  446. package/lib/esm/clipping/ConvexClipPlaneSet.d.ts +14 -11
  447. package/lib/esm/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
  448. package/lib/esm/clipping/ConvexClipPlaneSet.js +23 -16
  449. package/lib/esm/clipping/ConvexClipPlaneSet.js.map +1 -1
  450. package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts +20 -3
  451. package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
  452. package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js +22 -5
  453. package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
  454. package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
  455. package/lib/esm/core-geometry.js.map +1 -1
  456. package/lib/esm/curve/Arc3d.d.ts +27 -17
  457. package/lib/esm/curve/Arc3d.d.ts.map +1 -1
  458. package/lib/esm/curve/Arc3d.js +66 -42
  459. package/lib/esm/curve/Arc3d.js.map +1 -1
  460. package/lib/esm/curve/ConstructCurveBetweenCurves.js.map +1 -1
  461. package/lib/esm/curve/CoordinateXYZ.js.map +1 -1
  462. package/lib/esm/curve/CurveChainWithDistanceIndex.js.map +1 -1
  463. package/lib/esm/curve/CurveCollection.d.ts +1 -0
  464. package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
  465. package/lib/esm/curve/CurveCollection.js +1 -0
  466. package/lib/esm/curve/CurveCollection.js.map +1 -1
  467. package/lib/esm/curve/CurveCurve.js.map +1 -1
  468. package/lib/esm/curve/CurveExtendMode.js.map +1 -1
  469. package/lib/esm/curve/CurveFactory.js.map +1 -1
  470. package/lib/esm/curve/CurveLocationDetail.d.ts +8 -7
  471. package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
  472. package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
  473. package/lib/esm/curve/CurveOps.d.ts +48 -1
  474. package/lib/esm/curve/CurveOps.d.ts.map +1 -1
  475. package/lib/esm/curve/CurveOps.js +95 -4
  476. package/lib/esm/curve/CurveOps.js.map +1 -1
  477. package/lib/esm/curve/CurvePrimitive.js.map +1 -1
  478. package/lib/esm/curve/CurveProcessor.js.map +1 -1
  479. package/lib/esm/curve/CurveTypes.js.map +1 -1
  480. package/lib/esm/curve/CurveWireMomentsXYZ.js.map +1 -1
  481. package/lib/esm/curve/GeometryQuery.js.map +1 -1
  482. package/lib/esm/curve/LineSegment3d.js.map +1 -1
  483. package/lib/esm/curve/LineString3d.d.ts +4 -4
  484. package/lib/esm/curve/LineString3d.d.ts.map +1 -1
  485. package/lib/esm/curve/LineString3d.js +8 -8
  486. package/lib/esm/curve/LineString3d.js.map +1 -1
  487. package/lib/esm/curve/Loop.js.map +1 -1
  488. package/lib/esm/curve/OffsetOptions.js.map +1 -1
  489. package/lib/esm/curve/ParityRegion.js.map +1 -1
  490. package/lib/esm/curve/Path.js.map +1 -1
  491. package/lib/esm/curve/PointString3d.js.map +1 -1
  492. package/lib/esm/curve/ProxyCurve.js.map +1 -1
  493. package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js +3 -3
  494. package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
  495. package/lib/esm/curve/Query/CurveSplitContext.js.map +1 -1
  496. package/lib/esm/curve/Query/CylindricalRange.js.map +1 -1
  497. package/lib/esm/curve/Query/InOutTests.js.map +1 -1
  498. package/lib/esm/curve/Query/PlanarSubdivision.d.ts +51 -12
  499. package/lib/esm/curve/Query/PlanarSubdivision.d.ts.map +1 -1
  500. package/lib/esm/curve/Query/PlanarSubdivision.js +106 -83
  501. package/lib/esm/curve/Query/PlanarSubdivision.js.map +1 -1
  502. package/lib/esm/curve/Query/StrokeCountChain.js.map +1 -1
  503. package/lib/esm/curve/Query/StrokeCountMap.js.map +1 -1
  504. package/lib/esm/curve/RegionMomentsXY.js.map +1 -1
  505. package/lib/esm/curve/RegionOps.d.ts +49 -25
  506. package/lib/esm/curve/RegionOps.d.ts.map +1 -1
  507. package/lib/esm/curve/RegionOps.js +77 -37
  508. package/lib/esm/curve/RegionOps.js.map +1 -1
  509. package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
  510. package/lib/esm/curve/RegionOpsClassificationSweeps.js +8 -8
  511. package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
  512. package/lib/esm/curve/StrokeOptions.js.map +1 -1
  513. package/lib/esm/curve/UnionRegion.js.map +1 -1
  514. package/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
  515. package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -1
  516. package/lib/esm/curve/internalContexts/ChainCollectorContext.js.map +1 -1
  517. package/lib/esm/curve/internalContexts/CloneCurvesContext.js.map +1 -1
  518. package/lib/esm/curve/internalContexts/CloneWithExpandedLineStrings.js.map +1 -1
  519. package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
  520. package/lib/esm/curve/internalContexts/CountLinearPartsSearchContext.js.map +1 -1
  521. package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
  522. package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts +1 -0
  523. package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
  524. package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js +104 -93
  525. package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
  526. package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
  527. package/lib/esm/curve/internalContexts/CurveLengthContext.js.map +1 -1
  528. package/lib/esm/curve/internalContexts/CurveOffsetXYHandler.js.map +1 -1
  529. package/lib/esm/curve/internalContexts/EllipticalArcApproximationContext.js.map +1 -1
  530. package/lib/esm/curve/internalContexts/GapSearchContext.js.map +1 -1
  531. package/lib/esm/curve/internalContexts/MultiChainCollector.d.ts +4 -4
  532. package/lib/esm/curve/internalContexts/MultiChainCollector.d.ts.map +1 -1
  533. package/lib/esm/curve/internalContexts/MultiChainCollector.js +21 -18
  534. package/lib/esm/curve/internalContexts/MultiChainCollector.js.map +1 -1
  535. package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -1
  536. package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
  537. package/lib/esm/curve/internalContexts/PolygonOffsetContext.d.ts.map +1 -1
  538. package/lib/esm/curve/internalContexts/PolygonOffsetContext.js +30 -50
  539. package/lib/esm/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
  540. package/lib/esm/curve/internalContexts/SumLengthsContext.js.map +1 -1
  541. package/lib/esm/curve/internalContexts/TransferWithSplitArcs.js.map +1 -1
  542. package/lib/esm/curve/internalContexts/TransformInPlaceContext.js.map +1 -1
  543. package/lib/esm/curve/spiral/AustralianRailCorpXYEvaluator.js.map +1 -1
  544. package/lib/esm/curve/spiral/ClothoidSeries.js.map +1 -1
  545. package/lib/esm/curve/spiral/CubicEvaluator.js.map +1 -1
  546. package/lib/esm/curve/spiral/CzechSpiralEvaluator.js.map +1 -1
  547. package/lib/esm/curve/spiral/DirectHalfCosineSpiralEvaluator.js.map +1 -1
  548. package/lib/esm/curve/spiral/DirectSpiral3d.d.ts +2 -2
  549. package/lib/esm/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
  550. package/lib/esm/curve/spiral/DirectSpiral3d.js +6 -2
  551. package/lib/esm/curve/spiral/DirectSpiral3d.js.map +1 -1
  552. package/lib/esm/curve/spiral/IntegratedSpiral3d.d.ts +2 -2
  553. package/lib/esm/curve/spiral/IntegratedSpiral3d.d.ts.map +1 -1
  554. package/lib/esm/curve/spiral/IntegratedSpiral3d.js +6 -2
  555. package/lib/esm/curve/spiral/IntegratedSpiral3d.js.map +1 -1
  556. package/lib/esm/curve/spiral/MXCubicAlongArcSpiralEvaluator.js.map +1 -1
  557. package/lib/esm/curve/spiral/NormalizedTransition.js.map +1 -1
  558. package/lib/esm/curve/spiral/PolishCubicSpiralEvaluator.js.map +1 -1
  559. package/lib/esm/curve/spiral/TransitionConditionalProperties.js.map +1 -1
  560. package/lib/esm/curve/spiral/TransitionSpiral3d.d.ts +5 -1
  561. package/lib/esm/curve/spiral/TransitionSpiral3d.d.ts.map +1 -1
  562. package/lib/esm/curve/spiral/TransitionSpiral3d.js +0 -3
  563. package/lib/esm/curve/spiral/TransitionSpiral3d.js.map +1 -1
  564. package/lib/esm/curve/spiral/XYCurveEvaluator.js.map +1 -1
  565. package/lib/esm/geometry3d/Angle.js.map +1 -1
  566. package/lib/esm/geometry3d/AngleSweep.d.ts +6 -2
  567. package/lib/esm/geometry3d/AngleSweep.d.ts.map +1 -1
  568. package/lib/esm/geometry3d/AngleSweep.js +12 -3
  569. package/lib/esm/geometry3d/AngleSweep.js.map +1 -1
  570. package/lib/esm/geometry3d/BarycentricTriangle.js.map +1 -1
  571. package/lib/esm/geometry3d/BilinearPatch.js.map +1 -1
  572. package/lib/esm/geometry3d/CoincidentGeometryOps.js.map +1 -1
  573. package/lib/esm/geometry3d/Ellipsoid.js.map +1 -1
  574. package/lib/esm/geometry3d/FrameBuilder.d.ts +2 -1
  575. package/lib/esm/geometry3d/FrameBuilder.d.ts.map +1 -1
  576. package/lib/esm/geometry3d/FrameBuilder.js +14 -18
  577. package/lib/esm/geometry3d/FrameBuilder.js.map +1 -1
  578. package/lib/esm/geometry3d/FrustumAnimation.js.map +1 -1
  579. package/lib/esm/geometry3d/GeometryHandler.js.map +1 -1
  580. package/lib/esm/geometry3d/GrowableBlockedArray.js.map +1 -1
  581. package/lib/esm/geometry3d/GrowableFloat64Array.js.map +1 -1
  582. package/lib/esm/geometry3d/GrowableXYArray.d.ts +2 -1
  583. package/lib/esm/geometry3d/GrowableXYArray.d.ts.map +1 -1
  584. package/lib/esm/geometry3d/GrowableXYArray.js +2 -1
  585. package/lib/esm/geometry3d/GrowableXYArray.js.map +1 -1
  586. package/lib/esm/geometry3d/GrowableXYZArray.d.ts +2 -1
  587. package/lib/esm/geometry3d/GrowableXYZArray.d.ts.map +1 -1
  588. package/lib/esm/geometry3d/GrowableXYZArray.js +2 -1
  589. package/lib/esm/geometry3d/GrowableXYZArray.js.map +1 -1
  590. package/lib/esm/geometry3d/IndexedCollectionInterval.js.map +1 -1
  591. package/lib/esm/geometry3d/IndexedXYCollection.js.map +1 -1
  592. package/lib/esm/geometry3d/IndexedXYZCollection.d.ts +9 -16
  593. package/lib/esm/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
  594. package/lib/esm/geometry3d/IndexedXYZCollection.js +3 -3
  595. package/lib/esm/geometry3d/IndexedXYZCollection.js.map +1 -1
  596. package/lib/esm/geometry3d/LongitudeLatitudeAltitude.js.map +1 -1
  597. package/lib/esm/geometry3d/Matrix3d.d.ts +1 -1
  598. package/lib/esm/geometry3d/Matrix3d.js +1 -1
  599. package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
  600. package/lib/esm/geometry3d/OrderedRotationAngles.js.map +1 -1
  601. package/lib/esm/geometry3d/Plane3d.js.map +1 -1
  602. package/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
  603. package/lib/esm/geometry3d/Plane3dByOriginAndVectors.js.map +1 -1
  604. package/lib/esm/geometry3d/Point2dArrayCarrier.js.map +1 -1
  605. package/lib/esm/geometry3d/Point2dVector2d.d.ts +18 -2
  606. package/lib/esm/geometry3d/Point2dVector2d.d.ts.map +1 -1
  607. package/lib/esm/geometry3d/Point2dVector2d.js +37 -4
  608. package/lib/esm/geometry3d/Point2dVector2d.js.map +1 -1
  609. package/lib/esm/geometry3d/Point3dArrayCarrier.js.map +1 -1
  610. package/lib/esm/geometry3d/Point3dVector3d.d.ts +1 -1
  611. package/lib/esm/geometry3d/Point3dVector3d.d.ts.map +1 -1
  612. package/lib/esm/geometry3d/Point3dVector3d.js +1 -0
  613. package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
  614. package/lib/esm/geometry3d/PointHelpers.js.map +1 -1
  615. package/lib/esm/geometry3d/PointStreaming.d.ts +8 -0
  616. package/lib/esm/geometry3d/PointStreaming.d.ts.map +1 -1
  617. package/lib/esm/geometry3d/PointStreaming.js +18 -2
  618. package/lib/esm/geometry3d/PointStreaming.js.map +1 -1
  619. package/lib/esm/geometry3d/PolygonOps.d.ts +18 -9
  620. package/lib/esm/geometry3d/PolygonOps.d.ts.map +1 -1
  621. package/lib/esm/geometry3d/PolygonOps.js +53 -26
  622. package/lib/esm/geometry3d/PolygonOps.js.map +1 -1
  623. package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.d.ts +8 -2
  624. package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.d.ts.map +1 -1
  625. package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js +10 -4
  626. package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
  627. package/lib/esm/geometry3d/PolylineOps.d.ts +14 -3
  628. package/lib/esm/geometry3d/PolylineOps.d.ts.map +1 -1
  629. package/lib/esm/geometry3d/PolylineOps.js +20 -4
  630. package/lib/esm/geometry3d/PolylineOps.js.map +1 -1
  631. package/lib/esm/geometry3d/Range.d.ts +34 -32
  632. package/lib/esm/geometry3d/Range.d.ts.map +1 -1
  633. package/lib/esm/geometry3d/Range.js +28 -21
  634. package/lib/esm/geometry3d/Range.js.map +1 -1
  635. package/lib/esm/geometry3d/Ray2d.d.ts +16 -6
  636. package/lib/esm/geometry3d/Ray2d.d.ts.map +1 -1
  637. package/lib/esm/geometry3d/Ray2d.js +28 -4
  638. package/lib/esm/geometry3d/Ray2d.js.map +1 -1
  639. package/lib/esm/geometry3d/Ray3d.d.ts.map +1 -1
  640. package/lib/esm/geometry3d/Ray3d.js +3 -4
  641. package/lib/esm/geometry3d/Ray3d.js.map +1 -1
  642. package/lib/esm/geometry3d/ReusableObjectCache.js.map +1 -1
  643. package/lib/esm/geometry3d/Segment1d.js.map +1 -1
  644. package/lib/esm/geometry3d/SortablePolygon.js.map +1 -1
  645. package/lib/esm/geometry3d/Transform.d.ts +1 -1
  646. package/lib/esm/geometry3d/Transform.js +1 -1
  647. package/lib/esm/geometry3d/Transform.js.map +1 -1
  648. package/lib/esm/geometry3d/UVSurfaceOps.js.map +1 -1
  649. package/lib/esm/geometry3d/XYZProps.d.ts +12 -1
  650. package/lib/esm/geometry3d/XYZProps.d.ts.map +1 -1
  651. package/lib/esm/geometry3d/XYZProps.js +16 -1
  652. package/lib/esm/geometry3d/XYZProps.js.map +1 -1
  653. package/lib/esm/geometry3d/YawPitchRollAngles.js.map +1 -1
  654. package/lib/esm/geometry4d/Map4d.js.map +1 -1
  655. package/lib/esm/geometry4d/Matrix4d.d.ts +16 -0
  656. package/lib/esm/geometry4d/Matrix4d.d.ts.map +1 -1
  657. package/lib/esm/geometry4d/Matrix4d.js +26 -0
  658. package/lib/esm/geometry4d/Matrix4d.js.map +1 -1
  659. package/lib/esm/geometry4d/MomentData.js.map +1 -1
  660. package/lib/esm/geometry4d/PlaneByOriginAndVectors4d.js.map +1 -1
  661. package/lib/esm/geometry4d/Point4d.js.map +1 -1
  662. package/lib/esm/numerics/BandedSystem.js.map +1 -1
  663. package/lib/esm/numerics/BezierPolynomials.d.ts.map +1 -1
  664. package/lib/esm/numerics/BezierPolynomials.js +5 -9
  665. package/lib/esm/numerics/BezierPolynomials.js.map +1 -1
  666. package/lib/esm/numerics/ClusterableArray.d.ts.map +1 -1
  667. package/lib/esm/numerics/ClusterableArray.js +2 -2
  668. package/lib/esm/numerics/ClusterableArray.js.map +1 -1
  669. package/lib/esm/numerics/Complex.js.map +1 -1
  670. package/lib/esm/numerics/ConvexPolygon2d.js.map +1 -1
  671. package/lib/esm/numerics/Newton.js.map +1 -1
  672. package/lib/esm/numerics/PascalCoefficients.js.map +1 -1
  673. package/lib/esm/numerics/PolarData.js.map +1 -1
  674. package/lib/esm/numerics/Polynomials.js.map +1 -1
  675. package/lib/esm/numerics/Quadrature.js.map +1 -1
  676. package/lib/esm/numerics/Range1dArray.js.map +1 -1
  677. package/lib/esm/numerics/SmallSystem.d.ts +13 -7
  678. package/lib/esm/numerics/SmallSystem.d.ts.map +1 -1
  679. package/lib/esm/numerics/SmallSystem.js +13 -7
  680. package/lib/esm/numerics/SmallSystem.js.map +1 -1
  681. package/lib/esm/numerics/TriDiagonalSystem.js.map +1 -1
  682. package/lib/esm/numerics/UnionFind.js.map +1 -1
  683. package/lib/esm/numerics/UsageSums.js.map +1 -1
  684. package/lib/esm/polyface/AuxData.js.map +1 -1
  685. package/lib/esm/polyface/BoxTopology.js.map +1 -1
  686. package/lib/esm/polyface/FacetFaceData.js.map +1 -1
  687. package/lib/esm/polyface/FacetLocationDetail.js.map +1 -1
  688. package/lib/esm/polyface/FacetOrientation.js.map +1 -1
  689. package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
  690. package/lib/esm/polyface/IndexedEdgeMatcher.js.map +1 -1
  691. package/lib/esm/polyface/IndexedPolyfaceVisitor.js.map +1 -1
  692. package/lib/esm/polyface/IndexedPolyfaceWalker.js.map +1 -1
  693. package/lib/esm/polyface/Polyface.d.ts +1 -3
  694. package/lib/esm/polyface/Polyface.d.ts.map +1 -1
  695. package/lib/esm/polyface/Polyface.js +2 -6
  696. package/lib/esm/polyface/Polyface.js.map +1 -1
  697. package/lib/esm/polyface/PolyfaceBuilder.d.ts +25 -6
  698. package/lib/esm/polyface/PolyfaceBuilder.d.ts.map +1 -1
  699. package/lib/esm/polyface/PolyfaceBuilder.js +59 -8
  700. package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
  701. package/lib/esm/polyface/PolyfaceClip.js.map +1 -1
  702. package/lib/esm/polyface/PolyfaceData.d.ts +2 -0
  703. package/lib/esm/polyface/PolyfaceData.d.ts.map +1 -1
  704. package/lib/esm/polyface/PolyfaceData.js +7 -3
  705. package/lib/esm/polyface/PolyfaceData.js.map +1 -1
  706. package/lib/esm/polyface/PolyfaceQuery.d.ts.map +1 -1
  707. package/lib/esm/polyface/PolyfaceQuery.js +8 -10
  708. package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
  709. package/lib/esm/polyface/RangeLengthData.js.map +1 -1
  710. package/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
  711. package/lib/esm/polyface/RangeTree/MinimumValueTester.js.map +1 -1
  712. package/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts +8 -5
  713. package/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts.map +1 -1
  714. package/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js +8 -4
  715. package/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js.map +1 -1
  716. package/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts +3 -3
  717. package/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts.map +1 -1
  718. package/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js +1 -1
  719. package/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js.map +1 -1
  720. package/lib/esm/polyface/RangeTree/RangeTreeNode.d.ts +4 -2
  721. package/lib/esm/polyface/RangeTree/RangeTreeNode.d.ts.map +1 -1
  722. package/lib/esm/polyface/RangeTree/RangeTreeNode.js +9 -12
  723. package/lib/esm/polyface/RangeTree/RangeTreeNode.js.map +1 -1
  724. package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.d.ts +8 -3
  725. package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map +1 -1
  726. package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js +13 -6
  727. package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
  728. package/lib/esm/polyface/TaggedNumericData.js.map +1 -1
  729. package/lib/esm/polyface/TriangleCandidate.js.map +1 -1
  730. package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
  731. package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.js.map +1 -1
  732. package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map +1 -1
  733. package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.js.map +1 -1
  734. package/lib/esm/polyface/multiclip/OffsetMeshContext.js.map +1 -1
  735. package/lib/esm/polyface/multiclip/Range2dSearchInterface.js.map +1 -1
  736. package/lib/esm/polyface/multiclip/RangeSearch.js.map +1 -1
  737. package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
  738. package/lib/esm/polyface/multiclip/XYPointBuckets.js.map +1 -1
  739. package/lib/esm/serialization/BGFBAccessors.js.map +1 -1
  740. package/lib/esm/serialization/BGFBReader.js.map +1 -1
  741. package/lib/esm/serialization/BGFBWriter.js.map +1 -1
  742. package/lib/esm/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
  743. package/lib/esm/serialization/DeepCompare.js +1 -1
  744. package/lib/esm/serialization/DeepCompare.js.map +1 -1
  745. package/lib/esm/serialization/GeometrySamples.d.ts +2 -1
  746. package/lib/esm/serialization/GeometrySamples.d.ts.map +1 -1
  747. package/lib/esm/serialization/GeometrySamples.js +2 -1
  748. package/lib/esm/serialization/GeometrySamples.js.map +1 -1
  749. package/lib/esm/serialization/IModelJsonSchema.js.map +1 -1
  750. package/lib/esm/serialization/SerializationHelpers.js.map +1 -1
  751. package/lib/esm/solid/Box.js.map +1 -1
  752. package/lib/esm/solid/Cone.js.map +1 -1
  753. package/lib/esm/solid/LinearSweep.js.map +1 -1
  754. package/lib/esm/solid/RotationalSweep.js.map +1 -1
  755. package/lib/esm/solid/RuledSweep.js.map +1 -1
  756. package/lib/esm/solid/SolidPrimitive.js.map +1 -1
  757. package/lib/esm/solid/Sphere.js.map +1 -1
  758. package/lib/esm/solid/SweepContour.js.map +1 -1
  759. package/lib/esm/solid/TorusPipe.js.map +1 -1
  760. package/lib/esm/topology/ChainMerge.js.map +1 -1
  761. package/lib/esm/topology/Graph.d.ts +38 -12
  762. package/lib/esm/topology/Graph.d.ts.map +1 -1
  763. package/lib/esm/topology/Graph.js +92 -24
  764. package/lib/esm/topology/Graph.js.map +1 -1
  765. package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.d.ts +5 -4
  766. package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.d.ts.map +1 -1
  767. package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js +6 -5
  768. package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js.map +1 -1
  769. package/lib/esm/topology/HalfEdgeGraphSearch.d.ts +20 -11
  770. package/lib/esm/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
  771. package/lib/esm/topology/HalfEdgeGraphSearch.js +43 -39
  772. package/lib/esm/topology/HalfEdgeGraphSearch.js.map +1 -1
  773. package/lib/esm/topology/HalfEdgeGraphSpineContext.js.map +1 -1
  774. package/lib/esm/topology/HalfEdgeGraphValidation.js.map +1 -1
  775. package/lib/esm/topology/HalfEdgeMarkSet.js.map +1 -1
  776. package/lib/esm/topology/HalfEdgeNodeXYZUV.js.map +1 -1
  777. package/lib/esm/topology/HalfEdgePointInGraphSearch.js.map +1 -1
  778. package/lib/esm/topology/HalfEdgePositionDetail.js.map +1 -1
  779. package/lib/esm/topology/HalfEdgePriorityQueue.js.map +1 -1
  780. package/lib/esm/topology/InsertAndRetriangulateContext.js.map +1 -1
  781. package/lib/esm/topology/MaskManager.js.map +1 -1
  782. package/lib/esm/topology/Merging.d.ts +22 -11
  783. package/lib/esm/topology/Merging.d.ts.map +1 -1
  784. package/lib/esm/topology/Merging.js +32 -22
  785. package/lib/esm/topology/Merging.js.map +1 -1
  786. package/lib/esm/topology/RegularizeFace.js.map +1 -1
  787. package/lib/esm/topology/SignedDataSummary.js.map +1 -1
  788. package/lib/esm/topology/SpaceTriangulation.js.map +1 -1
  789. package/lib/esm/topology/Triangulation.d.ts +13 -11
  790. package/lib/esm/topology/Triangulation.d.ts.map +1 -1
  791. package/lib/esm/topology/Triangulation.js +40 -36
  792. package/lib/esm/topology/Triangulation.js.map +1 -1
  793. package/lib/esm/topology/Voronoi.d.ts +195 -0
  794. package/lib/esm/topology/Voronoi.d.ts.map +1 -0
  795. package/lib/esm/topology/Voronoi.js +696 -0
  796. package/lib/esm/topology/Voronoi.js.map +1 -0
  797. package/lib/esm/topology/XYParitySearchContext.d.ts +1 -1
  798. package/lib/esm/topology/XYParitySearchContext.d.ts.map +1 -1
  799. package/lib/esm/topology/XYParitySearchContext.js.map +1 -1
  800. package/package.json +3 -3
@@ -30,6 +30,8 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
30
30
  /** Planes that define the convex set. */
31
31
  private _planes;
32
32
  private constructor();
33
+ /** Return the (reference to the) array of `ClipPlane`. */
34
+ get planes(): ClipPlane[];
33
35
  /**
34
36
  * Return an array containing all the planes of the convex set.
35
37
  * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
@@ -97,8 +99,6 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
97
99
  static setPlaneAndXYLoopCCW(points: GrowableXYZArray, planeOfPolygon: ClipPlane, frustum: ConvexClipPlaneSet): void;
98
100
  /** Deep clone of all planes. */
99
101
  clone(result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
100
- /** Return the (reference to the) array of `ClipPlane` */
101
- get planes(): ClipPlane[];
102
102
  /**
103
103
  * Test if there is any intersection with a ray defined by origin and direction.
104
104
  * * Optionally record the range (null or otherwise) in caller-allocated result.
@@ -176,6 +176,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
176
176
  * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
177
177
  * @param arrayCache cache for work arrays.
178
178
  * @return the surviving inside part (if any)
179
+ * @see polygonClip
179
180
  */
180
181
  clipInsidePushOutside(xyz: IndexedXYZCollection, outsideFragments: GrowableXYZArray[] | undefined, arrayCache: GrowableXYZArrayCache): GrowableXYZArray | undefined;
181
182
  /**
@@ -214,17 +215,18 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
214
215
  clipPointsOnOrInside(points: Point3d[], inOrOn: Point3d[], out: Point3d[]): void;
215
216
  /**
216
217
  * Clip a polygon to the planes of the clip plane set.
217
- * * For a convex input polygon, the output is another convex polygon.
218
- * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
219
- * valid clip in a parity sense.
220
- * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
221
- * the polygon.
222
- * @param input polygon, usually convex.
218
+ * * For a convex input polygon, the output polygon is also convex.
219
+ * * For non-convex input, the output polygon may have double-back edges along plane intersections. This is still a
220
+ * valid clip in a parity sense (overlapping regions cancel).
221
+ * @param input polygon, usually convex. Unchanged.
223
222
  * @param output output polygon
224
- * @param work work array.
225
- * @param containingPlane if this plane is found in the convex set, it is NOT applied.
223
+ * @param work optional work array.
224
+ * @param planeToSkip if this plane is found in the convex set, it is NOT applied.
225
+ * This is useful when caller knows the polygon lies in one of the instance planes.
226
+ * @param tolerance distance tolerance for "on plane" decision. Default value is [[Geometry.smallMetricDistance]].
227
+ * @see appendPolygonClip
226
228
  */
227
- polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray, work: GrowableXYZArray, planeToSkip?: ClipPlane): void;
229
+ polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray, work?: GrowableXYZArray, planeToSkip?: ClipPlane, tolerance?: number): void;
228
230
  /**
229
231
  * * Define new planes in this ConvexClipPlaneSet so it clips to the inside of a polygon.
230
232
  * * always create planes for the swept edges of the polygon
@@ -271,6 +273,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
271
273
  * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
272
274
  * the cache. This is NOT cleared.
273
275
  * @param arrayCache cache for reusable GrowableXYZArray.
276
+ * @see polygonClip
274
277
  */
275
278
  appendPolygonClip(xyz: IndexedXYZCollection, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
276
279
  /**
@@ -1 +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;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,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;;;;;OAKG;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,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,qBAAqB,GAC7G,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;;;;;;;;;;;;;;;OAeG;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,oBAAoB,EACzB,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;CA4BnD"}
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;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,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,0DAA0D;IAC1D,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IACD;;;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;;;;;OAKG;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;;;;;;;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;;;;;;;OAOG;IACI,qBAAqB,CAC1B,GAAG,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,qBAAqB,GAC7G,gBAAgB,GAAG,SAAS;IAwC/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;;;;;;;;;;;;OAYG;IACI,WAAW,CAChB,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EACnC,MAAM,EAAE,gBAAgB,EACxB,IAAI,CAAC,EAAE,gBAAgB,EACvB,WAAW,CAAC,EAAE,SAAS,EACvB,SAAS,GAAE,MAAsC,GAChD,IAAI;IAeP;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAyClG;;;;;;;;;;;;;;;OAeG;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;;;;;;;;;OASG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,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;CA4BnD"}
@@ -33,6 +33,10 @@ class ConvexClipPlaneSet {
33
33
  // this._parity = 1;
34
34
  this._planes = planes ? planes : [];
35
35
  }
36
+ /** Return the (reference to the) array of `ClipPlane`. */
37
+ get planes() {
38
+ return this._planes;
39
+ }
36
40
  /**
37
41
  * Return an array containing all the planes of the convex set.
38
42
  * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
@@ -232,10 +236,6 @@ class ConvexClipPlaneSet {
232
236
  result._planes.push(plane.clone());
233
237
  return result;
234
238
  }
235
- /** Return the (reference to the) array of `ClipPlane` */
236
- get planes() {
237
- return this._planes;
238
- }
239
239
  /**
240
240
  * Test if there is any intersection with a ray defined by origin and direction.
241
241
  * * Optionally record the range (null or otherwise) in caller-allocated result.
@@ -438,6 +438,7 @@ class ConvexClipPlaneSet {
438
438
  * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
439
439
  * @param arrayCache cache for work arrays.
440
440
  * @return the surviving inside part (if any)
441
+ * @see polygonClip
441
442
  */
442
443
  clipInsidePushOutside(xyz, outsideFragments, arrayCache) {
443
444
  const perpendicularRange = Range_1.Range1d.createNull();
@@ -455,7 +456,7 @@ class ConvexClipPlaneSet {
455
456
  if (outsideFragments) // save the definitely outside part as return data.
456
457
  ClipUtils_1.ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);
457
458
  newOutside = arrayCache.grabFromCache();
458
- if (newInside.length === 0) {
459
+ if (newInside.length < 3) { // ignore inside slivers
459
460
  insidePart.length = 0;
460
461
  break;
461
462
  }
@@ -464,7 +465,9 @@ class ConvexClipPlaneSet {
464
465
  insidePart = newInside;
465
466
  newInside = arrayCache.grabFromCache();
466
467
  }
467
- // outside clip was empty .. insideWork is identical to insidePart .. let insidePart feed through to the next clipper.
468
+ else {
469
+ // newOutside is empty => newInside is identical to insidePart. Let insidePart feed through to the next clipper.
470
+ }
468
471
  }
469
472
  // at break or fall out ...
470
473
  // ALWAYS drop `newInside` and `newOutside` to the cache
@@ -574,27 +577,30 @@ class ConvexClipPlaneSet {
574
577
  }
575
578
  /**
576
579
  * Clip a polygon to the planes of the clip plane set.
577
- * * For a convex input polygon, the output is another convex polygon.
578
- * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
579
- * valid clip in a parity sense.
580
- * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
581
- * the polygon.
582
- * @param input polygon, usually convex.
580
+ * * For a convex input polygon, the output polygon is also convex.
581
+ * * For non-convex input, the output polygon may have double-back edges along plane intersections. This is still a
582
+ * valid clip in a parity sense (overlapping regions cancel).
583
+ * @param input polygon, usually convex. Unchanged.
583
584
  * @param output output polygon
584
- * @param work work array.
585
- * @param containingPlane if this plane is found in the convex set, it is NOT applied.
585
+ * @param work optional work array.
586
+ * @param planeToSkip if this plane is found in the convex set, it is NOT applied.
587
+ * This is useful when caller knows the polygon lies in one of the instance planes.
588
+ * @param tolerance distance tolerance for "on plane" decision. Default value is [[Geometry.smallMetricDistance]].
589
+ * @see appendPolygonClip
586
590
  */
587
- polygonClip(input, output, work, planeToSkip) {
591
+ polygonClip(input, output, work, planeToSkip, tolerance = Geometry_1.Geometry.smallMetricDistance) {
588
592
  if (input instanceof GrowableXYZArray_1.GrowableXYZArray)
589
593
  input.clone(output);
590
594
  else
591
595
  GrowableXYZArray_1.GrowableXYZArray.create(input, output);
596
+ if (!work)
597
+ work = new GrowableXYZArray_1.GrowableXYZArray();
592
598
  for (const plane of this._planes) {
593
599
  if (planeToSkip === plane)
594
600
  continue;
595
601
  if (output.length === 0)
596
602
  break;
597
- plane.clipConvexPolygonInPlace(output, work);
603
+ plane.clipConvexPolygonInPlace(output, work, true, tolerance);
598
604
  }
599
605
  }
600
606
  /**
@@ -717,6 +723,7 @@ class ConvexClipPlaneSet {
717
723
  * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
718
724
  * the cache. This is NOT cleared.
719
725
  * @param arrayCache cache for reusable GrowableXYZArray.
726
+ * @see polygonClip
720
727
  */
721
728
  appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
722
729
  const newInside = this.clipInsidePushOutside(xyz, outsideFragments, arrayCache);
@@ -1 +1 @@
1
- {"version":3,"file":"ConvexClipPlaneSet.js","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,0CAAuC;AAEvC,6EAA0E;AAC1E,qEAAkE;AAElE,qDAAkD;AAClD,6FAA0F;AAC1F,mEAAkE;AAClE,yDAAsF;AACtF,+CAAuD;AAKvD,mDAAiE;AACjE,6DAA0D;AAC1D,2CAAwD;AACxD,2CAA2F;AAO3F;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,iEAAiE;IAC1D,MAAM,CAAU,OAAO,GAAG,IAAI,CAAC;IACtC,yCAAyC;IACjC,OAAO,CAAc;IAC7B,+CAA+C;IAC/C,+CAA+C;IAC/C,6DAA6D;IAC7D,YAAoB,MAAoB;QACtC,oBAAoB;QACpB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,MAAM;QACX,MAAM,GAAG,GAAqB,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAyC,EAAE,MAA2B;QAC3F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,qBAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,KAAK;gBACP,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,aAAa,CAAC,KAAyB;QAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,MAAM;YAC9C,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAC1C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClD,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,YAAY,CACxB,MAAoD,EAAE,MAA2B;QAEjF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,qBAAS,EAAE,CAAC;gBAC/B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;iBAAM,IAAI,KAAK,YAAY,2DAA4B,EAAE,CAAC;gBACzD,MAAM,SAAS,GAAG,qBAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,KAAc,EACd,OAAgB,IAAI,EACpB,QAAiB,IAAI,EACrB,OAAgB,IAAI,EACpB,QAAiB,IAAI,EACrB,OAAgB,IAAI,EACpB,QAAiB,IAAI;QAErB,MAAM,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAEhD,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QAE1F,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QAE1F,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAE1F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IACpC,MAAM,CAAC,WAAW,CAAC,MAA2B;QACnD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,kBAAkB,EAAE,CAAC;IAClC,CAAC;IACD,oCAAoC;IAC7B,eAAe;QACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,aAAa,EAAE,CAAC;IAC1B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAA2B;QAE3E,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3F,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACrC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,gBAAgB,CAC5B,MAAiB,EAAE,QAA+B,EAAE,YAAqB,EAAE,MAA2B;QAEtG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,IAAI,GAAa,UAAU,CAAC,mBAAmB,EAAE,CAAC;YACxD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YAEb,IAAI,CAAC,YAAY;gBACf,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YAE1B,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC3D,MAAM,IAAI,GAAG,qBAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC1E,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAiB,EAAE,MAA2B;QACrF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,IAAI,GAAa,UAAU,CAAC,mBAAmB,EAAE,CAAC;YACxD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YAEb,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,GAAG,qBAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC5E,IAAI,IAAI,EAAE,CAAC;oBAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAwB,EAAE,cAAyB,EAAE,OAA2B;QACjH,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QACnB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC,CAAE,8BAA8B;QAChF,MAAM,WAAW,GAAG,MAAM,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC;QACjE,qBAAS,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QAC5H,IAAI,WAAW,CAAC,gBAAgB,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;gBAChD,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;gBAC1C,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;gBAC1C,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBAChB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,qBAAS,CAAC,0BAA0B,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC5E,IAAI,OAAO;oBACT,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IACD,gCAAgC;IACzB,KAAK,CAAC,MAA2B;QACtC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACrC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,yDAAyD;IACzD,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAU,EAAE,MAAgB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC1G,qEAAqE;QACrE,4CAA4C;QAC5C,IAAI,EAAE,GAAG,CAAC,mBAAQ,CAAC,qBAAqB,CAAC;QACzC,IAAI,EAAE,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QACxC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,MAAM,iBAAiB,GAAG,OAAO,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEtC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,iBAAiB,EAAE,CAAC;gBACtC,uEAAuE;gBACvE,IAAI,EAAE,GAAG,CAAC,SAAS;oBACjB,OAAO,KAAK,CAAC,CAAG,8BAA8B;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,WAAW,GAAG,CAAE,EAAE,GAAG,EAAE,CAAC;gBAC9B,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;oBACb,IAAI,WAAW,GAAG,EAAE;wBAClB,EAAE,GAAG,WAAW,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,IAAI,WAAW,GAAG,EAAE;wBAClB,EAAE,GAAG,WAAW,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC,CAAG,8BAA8B;QAChD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACnB,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QACjG,IAAI,MAAM,EAAE,CAAC,CAAE,+CAA+C;YAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO;gBACV,OAAO,KAAK,CAAC;YACf,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAClE,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,uBAAuB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4EAA4E;IACrE,aAAa,CAAC,KAAc;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,yGAAyG;YACzG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC;gBAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gFAAgF;IACzE,iBAAiB,CAAC,KAAc,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACvF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,+DAA+D;QAC/G,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACnF,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,WAAoB,EAAE,MAAc;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC3D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC9C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,QAA4B,CAAC;QACjC,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,QAAQ,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,yDAAyD;gBACzD,IAAI,EAAE,GAAG,GAAG;oBACV,OAAO,KAAK,CAAC;YACjB,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,0BAA0B;gBAC9C,IAAI,QAAQ,GAAG,EAAE;oBACf,OAAO,KAAK,CAAC;gBACf,IAAI,QAAQ,GAAG,EAAE;oBACf,EAAE,GAAG,QAAQ,CAAC;YAClB,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,yBAAyB;gBAC7C,IAAI,QAAQ,GAAG,EAAE;oBACf,OAAO,KAAK,CAAC;gBACf,IAAI,QAAQ,GAAG,EAAE;oBACf,EAAE,GAAG,QAAQ,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,6BAA6B;gBAC7B,IAAI,EAAE,GAAG,GAAG;oBACV,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACO,MAAM,CAAC,qBAAqB,GAAG,IAAI,2CAAoB,EAAE,CAAC;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,MAAM,MAAM,GAAG,kBAAkB,CAAC,qBAAqB,CAAC;QACxD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,SAAS,CAAC,yBAAyB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,KAAK,CAAC,uCAAuC,CAAC,MAAM,CAAC,CAAC;QAC1D,OAAO,yBAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;OAMG;IACI,oBAAoB,CAAC,MAAe,EAAE,MAAe,EAAE,QAA+B;QAC3F,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7G,CAAC;IACD,qCAAqC;IAC9B,gBAAgB,CAAC,SAAoB;QAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAqB,EAAE,IAAsB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE/F,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,wBAAwB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;YAC3D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAChB,OAAO;QACX,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACI,qBAAqB,CAC1B,GAAyB,EAAE,gBAAgD,EAAE,UAAiC;QAE9G,MAAM,kBAAkB,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAChD,IAAI,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC5C,IAAI,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC,CAAE,oBAAoB;QAClE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACzB,mCAAmC;QACnC,uGAAuG;QACvG,oGAAoG;QACpG,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,2CAA8B,CAAC,oCAAoC,CACjE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,CAC7D,CAAC;YACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,uEAAuE;gBACvE,IAAI,gBAAgB,EAAI,mDAAmD;oBACzE,yBAAa,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC3E,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;gBACxC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC3B,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;oBACtB,MAAM;gBACR,CAAC;gBACD,oDAAoD;gBACpD,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBACnC,UAAU,GAAG,SAAS,CAAC;gBACvB,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;YACzC,CAAC;YACD,sHAAsH;QACxH,CAAC;QACD,2BAA2B;QAC3B,wDAAwD;QACxD,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAClC,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACnC,mGAAmG;QACnG,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,UAAU,CAAC;QACpB,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACnC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAiB,EAAE,WAAoB;QACrE,IAAI,SAAS,GAAG,IAAI,CAAC;QACrB,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACnD,MAAM,iBAAiB,GAAG,MAAM,CAAC,CAAG,+CAA+C;QAEnF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC/E,QAAQ,EAAE,CAAC;oBACX,SAAS,GAAG,KAAK,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,KAAK,MAAM,CAAC,MAAM;gBAC5B,OAAO,gCAAoB,CAAC,eAAe,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,CAAC,gCAAoB,CAAC,cAAc,CAAC,CAAC,CAAC,gCAAoB,CAAC,SAAS,CAAC;IAC1F,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAiB,EAAE,QAAkB,EAAE,SAAiB;QAExD,MAAM,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5E,MAAM,aAAa,GAAa,uBAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9D,MAAM,SAAS,GAAG,aAAa,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,SAAS,GAAG,GAAG;gBACjB,OAAO,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAC7F,IAAI,KAAK,EAAE,CAAC,CAAG,+CAA+C;oBAC5D,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAC7F,IAAI,KAAK,EAAE,CAAC,CAAG,+CAA+C;oBAC5D,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,KAA2D;QACpF,IAAI,KAAK,YAAY,qBAAS;YAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACtB,IAAI,KAAK,YAAY,2DAA4B;YACpD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,MAAiB,EAAE,MAAiB,EAAE,GAAc;QAC9E,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,WAAW,CAChB,KAAmC,EAAE,MAAwB,EAAE,IAAsB,EAAE,WAAuB;QAE9G,IAAI,KAAK,YAAY,mCAAgB;YACnC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;;YAEpB,mCAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEzC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,WAAW,KAAK,KAAK;gBACvB,SAAS;YACX,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBACrB,MAAM;YACR,KAAK,CAAC,wBAAwB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAiB,EAAE,cAAwB,EAAE,UAAkB;QACvF,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC;YACR,OAAO,CAAC,CAAC;QAEX,MAAM,WAAW,GAAa,uBAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;QAE3D,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAY,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAY,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;gBAC1B,SAAS;YACX,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjE,MAAM,YAAY,GAAa,0BAAQ,CAAC,kBAAkB,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAC7G,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,sBAAsB,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;YACxD,IAAI,QAAQ,CAAC;YACb,IAAI,sBAAsB,EAAE,CAAC,CAAC,yFAAyF;gBACrH,QAAQ,GAAG,sBAAsB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACnD,MAAM,SAAS,GAAG,qBAAS,CAAC,uBAAuB,CAAC,sBAAsB,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACpG,IAAI,SAAS,EAAE,CAAC;oBAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAAC,CAAC,CAAE,+CAA+C;YACnG,CAAC;QACH,CAAC;QACD,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YACvB,IAAI,qBAAqB,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC;YACpD,IAAI,qBAAqB,EAAE,CAAC,CAAC,4BAA4B;gBACvD,MAAM,CAAC,GAAG,cAAc,CAAC,UAAU,CAAC,qBAAqB,CAAC,GAAG,UAAU,CAAC;gBACxE,IAAI,CAAC,GAAG,GAAG;oBACT,qBAAqB,GAAG,qBAAqB,CAAC,MAAM,EAAE,CAAC;gBACzD,MAAM,IAAI,GAAY,MAAM,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,QAAQ,GAAG,qBAAqB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACxD,MAAM,SAAS,GAAG,qBAAS,CAAC,uBAAuB,CAAC,qBAAqB,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACnG,IAAI,SAAS,EAAE,CAAC;oBAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAAC,CAAC,CAAE,+CAA+C;YACnG,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,mCAAmC,CACxC,MAA6B,EAC7B,aAAkC,EAClC,SAAqB,EACrB,kBAA2B,IAAI;QAE/B,MAAM,UAAU,GAAG,mBAAQ,CAAC,cAAc,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAC/B,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,uGAAuG;QAC1H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,mBAAQ,CAAC,eAAe,CACtB,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,UAAU,CAAC,CAAC;oBACd,IAAI,UAAU,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,MAAM,GAAG,GAAG,UAAU,CAAC,2BAA2B,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAE,CAAC;wBACzH,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;4BAClF,SAAS,EAAE,CAAC;4BACZ,IAAI,SAAS;gCACX,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;4BACtC,IAAI,MAAM;gCACR,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACnB,IAAI,aAAa;gCACf,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;gBACH,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,SAAkB;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,SAAkB,EAAE,IAAa,EAAE,KAAc;QACrE,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAE,CAAC,CAAC;QACnG,IAAI,KAAK,KAAK,SAAS;YACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAE,CAAC,CAAC;IACxG,CAAC;IACD;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAChF,IAAI,SAAS;YACX,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;;;MAUE;IACK,MAAM,CAAC,oBAAoB,CAChC,UAAsC,EAAE,MAA2B;QAEnE,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,6BAAa,CAAC,6BAA6B,CAAC,UAAU,CAAC;YACzD,GAAG,GAAG,6BAAa,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,6DAA6D;QACnG,MAAM,MAAM,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,2DAA4B,CAAC,aAAa,EAAE,CAAC;QAC3D,MAAM,OAAO,GAAG,UAAU,YAAY,mBAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC1F,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAI,CAAC;YAClD,IAAI,SAAS,KAAK,uBAAU,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;gBACjE,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,SAAS,KAAK,2DAA4B,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAG,EAAE,MAAM,EAAE,KAAK,CAAC;oBAC1F,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAC1C,CAAC;;AAnwBH,gDA6wBC","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 CartesianGeometry\n */\n\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { IndexedXYZCollectionPolygonOps, PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { Polyface, PolyfaceVisitor } from \"../polyface/Polyface\";\nimport { PolyfaceQuery } from \"../polyface/PolyfaceQuery\";\nimport { ClipPlane, ClipPlaneProps } from \"./ClipPlane\";\nimport { Clipper, ClipPlaneContainment, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\n\n/** Wire format describing a [[ConvexClipPlaneSet]].\n * @public\n */\nexport type ConvexClipPlaneSetProps = ClipPlaneProps[];\n\n/**\n * A ConvexClipPlaneSet is a collection of ClipPlanes, often used for bounding regions of space.\n * @public\n */\nexport class ConvexClipPlaneSet implements Clipper, PolygonClipper {\n /** Value acting as \"at infinity\" for coordinates along a ray. */\n public static readonly hugeVal = 1e37;\n /** Planes that define the convex set. */\n private _planes: ClipPlane[];\n // private _parity: number; <--- Not yet used\n // public get parity() { return this._parity; }\n // public set parity(value: number) { this._parity = value; }\n private constructor(planes?: ClipPlane[]) {\n // this._parity = 1;\n this._planes = planes ? planes : [];\n }\n /**\n * Return an array containing all the planes of the convex set.\n * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.\n */\n public toJSON(): ConvexClipPlaneSetProps {\n const val: ClipPlaneProps[] = [];\n for (const plane of this._planes)\n val.push(plane.toJSON());\n return val;\n }\n /**\n * Extract clip planes from a json array `[ clipPlane, clipPlane ]`.\n * * Non-clipPlane members are ignored.\n */\n public static fromJSON(json: ConvexClipPlaneSetProps | undefined, result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n result._planes.length = 0;\n if (!Array.isArray(json))\n return result;\n for (const thisJson of json) {\n const plane = ClipPlane.fromJSON(thisJson);\n if (plane)\n result._planes.push(plane);\n }\n return result;\n }\n /**\n * Return true if all members are almostEqual to corresponding members of other. This includes identical order in array.\n * @param other clip plane to compare\n */\n public isAlmostEqual(other: ConvexClipPlaneSet): boolean {\n if (this._planes.length !== other._planes.length)\n return false;\n for (let i = 0; i < this._planes.length; i++)\n if (!this._planes[i].isAlmostEqual(other._planes[i]))\n return false;\n return true;\n }\n /**\n * Create ConvexClipPlaneSet from an array of planes.\n * * Each plane reference in the `planes` array is taken into the result.\n * * The input array itself is NOT taken into the result.\n */\n public static createPlanes(\n planes: (ClipPlane | Plane3dByOriginAndUnitNormal)[], result?: ConvexClipPlaneSet,\n ): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n for (const plane of planes) {\n if (plane instanceof ClipPlane) {\n result._planes.push(plane);\n } else if (plane instanceof Plane3dByOriginAndUnitNormal) {\n const clipPlane = ClipPlane.createPlane(plane);\n result._planes.push(clipPlane);\n }\n }\n return result;\n }\n /**\n * Create new convex set using selected planes of a Range3d.\n * @param range range with coordinates\n * @param lowX true to clip at the low x plane\n * @param highX true to clip at the high x plane\n * @param lowY true to clip at the low y plane\n * @param highY true to clip at the high z plane\n * @param lowZ true to clip at the low z plane\n * @param highZ true to clip at the high z plane\n */\n public static createRange3dPlanes(\n range: Range3d,\n lowX: boolean = true,\n highX: boolean = true,\n lowY: boolean = true,\n highY: boolean = true,\n lowZ: boolean = true,\n highZ: boolean = true,\n ): ConvexClipPlaneSet {\n const result = ConvexClipPlaneSet.createEmpty();\n\n if (lowX)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(1, 0, 0, range.low.x, 0, 0)!);\n if (highX)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(-1, 0, 0, range.high.x, 0, 0)!);\n\n if (lowY)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 1, 0, 0, range.low.y, 0)!);\n if (highY)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, -1, 0, 0, range.high.y, 0)!);\n\n if (lowZ)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 0, 1, 0, 0, range.low.z)!);\n if (highZ)\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 0, -1, 0, 0, range.high.z)!);\n\n return result;\n }\n /** Create an empty `ConvexClipPlaneSet` */\n public static createEmpty(result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\n if (result) {\n result._planes.length = 0;\n return result;\n }\n return new ConvexClipPlaneSet();\n }\n /** Negate all planes of the set. */\n public negateAllPlanes(): void {\n for (const plane of this._planes)\n plane.negateInPlace();\n }\n /**\n * Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.\n * * Note that there is no test for the usual ordering `x0 <= x1` or `y0 <= y1`.\n * * if the usual ordering is violated, the convex set is an empty set.\n * * More details can be found at docs/learning/geometry/Clipping.md\n */\n public static createXYBox(\n x0: number, y0: number, x1: number, y1: number, result?: ConvexClipPlaneSet,\n ): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n result._planes.length = 0;\n const clip0 = ClipPlane.createNormalAndDistance(Vector3d.create(-1, 0, 0), -x1, false, true);\n const clip1 = ClipPlane.createNormalAndDistance(Vector3d.create(1, 0, 0), x0, false, true);\n const clip2 = ClipPlane.createNormalAndDistance(Vector3d.create(0, -1, 0), -y1, false, true);\n const clip3 = ClipPlane.createNormalAndDistance(Vector3d.create(0, 1, 0), y0, false, true);\n if (clip0 && clip1 && clip2 && clip3) {\n result._planes.push(clip0, clip1, clip2, clip3);\n }\n return result;\n }\n /**\n * Create a convex set containing a half space for each edge between points of a polyline.\n * * Caller is responsible for assuring the polyline is convex.\n * @param points array of points. Only xy parts are considered.\n * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the\n * succeeding segment. If this array is not provided, both are false.\n * @param leftIsInside if true, the interior is \"to the left\" of the segments. If false, interior is \"to the right\".\n */\n public static createXYPolyLine(\n points: Point3d[], interior: boolean[] | undefined, leftIsInside: boolean, result?: ConvexClipPlaneSet,\n ): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n result._planes.length = 0;\n for (let i0 = 0; (i0 + 1) < points.length; i0++) {\n const edgeVector: Vector3d = Vector3d.createStartEnd(points[i0], points[i0 + 1]);\n const perp: Vector3d = edgeVector.unitPerpendicularXY();\n perp.z = 0.0;\n\n if (!leftIsInside)\n perp.scaleInPlace(-1.0);\n\n const perpNormalized = perp.normalize();\n if (perpNormalized) {\n const flag = interior !== undefined ? interior[i0] : false;\n const clip = ClipPlane.createNormalAndPoint(perp, points[i0], flag, flag);\n if (clip) {\n result._planes.push(clip);\n }\n }\n }\n return result;\n }\n /**\n * Create a convexClipPlaneSet with planes whose \"inside\" normal is to the left of each segment.\n * @param points array of points.\n */\n public static createXYPolyLineInsideLeft(points: Point3d[], result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n result._planes.length = 0;\n for (let i0 = 0; (i0 + 1) < points.length; i0++) {\n const edgeVector: Vector3d = Vector3d.createStartEnd(points[i0], points[i0 + 1]);\n const perp: Vector3d = edgeVector.unitPerpendicularXY();\n perp.z = 0.0;\n\n const perpNormalized = perp.normalize();\n if (perpNormalized) {\n const clip = ClipPlane.createNormalAndPoint(perp, points[i0], false, false);\n if (clip) { result._planes.push(clip); }\n }\n }\n return result;\n }\n /**\n * Set (or reset) a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.\n * * The planeOfPolygon is (re)initialized with the normal from 3 points, but not otherwise referenced.\n * * The ConvexClipPlaneSet is filled with outward normals of the facet edges as viewed to xy plane.\n * @param points\n * @param result\n */\n public static setPlaneAndXYLoopCCW(points: GrowableXYZArray, planeOfPolygon: ClipPlane, frustum: ConvexClipPlaneSet) {\n const i0 = points.length - 1;\n const n = points.length;\n let x0 = points.getXAtUncheckedPointIndex(i0);\n let y0 = points.getYAtUncheckedPointIndex(i0);\n let x1, y1, nx, ny;\n frustum._planes.length = 0;\n const z0 = points.getZAtUncheckedPointIndex(i0); // z for planes can stay fixed\n const planeNormal = points.crossProductIndexIndexIndex(0, 2, 1)!;\n ClipPlane.createNormalAndPointXYZXYZ(planeNormal.x, planeNormal.y, planeNormal.z, x0, y0, z0, false, false, planeOfPolygon);\n if (planeNormal.normalizeInPlace()) {\n for (let i1 = 0; i1 < n; i1++, x0 = x1, y0 = y1) {\n x1 = points.getXAtUncheckedPointIndex(i1);\n y1 = points.getYAtUncheckedPointIndex(i1);\n nx = -(y1 - y0);\n ny = x1 - x0;\n const clipper = ClipPlane.createNormalAndPointXYZXYZ(nx, ny, 0, x1, y1, z0);\n if (clipper)\n frustum._planes.push(clipper);\n }\n }\n }\n /** Deep clone of all planes. */\n public clone(result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\n result = result ? result : new ConvexClipPlaneSet();\n result._planes.length = 0;\n for (const plane of this._planes)\n result._planes.push(plane.clone());\n return result;\n }\n /** Return the (reference to the) array of `ClipPlane` */\n public get planes(): ClipPlane[] {\n return this._planes;\n }\n /**\n * Test if there is any intersection with a ray defined by origin and direction.\n * * Optionally record the range (null or otherwise) in caller-allocated result.\n * * If the ray is unbounded inside the clip, result can contain positive or negative\n * \"Geometry.largeCoordinateResult\" values.\n * * If no result is provide, there are no object allocations.\n * @param result optional Range1d to receive parameters along the ray.\n */\n public hasIntersectionWithRay(ray: Ray3d, result?: Range1d, tolerance: number = Geometry.smallMetricDistance): boolean {\n // form low and high values in locals that do not require allocation.\n // transfer to caller-supplied result at end\n let t0 = -Geometry.largeCoordinateResult;\n let t1 = Geometry.largeCoordinateResult;\n if (result)\n result.setNull();\n const velocityTolerance = 1.0e-13;\n for (const plane of this._planes) {\n const vD = plane.velocity(ray.direction);\n const vN = plane.altitude(ray.origin);\n\n if (Math.abs(vD) <= velocityTolerance) {\n // Ray is parallel... No need to continue testing if outside halfspace.\n if (vN < -tolerance)\n return false; // and result is a null range.\n } else {\n const rayFraction = - vN / vD;\n if (vD < 0.0) {\n if (rayFraction < t1)\n t1 = rayFraction;\n } else {\n if (rayFraction > t0)\n t0 = rayFraction;\n }\n }\n }\n if (t1 < t0)\n return false; // and result is a null range.\n if (result) {\n result.extendX(t0);\n result.extendX(t1);\n }\n return true;\n }\n /**\n * Multiply all the ClipPlanes DPoint4d by matrix.\n * @param matrix matrix to apply.\n * @param invert if true, use in verse of the matrix.\n * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\n * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect\n * on the plane is the inverse transpose of matrixA.\n * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\n * * Both params default to true to get the full effect of transforming space.\n * @param matrix matrix to apply\n */\n public multiplyPlanesByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\n if (invert) { // form inverse once here, reuse for all planes\n const inverse = matrix.createInverse();\n if (!inverse)\n return false;\n return this.multiplyPlanesByMatrix4d(inverse, false, transpose);\n }\n for (const plane of this._planes) {\n plane.multiplyPlaneByMatrix4d(matrix, false, transpose);\n }\n return true;\n }\n /** Return true if `point` satisfies `point.isPointInside` for all planes */\n public isPointInside(point: Point3d): boolean {\n for (const plane of this._planes) {\n // Defaults to strict inside check. Other clipping classes may use \"on or inside\" check for the \"on\" case\n if (!plane.isPointInside(point))\n return false;\n }\n return true;\n }\n\n /** Return true if `point` satisfies `point.isPointOnOrInside` for all planes */\n public isPointOnOrInside(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n const interiorTolerance = Math.abs(tolerance); // Interior tolerance should always be positive. (TFS# 246598).\n for (const plane of this._planes) {\n if (!plane.isPointOnOrInside(point, (plane.interior ? interiorTolerance : tolerance)))\n return false;\n }\n return true;\n }\n /**\n * Test if a sphere is completely inside the convex set.\n * @param centerPoint center of sphere\n * @param radius radius of sphere.\n */\n public isSphereInside(centerPoint: Point3d, radius: number): boolean {\n const r1 = Math.abs(radius) + Geometry.smallMetricDistance;\n for (const plane of this._planes) {\n if (!plane.isPointOnOrInside(centerPoint, r1)) {\n return false;\n }\n }\n return true;\n }\n /**\n * Find the parts of the line segment (if any) that is within the convex clip volume.\n * * The line segment is defined by `pointA` and `pointB`.\n * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\n * * To clip to the usual bounded line segment, start with fractions (0,1).\n * If the clip volume is unbounded, the line interval may also be unbounded.\n * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\n * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\n * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\n * @param pointA segment start (fraction 0)\n * @param pointB segment end (fraction 1)\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\n * @returns true if a segment was announced, false if entirely outside.\n */\n public announceClippedSegmentIntervals(\n f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\n ): boolean {\n let fraction: number | undefined;\n if (f1 < f0)\n return false;\n for (const plane of this._planes) {\n const hA = -plane.altitude(pointA);\n const hB = -plane.altitude(pointB);\n fraction = Geometry.conditionalDivideFraction(-hA, (hB - hA));\n if (fraction === undefined) {\n // Line parallel to the plane. If positive, it is all OUT\n if (hA > 0.0)\n return false;\n } else if (hB > hA) { // STRICTLY moving outward\n if (fraction < f0)\n return false;\n if (fraction < f1)\n f1 = fraction;\n } else if (hA > hB) { // STRICTLY moving inward\n if (fraction > f1)\n return false;\n if (fraction > f0)\n f0 = fraction;\n } else {\n // Strictly equal evaluations\n if (hA > 0.0)\n return false;\n }\n }\n if (f1 >= f0) {\n if (announce)\n announce(f0, f1);\n return true;\n }\n return false;\n }\n private static _clipArcFractionArray = new GrowableFloat64Array();\n /**\n * Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as\n * * `announce(fraction, fraction, curve)`\n */\n public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n const breaks = ConvexClipPlaneSet._clipArcFractionArray;\n breaks.clear();\n for (const clipPlane of this.planes) {\n clipPlane.appendIntersectionRadians(arc, breaks);\n }\n arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);\n return ClipUtilities.selectIntervals01(arc, breaks, this, announce);\n }\n /**\n * Find the parts of the (unbounded) line segment (if any) that is within the convex clip volume.\n * @param pointA segment start (fraction 0)\n * @param pointB segment end (fraction 1)\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\n * @returns true if a segment was announced, false if entirely outside.\n */\n public clipUnboundedSegment(pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber): boolean {\n return this.announceClippedSegmentIntervals(-Number.MAX_VALUE, Number.MAX_VALUE, pointA, pointB, announce);\n }\n /** transform each plane in place. */\n public transformInPlace(transform: Transform) {\n for (const plane of this._planes) {\n plane.transformInPlace(transform);\n }\n }\n /**\n * Clip a polygon to the inside of the convex set.\n * * Results with 2 or fewer points are ignored.\n * * Other than ensuring capacity in the arrays, there are no object allocations during execution of this function.\n * @param xyz input points.\n * @param work work buffer\n * @param tolerance tolerance for \"on plane\" decision.\n */\n public clipConvexPolygonInPlace(\n xyz: GrowableXYZArray, work: GrowableXYZArray, tolerance: number = Geometry.smallMetricDistance,\n ): void {\n for (const plane of this._planes) {\n plane.clipConvexPolygonInPlace(xyz, work, true, tolerance);\n if (xyz.length < 3)\n return;\n }\n }\n /**\n * Clip a convex polygon to (a single) inside part and (possibly many) outside parts.\n * @param xyz input polygon.\n * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments\n * @param arrayCache cache for work arrays.\n * @return the surviving inside part (if any)\n */\n public clipInsidePushOutside(\n xyz: IndexedXYZCollection, outsideFragments: GrowableXYZArray[] | undefined, arrayCache: GrowableXYZArrayCache,\n ): GrowableXYZArray | undefined {\n const perpendicularRange = Range1d.createNull();\n let newInside = arrayCache.grabFromCache();\n let newOutside = arrayCache.grabFromCache();\n let insidePart = arrayCache.grabFromCache(); // this is empty ...\n insidePart.pushFrom(xyz);\n // While looping through planes . .\n // the outside part for the current plane is definitely outside and can be stashed to the final outside\n // the inside part for the current plane passes forward to be further split by the remaining planes.\n for (const plane of this._planes) {\n IndexedXYZCollectionPolygonOps.splitConvexPolygonInsideOutsidePlane(\n plane, insidePart, newInside, newOutside, perpendicularRange,\n );\n if (newOutside.length > 0) {\n // the newOutside fragment is definitely outside the ConvexClipPlaneSet\n if (outsideFragments) // save the definitely outside part as return data.\n ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);\n newOutside = arrayCache.grabFromCache();\n if (newInside.length === 0) {\n insidePart.length = 0;\n break;\n }\n // insideWork is changed ... swap it with insidePart\n arrayCache.dropToCache(insidePart);\n insidePart = newInside;\n newInside = arrayCache.grabFromCache();\n }\n // outside clip was empty .. insideWork is identical to insidePart .. let insidePart feed through to the next clipper.\n }\n // at break or fall out ...\n // ALWAYS drop `newInside` and `newOutside` to the cache\n arrayCache.dropToCache(newInside);\n arrayCache.dropToCache(newOutside);\n // if `insidePart` is alive, return it to caller. Otherwise drop it to cache and return undefined.\n if (insidePart.length > 0)\n return insidePart;\n arrayCache.dropToCache(insidePart);\n return undefined;\n }\n /**\n * Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.\n * * This has a peculiar expected use case as a very fast pre-filter for more precise clipping.\n * * The expected point set is for a polygon.\n * * Hence any clipping will eventually have to consider the lines between the points.\n * * This method looks for the special case of a single clip plane that has all the points outside.\n * * In this case the whole polygon must be outside.\n * * Note that this does not detect a polygon that is outside but \"crosses a corner\" -- it is mixed with respect to\n * multiple planes.\n */\n public classifyPointContainment(points: Point3d[], onIsOutside: boolean): ClipPlaneContainment {\n let allInside = true;\n const onTolerance = onIsOutside ? 1.0e-8 : -1.0e-8;\n const interiorTolerance = 1.0e-8; // Interior tolerance should always be positive\n\n for (const plane of this._planes) {\n let nOutside = 0;\n for (const point of points) {\n if (plane.altitude(point) < (plane.interior ? interiorTolerance : onTolerance)) {\n nOutside++;\n allInside = false;\n }\n }\n if (nOutside === points.length)\n return ClipPlaneContainment.StronglyOutside;\n }\n return allInside ? ClipPlaneContainment.StronglyInside : ClipPlaneContainment.Ambiguous;\n }\n /**\n * * Create a convex clip set for a polygon swept with possible tilt angle.\n * * planes are constructed by ClipPlane.createEdgeAndUpVector, using successive points from the array.\n * * If the first and last points match, the polygon area is checked. If the area is negative, points are used in\n * reverse order.\n * * If first and last points do not match, points are used in order given\n * @param points polygon points. (Closure point optional)\n * @param upVector primary sweep direction, as applied by ClipPlane.createEdgeAndUpVector\n * @param tiltAngle angle to tilt sweep planes away from the sweep direction.\n */\n public static createSweptPolyline(\n points: Point3d[], upVector: Vector3d, tiltAngle?: Angle,\n ): ConvexClipPlaneSet | undefined {\n const result = ConvexClipPlaneSet.createEmpty();\n let reverse = false;\n if (points.length > 3 && points[0].isAlmostEqual(points[points.length - 1])) {\n const polygonNormal: Vector3d = PolygonOps.areaNormal(points);\n const normalDot = polygonNormal.dotProduct(upVector);\n if (normalDot > 0.0)\n reverse = true;\n }\n for (let i = 0; (i + 1) < points.length; i++) {\n if (reverse) {\n const toAdd = ClipPlane.createEdgeAndUpVector(points[i + 1], points[i], upVector, tiltAngle);\n if (toAdd) { // clipPlane creation could result in undefined\n result.addPlaneToConvexSet(toAdd);\n } else {\n return undefined;\n }\n } else {\n const toAdd = ClipPlane.createEdgeAndUpVector(points[i], points[i + 1], upVector, tiltAngle);\n if (toAdd) { // clipPlane creation could result in undefined\n result.addPlaneToConvexSet(toAdd);\n } else {\n return undefined;\n }\n }\n }\n return result;\n }\n /**\n * Add a plane to the convex set.\n * @param plane plane to add\n */\n public addPlaneToConvexSet(plane: ClipPlane | Plane3dByOriginAndUnitNormal | undefined) {\n if (plane instanceof ClipPlane)\n this._planes.push(plane);\n else if (plane instanceof Plane3dByOriginAndUnitNormal)\n this._planes.push(ClipPlane.createPlane(plane));\n }\n /**\n * Test many points. Distribute them to arrays depending on in/out result.\n * @param points points to test\n * @param inOrOn points that are in or on the set\n * @param out points that are out.\n */\n public clipPointsOnOrInside(points: Point3d[], inOrOn: Point3d[], out: Point3d[]) {\n inOrOn.length = 0;\n out.length = 0;\n for (const xyz of points) {\n if (this.isPointOnOrInside(xyz, 0.0)) {\n inOrOn.push(xyz);\n } else {\n out.push(xyz);\n }\n }\n }\n /**\n * Clip a polygon to the planes of the clip plane set.\n * * For a convex input polygon, the output is another convex polygon.\n * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a\n * valid clip in a parity sense.\n * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain\n * the polygon.\n * @param input polygon, usually convex.\n * @param output output polygon\n * @param work work array.\n * @param containingPlane if this plane is found in the convex set, it is NOT applied.\n */\n public polygonClip(\n input: GrowableXYZArray | Point3d[], output: GrowableXYZArray, work: GrowableXYZArray, planeToSkip?: ClipPlane,\n ): void {\n if (input instanceof GrowableXYZArray)\n input.clone(output);\n else\n GrowableXYZArray.create(input, output);\n\n for (const plane of this._planes) {\n if (planeToSkip === plane)\n continue;\n if (output.length === 0)\n break;\n plane.clipConvexPolygonInPlace(output, work);\n }\n }\n /**\n * * Define new planes in this ConvexClipPlaneSet so it clips to the inside of a polygon.\n * * always create planes for the swept edges of the polygon\n * * optionally (with nonzero sideSelect) create a cap plane using the polygon normal.\n * @param points Points of a bounding polygon\n * @param sweepDirection direction to sweep.\n * @param sideSelect 0 to have no cap polygon, 1 if the sweep vector side is in, -1 if sweep vector side is out.\n */\n public reloadSweptPolygon(points: Point3d[], sweepDirection: Vector3d, sideSelect: number): number {\n this._planes.length = 0;\n const n = points.length;\n if (n <= 2)\n return 0;\n\n const planeNormal: Vector3d = PolygonOps.areaNormal(points);\n const isCCW = sweepDirection.dotProduct(planeNormal) > 0.0;\n\n const delta = isCCW ? 1 : n - 1;\n for (let i = 0; i < n; i++) {\n const i1 = (i + delta) % n;\n const xyz0: Point3d = points[i];\n const xyz1: Point3d = points[i1];\n if (xyz0.isAlmostEqual(xyz1))\n continue;\n const edgeVector: Vector3d = Vector3d.createStartEnd(xyz0, xyz1);\n const inwardNormal: Vector3d = Vector3d.createCrossProduct(sweepDirection.x, sweepDirection.y, sweepDirection.z,\n edgeVector.x, edgeVector.y, edgeVector.z);\n const inwardNormalNormalized = inwardNormal.normalize();\n let distance;\n if (inwardNormalNormalized) { // should never fail... simply a check due to the format of the normalize function return\n distance = inwardNormalNormalized.dotProduct(xyz0);\n const clipToAdd = ClipPlane.createNormalAndDistance(inwardNormalNormalized, distance, false, false);\n if (clipToAdd) { this._planes.push(clipToAdd); } // clipPlane creation could result in undefined\n }\n }\n if (sideSelect !== 0.0) {\n let planeNormalNormalized = planeNormal.normalize();\n if (planeNormalNormalized) { // Again.. should never fail\n const a = sweepDirection.dotProduct(planeNormalNormalized) * sideSelect;\n if (a < 0.0)\n planeNormalNormalized = planeNormalNormalized.negate();\n const xyz0: Point3d = points[0];\n const distance = planeNormalNormalized.dotProduct(xyz0);\n const clipToAdd = ClipPlane.createNormalAndDistance(planeNormalNormalized, distance, false, false);\n if (clipToAdd) { this._planes.push(clipToAdd); } // clipPlane creation could result in undefined\n }\n }\n return isCCW ? 1 : -1;\n }\n /**\n * Compute intersections among all combinations of 3 planes in the convex set.\n * * optionally throw out points that are not in the set.\n * * optionally push the points in the caller-supplied point array.\n * * optionally extend a caller supplied range.\n * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the\n * range is the range of the convex set.\n * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the\n * range is not a representative of the \"range of all points in the set\".\n * @param points (optional) array to which computed points are to be added.\n * @param rangeToExtend (optional) range to be extended by the computed points\n * @param transform (optional) transform to apply to the accepted points.\n * @param testContainment if true, test each point to see if it is within the convex set. (send false if confident\n * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).\n * @returns number of points.\n */\n public computePlanePlanePlaneIntersections(\n points: Point3d[] | undefined,\n rangeToExtend: Range3d | undefined,\n transform?: Transform,\n testContainment: boolean = true,\n ): number {\n const normalRows = Matrix3d.createIdentity();\n const allPlanes = this._planes;\n const n = allPlanes.length;\n let numPoints = 0; // explicitly count points -- can't wait to end for points.length because it may be an optional output.\n for (let i = 0; i < n; i++) {\n for (let j = i + 1; j < n; j++)\n for (let k = j + 1; k < n; k++) {\n Matrix3d.createRowValues(\n allPlanes[i].inwardNormalRef.x, allPlanes[i].inwardNormalRef.y, allPlanes[i].inwardNormalRef.z,\n allPlanes[j].inwardNormalRef.x, allPlanes[j].inwardNormalRef.y, allPlanes[j].inwardNormalRef.z,\n allPlanes[k].inwardNormalRef.x, allPlanes[k].inwardNormalRef.y, allPlanes[k].inwardNormalRef.z,\n normalRows);\n if (normalRows.computeCachedInverse(false)) {\n const xyz = normalRows.multiplyInverseXYZAsPoint3d(allPlanes[i].distance, allPlanes[j].distance, allPlanes[k].distance)!;\n if (!testContainment || this.isPointOnOrInside(xyz, Geometry.smallMetricDistance)) {\n numPoints++;\n if (transform)\n transform.multiplyPoint3d(xyz, xyz);\n if (points)\n points.push(xyz);\n if (rangeToExtend)\n rangeToExtend.extendPoint(xyz);\n }\n }\n }\n }\n return numPoints;\n }\n /**\n * Set the `invisible` property on each plane of the convex set.\n * @param invisible value to store\n */\n public setInvisible(invisible: boolean) {\n for (const plane of this._planes) {\n plane.setInvisible(invisible);\n }\n }\n /**\n * Add planes for z-direction clip between low and high z levels.\n * @param invisible value to apply to the `invisible` bit for the new planes\n * @param zLow low z value. The plane clips out points with z below this.\n * @param zHigh high z value. The plane clips out points with z above this.\n */\n public addZClipPlanes(invisible: boolean, zLow?: number, zHigh?: number) {\n if (zLow !== undefined)\n this._planes.push(ClipPlane.createNormalAndDistance(Vector3d.create(0, 0, 1), zLow, invisible)!);\n if (zHigh !== undefined)\n this._planes.push(ClipPlane.createNormalAndDistance(Vector3d.create(0, 0, -1), -zHigh, invisible)!);\n }\n /**\n * Implement appendPolygonClip, as defined in interface PolygonClipper.\n * @param xyz convex polygon. This is not changed.\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param arrayCache cache for reusable GrowableXYZArray.\n */\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ): void {\n const newInside = this.clipInsidePushOutside(xyz, outsideFragments, arrayCache);\n if (newInside)\n insideFragments.push(newInside);\n }\n /**\n * Create a convex clip set from a convex mesh.\n * * Create a plane for each facet.\n * * Assemble the planes as a single clip plane set.\n * * If the facets are closed by edge pairing, use the sign of the computed volume to point the plane normals inward.\n * * If the facets are not closed, the facet orientation determines plane orientation.\n * * The implication of this is that if the facets are a convex volume, the returned clip plane set is convex.\n * @param convexMesh input mesh. For best results, the mesh should be closed and convex.\n * @param result optional preallocated result to reuse and return\n * @return clipper and volume (zero if mesh is not closed)\n */\n public static createConvexPolyface(\n convexMesh: Polyface | PolyfaceVisitor, result?: ConvexClipPlaneSet,\n ): { clipper: ConvexClipPlaneSet, volume: number } {\n result = this.createEmpty(result);\n let vol = 0;\n if (PolyfaceQuery.isPolyfaceClosedByEdgePairing(convexMesh))\n vol = PolyfaceQuery.sumTetrahedralVolumes(convexMesh);\n const scale = vol > 0.0 ? -1.0 : 1.0; // point clipper normals inward if mesh normals point outward\n const normal = Vector3d.create();\n const plane = Plane3dByOriginAndUnitNormal.createXYPlane();\n const visitor = convexMesh instanceof Polyface ? convexMesh.createVisitor(0) : convexMesh;\n visitor.setNumWrap(0);\n for (visitor.reset(); visitor.moveToNextFacet(); ) {\n if (undefined !== PolygonOps.areaNormalGo(visitor.point, normal)) {\n normal.scaleInPlace(scale);\n if (undefined !== Plane3dByOriginAndUnitNormal.create(visitor.point.front()!, normal, plane))\n result.addPlaneToConvexSet(plane);\n }\n }\n return { clipper: result, volume: vol };\n }\n\n // FUNCTIONS SKIPPED DUE TO BSPLINES, VU, OR NON-USAGE IN NATIVE CODE----------------------------------------------------------------\n\n // Uses bsplines... skipping for now:\n // public convexAppendIntervalsFromBspline();\n\n // Uses pushing and clearing from/to a cache and added functionality for arrays. . . skipping for now\n // public convexPolygonClipInsideOutside(input: Point3d[], inside: Point3d[], outside: Point3d[], work1: Point3d[], work2: Point3d[],\n // clearOutside: boolean, distanceTolerance: number)\n}\n"]}
1
+ {"version":3,"file":"ConvexClipPlaneSet.js","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,0CAAuC;AAEvC,6EAA0E;AAC1E,qEAAkE;AAElE,qDAAkD;AAClD,6FAA0F;AAC1F,mEAAkE;AAClE,yDAAsF;AACtF,+CAAuD;AAKvD,mDAAiE;AACjE,6DAA0D;AAC1D,2CAAwD;AACxD,2CAA2F;AAO3F;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,iEAAiE;IAC1D,MAAM,CAAU,OAAO,GAAG,IAAI,CAAC;IACtC,yCAAyC;IACjC,OAAO,CAAc;IAC7B,+CAA+C;IAC/C,+CAA+C;IAC/C,6DAA6D;IAC7D,YAAoB,MAAoB;QACtC,oBAAoB;QACpB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IACD,0DAA0D;IAC1D,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD;;;OAGG;IACI,MAAM;QACX,MAAM,GAAG,GAAqB,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAyC,EAAE,MAA2B;QAC3F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,qBAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,KAAK;gBACP,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,aAAa,CAAC,KAAyB;QAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,MAAM;YAC9C,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAC1C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClD,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,YAAY,CACxB,MAAoD,EAAE,MAA2B;QAEjF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,qBAAS,EAAE,CAAC;gBAC/B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;iBAAM,IAAI,KAAK,YAAY,2DAA4B,EAAE,CAAC;gBACzD,MAAM,SAAS,GAAG,qBAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,KAAc,EACd,OAAgB,IAAI,EACpB,QAAiB,IAAI,EACrB,OAAgB,IAAI,EACpB,QAAiB,IAAI,EACrB,OAAgB,IAAI,EACpB,QAAiB,IAAI;QAErB,MAAM,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAEhD,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QAE1F,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;QAE1F,IAAI,IAAI;YACN,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QACxF,IAAI,KAAK;YACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAS,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAE1F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IACpC,MAAM,CAAC,WAAW,CAAC,MAA2B;QACnD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,kBAAkB,EAAE,CAAC;IAClC,CAAC;IACD,oCAAoC;IAC7B,eAAe;QACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,aAAa,EAAE,CAAC;IAC1B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAA2B;QAE3E,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3F,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACrC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,gBAAgB,CAC5B,MAAiB,EAAE,QAA+B,EAAE,YAAqB,EAAE,MAA2B;QAEtG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,IAAI,GAAa,UAAU,CAAC,mBAAmB,EAAE,CAAC;YACxD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YAEb,IAAI,CAAC,YAAY;gBACf,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YAE1B,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC3D,MAAM,IAAI,GAAG,qBAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC1E,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAiB,EAAE,MAA2B;QACrF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,IAAI,GAAa,UAAU,CAAC,mBAAmB,EAAE,CAAC;YACxD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YAEb,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,GAAG,qBAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC5E,IAAI,IAAI,EAAE,CAAC;oBAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAwB,EAAE,cAAyB,EAAE,OAA2B;QACjH,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QACnB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC,CAAE,8BAA8B;QAChF,MAAM,WAAW,GAAG,MAAM,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC;QACjE,qBAAS,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QAC5H,IAAI,WAAW,CAAC,gBAAgB,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;gBAChD,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;gBAC1C,EAAE,GAAG,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAC;gBAC1C,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBAChB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,qBAAS,CAAC,0BAA0B,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC5E,IAAI,OAAO;oBACT,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IACD,gCAAgC;IACzB,KAAK,CAAC,MAA2B;QACtC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACrC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAU,EAAE,MAAgB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC1G,qEAAqE;QACrE,4CAA4C;QAC5C,IAAI,EAAE,GAAG,CAAC,mBAAQ,CAAC,qBAAqB,CAAC;QACzC,IAAI,EAAE,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QACxC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,MAAM,iBAAiB,GAAG,OAAO,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEtC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,iBAAiB,EAAE,CAAC;gBACtC,uEAAuE;gBACvE,IAAI,EAAE,GAAG,CAAC,SAAS;oBACjB,OAAO,KAAK,CAAC,CAAG,8BAA8B;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,WAAW,GAAG,CAAE,EAAE,GAAG,EAAE,CAAC;gBAC9B,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;oBACb,IAAI,WAAW,GAAG,EAAE;wBAClB,EAAE,GAAG,WAAW,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,IAAI,WAAW,GAAG,EAAE;wBAClB,EAAE,GAAG,WAAW,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC,CAAG,8BAA8B;QAChD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACnB,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QACjG,IAAI,MAAM,EAAE,CAAC,CAAE,+CAA+C;YAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO;gBACV,OAAO,KAAK,CAAC;YACf,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAClE,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,uBAAuB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4EAA4E;IACrE,aAAa,CAAC,KAAc;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,yGAAyG;YACzG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC;gBAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gFAAgF;IACzE,iBAAiB,CAAC,KAAc,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACvF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,+DAA+D;QAC/G,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACnF,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,WAAoB,EAAE,MAAc;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC3D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC9C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,QAA4B,CAAC;QACjC,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,QAAQ,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,yDAAyD;gBACzD,IAAI,EAAE,GAAG,GAAG;oBACV,OAAO,KAAK,CAAC;YACjB,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,0BAA0B;gBAC9C,IAAI,QAAQ,GAAG,EAAE;oBACf,OAAO,KAAK,CAAC;gBACf,IAAI,QAAQ,GAAG,EAAE;oBACf,EAAE,GAAG,QAAQ,CAAC;YAClB,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,yBAAyB;gBAC7C,IAAI,QAAQ,GAAG,EAAE;oBACf,OAAO,KAAK,CAAC;gBACf,IAAI,QAAQ,GAAG,EAAE;oBACf,EAAE,GAAG,QAAQ,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,6BAA6B;gBAC7B,IAAI,EAAE,GAAG,GAAG;oBACV,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACO,MAAM,CAAC,qBAAqB,GAAG,IAAI,2CAAoB,EAAE,CAAC;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,MAAM,MAAM,GAAG,kBAAkB,CAAC,qBAAqB,CAAC;QACxD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,SAAS,CAAC,yBAAyB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,KAAK,CAAC,uCAAuC,CAAC,MAAM,CAAC,CAAC;QAC1D,OAAO,yBAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;OAMG;IACI,oBAAoB,CAAC,MAAe,EAAE,MAAe,EAAE,QAA+B;QAC3F,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7G,CAAC;IACD,qCAAqC;IAC9B,gBAAgB,CAAC,SAAoB;QAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAqB,EAAE,IAAsB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE/F,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,wBAAwB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;YAC3D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAChB,OAAO;QACX,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,qBAAqB,CAC1B,GAAyB,EAAE,gBAAgD,EAAE,UAAiC;QAE9G,MAAM,kBAAkB,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAChD,IAAI,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC5C,IAAI,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC,CAAE,oBAAoB;QAClE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACzB,mCAAmC;QACnC,uGAAuG;QACvG,oGAAoG;QACpG,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,2CAA8B,CAAC,oCAAoC,CACjE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,CAC7D,CAAC;YACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,uEAAuE;gBACvE,IAAI,gBAAgB,EAAI,mDAAmD;oBACzE,yBAAa,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC3E,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;gBACxC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,wBAAwB;oBAClD,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;oBACtB,MAAM;gBACR,CAAC;gBACD,oDAAoD;gBACpD,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBACnC,UAAU,GAAG,SAAS,CAAC;gBACvB,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;YACzC,CAAC;iBAAM,CAAC;gBACN,gHAAgH;YAClH,CAAC;QACH,CAAC;QACD,2BAA2B;QAC3B,wDAAwD;QACxD,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAClC,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACnC,mGAAmG;QACnG,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,UAAU,CAAC;QACpB,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACnC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAiB,EAAE,WAAoB;QACrE,IAAI,SAAS,GAAG,IAAI,CAAC;QACrB,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACnD,MAAM,iBAAiB,GAAG,MAAM,CAAC,CAAG,+CAA+C;QAEnF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC/E,QAAQ,EAAE,CAAC;oBACX,SAAS,GAAG,KAAK,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,KAAK,MAAM,CAAC,MAAM;gBAC5B,OAAO,gCAAoB,CAAC,eAAe,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,CAAC,gCAAoB,CAAC,cAAc,CAAC,CAAC,CAAC,gCAAoB,CAAC,SAAS,CAAC;IAC1F,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAiB,EAAE,QAAkB,EAAE,SAAiB;QAExD,MAAM,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5E,MAAM,aAAa,GAAa,uBAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9D,MAAM,SAAS,GAAG,aAAa,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,SAAS,GAAG,GAAG;gBACjB,OAAO,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAC7F,IAAI,KAAK,EAAE,CAAC,CAAG,+CAA+C;oBAC5D,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAC7F,IAAI,KAAK,EAAE,CAAC,CAAG,+CAA+C;oBAC5D,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,KAA2D;QACpF,IAAI,KAAK,YAAY,qBAAS;YAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACtB,IAAI,KAAK,YAAY,2DAA4B;YACpD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,MAAiB,EAAE,MAAiB,EAAE,GAAc;QAC9E,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,WAAW,CAChB,KAAmC,EACnC,MAAwB,EACxB,IAAuB,EACvB,WAAuB,EACvB,YAAqB,mBAAQ,CAAC,mBAAmB;QAEjD,IAAI,KAAK,YAAY,mCAAgB;YACnC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;;YAEpB,mCAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI;YACP,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,WAAW,KAAK,KAAK;gBACvB,SAAS;YACX,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBACrB,MAAM;YACR,KAAK,CAAC,wBAAwB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAiB,EAAE,cAAwB,EAAE,UAAkB;QACvF,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC;YACR,OAAO,CAAC,CAAC;QAEX,MAAM,WAAW,GAAa,uBAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;QAE3D,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAY,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAY,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;gBAC1B,SAAS;YACX,MAAM,UAAU,GAAa,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjE,MAAM,YAAY,GAAa,0BAAQ,CAAC,kBAAkB,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAC7G,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,sBAAsB,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;YACxD,IAAI,QAAQ,CAAC;YACb,IAAI,sBAAsB,EAAE,CAAC,CAAC,yFAAyF;gBACrH,QAAQ,GAAG,sBAAsB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACnD,MAAM,SAAS,GAAG,qBAAS,CAAC,uBAAuB,CAAC,sBAAsB,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACpG,IAAI,SAAS,EAAE,CAAC;oBAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAAC,CAAC,CAAE,+CAA+C;YACnG,CAAC;QACH,CAAC;QACD,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YACvB,IAAI,qBAAqB,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC;YACpD,IAAI,qBAAqB,EAAE,CAAC,CAAC,4BAA4B;gBACvD,MAAM,CAAC,GAAG,cAAc,CAAC,UAAU,CAAC,qBAAqB,CAAC,GAAG,UAAU,CAAC;gBACxE,IAAI,CAAC,GAAG,GAAG;oBACT,qBAAqB,GAAG,qBAAqB,CAAC,MAAM,EAAE,CAAC;gBACzD,MAAM,IAAI,GAAY,MAAM,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,QAAQ,GAAG,qBAAqB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACxD,MAAM,SAAS,GAAG,qBAAS,CAAC,uBAAuB,CAAC,qBAAqB,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACnG,IAAI,SAAS,EAAE,CAAC;oBAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAAC,CAAC,CAAE,+CAA+C;YACnG,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,mCAAmC,CACxC,MAA6B,EAC7B,aAAkC,EAClC,SAAqB,EACrB,kBAA2B,IAAI;QAE/B,MAAM,UAAU,GAAG,mBAAQ,CAAC,cAAc,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAC/B,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,uGAAuG;QAC1H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,mBAAQ,CAAC,eAAe,CACtB,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAC9F,UAAU,CAAC,CAAC;oBACd,IAAI,UAAU,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,MAAM,GAAG,GAAG,UAAU,CAAC,2BAA2B,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAE,CAAC;wBACzH,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;4BAClF,SAAS,EAAE,CAAC;4BACZ,IAAI,SAAS;gCACX,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;4BACtC,IAAI,MAAM;gCACR,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACnB,IAAI,aAAa;gCACf,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;gBACH,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,SAAkB;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,SAAkB,EAAE,IAAa,EAAE,KAAc;QACrE,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAE,CAAC,CAAC;QACnG,IAAI,KAAK,KAAK,SAAS;YACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAS,CAAC,uBAAuB,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAE,CAAC,CAAC;IACxG,CAAC;IACD;;;;;;;;;OASG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAChF,IAAI,SAAS;YACX,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;;;MAUE;IACK,MAAM,CAAC,oBAAoB,CAChC,UAAsC,EAAE,MAA2B;QAEnE,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,6BAAa,CAAC,6BAA6B,CAAC,UAAU,CAAC;YACzD,GAAG,GAAG,6BAAa,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,6DAA6D;QACnG,MAAM,MAAM,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,2DAA4B,CAAC,aAAa,EAAE,CAAC;QAC3D,MAAM,OAAO,GAAG,UAAU,YAAY,mBAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC1F,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;YACjD,IAAI,SAAS,KAAK,uBAAU,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;gBACjE,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,SAAS,KAAK,2DAA4B,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAG,EAAE,MAAM,EAAE,KAAK,CAAC;oBAC1F,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAC1C,CAAC;;AA5wBH,gDAsxBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { IndexedXYZCollectionPolygonOps, PolygonOps } from \"../geometry3d/PolygonOps\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { Polyface, PolyfaceVisitor } from \"../polyface/Polyface\";\r\nimport { PolyfaceQuery } from \"../polyface/PolyfaceQuery\";\r\nimport { ClipPlane, ClipPlaneProps } from \"./ClipPlane\";\r\nimport { Clipper, ClipPlaneContainment, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\r\n\r\n/** Wire format describing a [[ConvexClipPlaneSet]].\r\n * @public\r\n */\r\nexport type ConvexClipPlaneSetProps = ClipPlaneProps[];\r\n\r\n/**\r\n * A ConvexClipPlaneSet is a collection of ClipPlanes, often used for bounding regions of space.\r\n * @public\r\n */\r\nexport class ConvexClipPlaneSet implements Clipper, PolygonClipper {\r\n /** Value acting as \"at infinity\" for coordinates along a ray. */\r\n public static readonly hugeVal = 1e37;\r\n /** Planes that define the convex set. */\r\n private _planes: ClipPlane[];\r\n // private _parity: number; <--- Not yet used\r\n // public get parity() { return this._parity; }\r\n // public set parity(value: number) { this._parity = value; }\r\n private constructor(planes?: ClipPlane[]) {\r\n // this._parity = 1;\r\n this._planes = planes ? planes : [];\r\n }\r\n /** Return the (reference to the) array of `ClipPlane`. */\r\n public get planes(): ClipPlane[] {\r\n return this._planes;\r\n }\r\n /**\r\n * Return an array containing all the planes of the convex set.\r\n * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.\r\n */\r\n public toJSON(): ConvexClipPlaneSetProps {\r\n const val: ClipPlaneProps[] = [];\r\n for (const plane of this._planes)\r\n val.push(plane.toJSON());\r\n return val;\r\n }\r\n /**\r\n * Extract clip planes from a json array `[ clipPlane, clipPlane ]`.\r\n * * Non-clipPlane members are ignored.\r\n */\r\n public static fromJSON(json: ConvexClipPlaneSetProps | undefined, result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n result._planes.length = 0;\r\n if (!Array.isArray(json))\r\n return result;\r\n for (const thisJson of json) {\r\n const plane = ClipPlane.fromJSON(thisJson);\r\n if (plane)\r\n result._planes.push(plane);\r\n }\r\n return result;\r\n }\r\n /**\r\n * Return true if all members are almostEqual to corresponding members of other. This includes identical order in array.\r\n * @param other clip plane to compare\r\n */\r\n public isAlmostEqual(other: ConvexClipPlaneSet): boolean {\r\n if (this._planes.length !== other._planes.length)\r\n return false;\r\n for (let i = 0; i < this._planes.length; i++)\r\n if (!this._planes[i].isAlmostEqual(other._planes[i]))\r\n return false;\r\n return true;\r\n }\r\n /**\r\n * Create ConvexClipPlaneSet from an array of planes.\r\n * * Each plane reference in the `planes` array is taken into the result.\r\n * * The input array itself is NOT taken into the result.\r\n */\r\n public static createPlanes(\r\n planes: (ClipPlane | Plane3dByOriginAndUnitNormal)[], result?: ConvexClipPlaneSet,\r\n ): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n for (const plane of planes) {\r\n if (plane instanceof ClipPlane) {\r\n result._planes.push(plane);\r\n } else if (plane instanceof Plane3dByOriginAndUnitNormal) {\r\n const clipPlane = ClipPlane.createPlane(plane);\r\n result._planes.push(clipPlane);\r\n }\r\n }\r\n return result;\r\n }\r\n /**\r\n * Create new convex set using selected planes of a Range3d.\r\n * @param range range with coordinates\r\n * @param lowX true to clip at the low x plane\r\n * @param highX true to clip at the high x plane\r\n * @param lowY true to clip at the low y plane\r\n * @param highY true to clip at the high z plane\r\n * @param lowZ true to clip at the low z plane\r\n * @param highZ true to clip at the high z plane\r\n */\r\n public static createRange3dPlanes(\r\n range: Range3d,\r\n lowX: boolean = true,\r\n highX: boolean = true,\r\n lowY: boolean = true,\r\n highY: boolean = true,\r\n lowZ: boolean = true,\r\n highZ: boolean = true,\r\n ): ConvexClipPlaneSet {\r\n const result = ConvexClipPlaneSet.createEmpty();\r\n\r\n if (lowX)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(1, 0, 0, range.low.x, 0, 0)!);\r\n if (highX)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(-1, 0, 0, range.high.x, 0, 0)!);\r\n\r\n if (lowY)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 1, 0, 0, range.low.y, 0)!);\r\n if (highY)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, -1, 0, 0, range.high.y, 0)!);\r\n\r\n if (lowZ)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 0, 1, 0, 0, range.low.z)!);\r\n if (highZ)\r\n result.planes.push(ClipPlane.createNormalAndPointXYZXYZ(0, 0, -1, 0, 0, range.high.z)!);\r\n\r\n return result;\r\n }\r\n /** Create an empty `ConvexClipPlaneSet` */\r\n public static createEmpty(result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\r\n if (result) {\r\n result._planes.length = 0;\r\n return result;\r\n }\r\n return new ConvexClipPlaneSet();\r\n }\r\n /** Negate all planes of the set. */\r\n public negateAllPlanes(): void {\r\n for (const plane of this._planes)\r\n plane.negateInPlace();\r\n }\r\n /**\r\n * Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.\r\n * * Note that there is no test for the usual ordering `x0 <= x1` or `y0 <= y1`.\r\n * * if the usual ordering is violated, the convex set is an empty set.\r\n * * More details can be found at docs/learning/geometry/Clipping.md\r\n */\r\n public static createXYBox(\r\n x0: number, y0: number, x1: number, y1: number, result?: ConvexClipPlaneSet,\r\n ): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n result._planes.length = 0;\r\n const clip0 = ClipPlane.createNormalAndDistance(Vector3d.create(-1, 0, 0), -x1, false, true);\r\n const clip1 = ClipPlane.createNormalAndDistance(Vector3d.create(1, 0, 0), x0, false, true);\r\n const clip2 = ClipPlane.createNormalAndDistance(Vector3d.create(0, -1, 0), -y1, false, true);\r\n const clip3 = ClipPlane.createNormalAndDistance(Vector3d.create(0, 1, 0), y0, false, true);\r\n if (clip0 && clip1 && clip2 && clip3) {\r\n result._planes.push(clip0, clip1, clip2, clip3);\r\n }\r\n return result;\r\n }\r\n /**\r\n * Create a convex set containing a half space for each edge between points of a polyline.\r\n * * Caller is responsible for assuring the polyline is convex.\r\n * @param points array of points. Only xy parts are considered.\r\n * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the\r\n * succeeding segment. If this array is not provided, both are false.\r\n * @param leftIsInside if true, the interior is \"to the left\" of the segments. If false, interior is \"to the right\".\r\n */\r\n public static createXYPolyLine(\r\n points: Point3d[], interior: boolean[] | undefined, leftIsInside: boolean, result?: ConvexClipPlaneSet,\r\n ): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n result._planes.length = 0;\r\n for (let i0 = 0; (i0 + 1) < points.length; i0++) {\r\n const edgeVector: Vector3d = Vector3d.createStartEnd(points[i0], points[i0 + 1]);\r\n const perp: Vector3d = edgeVector.unitPerpendicularXY();\r\n perp.z = 0.0;\r\n\r\n if (!leftIsInside)\r\n perp.scaleInPlace(-1.0);\r\n\r\n const perpNormalized = perp.normalize();\r\n if (perpNormalized) {\r\n const flag = interior !== undefined ? interior[i0] : false;\r\n const clip = ClipPlane.createNormalAndPoint(perp, points[i0], flag, flag);\r\n if (clip) {\r\n result._planes.push(clip);\r\n }\r\n }\r\n }\r\n return result;\r\n }\r\n /**\r\n * Create a convexClipPlaneSet with planes whose \"inside\" normal is to the left of each segment.\r\n * @param points array of points.\r\n */\r\n public static createXYPolyLineInsideLeft(points: Point3d[], result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n result._planes.length = 0;\r\n for (let i0 = 0; (i0 + 1) < points.length; i0++) {\r\n const edgeVector: Vector3d = Vector3d.createStartEnd(points[i0], points[i0 + 1]);\r\n const perp: Vector3d = edgeVector.unitPerpendicularXY();\r\n perp.z = 0.0;\r\n\r\n const perpNormalized = perp.normalize();\r\n if (perpNormalized) {\r\n const clip = ClipPlane.createNormalAndPoint(perp, points[i0], false, false);\r\n if (clip) { result._planes.push(clip); }\r\n }\r\n }\r\n return result;\r\n }\r\n /**\r\n * Set (or reset) a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.\r\n * * The planeOfPolygon is (re)initialized with the normal from 3 points, but not otherwise referenced.\r\n * * The ConvexClipPlaneSet is filled with outward normals of the facet edges as viewed to xy plane.\r\n * @param points\r\n * @param result\r\n */\r\n public static setPlaneAndXYLoopCCW(points: GrowableXYZArray, planeOfPolygon: ClipPlane, frustum: ConvexClipPlaneSet) {\r\n const i0 = points.length - 1;\r\n const n = points.length;\r\n let x0 = points.getXAtUncheckedPointIndex(i0);\r\n let y0 = points.getYAtUncheckedPointIndex(i0);\r\n let x1, y1, nx, ny;\r\n frustum._planes.length = 0;\r\n const z0 = points.getZAtUncheckedPointIndex(i0); // z for planes can stay fixed\r\n const planeNormal = points.crossProductIndexIndexIndex(0, 2, 1)!;\r\n ClipPlane.createNormalAndPointXYZXYZ(planeNormal.x, planeNormal.y, planeNormal.z, x0, y0, z0, false, false, planeOfPolygon);\r\n if (planeNormal.normalizeInPlace()) {\r\n for (let i1 = 0; i1 < n; i1++, x0 = x1, y0 = y1) {\r\n x1 = points.getXAtUncheckedPointIndex(i1);\r\n y1 = points.getYAtUncheckedPointIndex(i1);\r\n nx = -(y1 - y0);\r\n ny = x1 - x0;\r\n const clipper = ClipPlane.createNormalAndPointXYZXYZ(nx, ny, 0, x1, y1, z0);\r\n if (clipper)\r\n frustum._planes.push(clipper);\r\n }\r\n }\r\n }\r\n /** Deep clone of all planes. */\r\n public clone(result?: ConvexClipPlaneSet): ConvexClipPlaneSet {\r\n result = result ? result : new ConvexClipPlaneSet();\r\n result._planes.length = 0;\r\n for (const plane of this._planes)\r\n result._planes.push(plane.clone());\r\n return result;\r\n }\r\n /**\r\n * Test if there is any intersection with a ray defined by origin and direction.\r\n * * Optionally record the range (null or otherwise) in caller-allocated result.\r\n * * If the ray is unbounded inside the clip, result can contain positive or negative\r\n * \"Geometry.largeCoordinateResult\" values.\r\n * * If no result is provide, there are no object allocations.\r\n * @param result optional Range1d to receive parameters along the ray.\r\n */\r\n public hasIntersectionWithRay(ray: Ray3d, result?: Range1d, tolerance: number = Geometry.smallMetricDistance): boolean {\r\n // form low and high values in locals that do not require allocation.\r\n // transfer to caller-supplied result at end\r\n let t0 = -Geometry.largeCoordinateResult;\r\n let t1 = Geometry.largeCoordinateResult;\r\n if (result)\r\n result.setNull();\r\n const velocityTolerance = 1.0e-13;\r\n for (const plane of this._planes) {\r\n const vD = plane.velocity(ray.direction);\r\n const vN = plane.altitude(ray.origin);\r\n\r\n if (Math.abs(vD) <= velocityTolerance) {\r\n // Ray is parallel... No need to continue testing if outside halfspace.\r\n if (vN < -tolerance)\r\n return false; // and result is a null range.\r\n } else {\r\n const rayFraction = - vN / vD;\r\n if (vD < 0.0) {\r\n if (rayFraction < t1)\r\n t1 = rayFraction;\r\n } else {\r\n if (rayFraction > t0)\r\n t0 = rayFraction;\r\n }\r\n }\r\n }\r\n if (t1 < t0)\r\n return false; // and result is a null range.\r\n if (result) {\r\n result.extendX(t0);\r\n result.extendX(t1);\r\n }\r\n return true;\r\n }\r\n /**\r\n * Multiply all the ClipPlanes DPoint4d by matrix.\r\n * @param matrix matrix to apply.\r\n * @param invert if true, use in verse of the matrix.\r\n * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\r\n * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect\r\n * on the plane is the inverse transpose of matrixA.\r\n * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\r\n * * Both params default to true to get the full effect of transforming space.\r\n * @param matrix matrix to apply\r\n */\r\n public multiplyPlanesByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\r\n if (invert) { // form inverse once here, reuse for all planes\r\n const inverse = matrix.createInverse();\r\n if (!inverse)\r\n return false;\r\n return this.multiplyPlanesByMatrix4d(inverse, false, transpose);\r\n }\r\n for (const plane of this._planes) {\r\n plane.multiplyPlaneByMatrix4d(matrix, false, transpose);\r\n }\r\n return true;\r\n }\r\n /** Return true if `point` satisfies `point.isPointInside` for all planes */\r\n public isPointInside(point: Point3d): boolean {\r\n for (const plane of this._planes) {\r\n // Defaults to strict inside check. Other clipping classes may use \"on or inside\" check for the \"on\" case\r\n if (!plane.isPointInside(point))\r\n return false;\r\n }\r\n return true;\r\n }\r\n\r\n /** Return true if `point` satisfies `point.isPointOnOrInside` for all planes */\r\n public isPointOnOrInside(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\r\n const interiorTolerance = Math.abs(tolerance); // Interior tolerance should always be positive. (TFS# 246598).\r\n for (const plane of this._planes) {\r\n if (!plane.isPointOnOrInside(point, (plane.interior ? interiorTolerance : tolerance)))\r\n return false;\r\n }\r\n return true;\r\n }\r\n /**\r\n * Test if a sphere is completely inside the convex set.\r\n * @param centerPoint center of sphere\r\n * @param radius radius of sphere.\r\n */\r\n public isSphereInside(centerPoint: Point3d, radius: number): boolean {\r\n const r1 = Math.abs(radius) + Geometry.smallMetricDistance;\r\n for (const plane of this._planes) {\r\n if (!plane.isPointOnOrInside(centerPoint, r1)) {\r\n return false;\r\n }\r\n }\r\n return true;\r\n }\r\n /**\r\n * Find the parts of the line segment (if any) that is within the convex clip volume.\r\n * * The line segment is defined by `pointA` and `pointB`.\r\n * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\r\n * * To clip to the usual bounded line segment, start with fractions (0,1).\r\n * If the clip volume is unbounded, the line interval may also be unbounded.\r\n * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\r\n * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\r\n * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\r\n * @param pointA segment start (fraction 0)\r\n * @param pointB segment end (fraction 1)\r\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\r\n * @returns true if a segment was announced, false if entirely outside.\r\n */\r\n public announceClippedSegmentIntervals(\r\n f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\r\n ): boolean {\r\n let fraction: number | undefined;\r\n if (f1 < f0)\r\n return false;\r\n for (const plane of this._planes) {\r\n const hA = -plane.altitude(pointA);\r\n const hB = -plane.altitude(pointB);\r\n fraction = Geometry.conditionalDivideFraction(-hA, (hB - hA));\r\n if (fraction === undefined) {\r\n // Line parallel to the plane. If positive, it is all OUT\r\n if (hA > 0.0)\r\n return false;\r\n } else if (hB > hA) { // STRICTLY moving outward\r\n if (fraction < f0)\r\n return false;\r\n if (fraction < f1)\r\n f1 = fraction;\r\n } else if (hA > hB) { // STRICTLY moving inward\r\n if (fraction > f1)\r\n return false;\r\n if (fraction > f0)\r\n f0 = fraction;\r\n } else {\r\n // Strictly equal evaluations\r\n if (hA > 0.0)\r\n return false;\r\n }\r\n }\r\n if (f1 >= f0) {\r\n if (announce)\r\n announce(f0, f1);\r\n return true;\r\n }\r\n return false;\r\n }\r\n private static _clipArcFractionArray = new GrowableFloat64Array();\r\n /**\r\n * Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as\r\n * * `announce(fraction, fraction, curve)`\r\n */\r\n public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\r\n const breaks = ConvexClipPlaneSet._clipArcFractionArray;\r\n breaks.clear();\r\n for (const clipPlane of this.planes) {\r\n clipPlane.appendIntersectionRadians(arc, breaks);\r\n }\r\n arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);\r\n return ClipUtilities.selectIntervals01(arc, breaks, this, announce);\r\n }\r\n /**\r\n * Find the parts of the (unbounded) line segment (if any) that is within the convex clip volume.\r\n * @param pointA segment start (fraction 0)\r\n * @param pointB segment end (fraction 1)\r\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\r\n * @returns true if a segment was announced, false if entirely outside.\r\n */\r\n public clipUnboundedSegment(pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber): boolean {\r\n return this.announceClippedSegmentIntervals(-Number.MAX_VALUE, Number.MAX_VALUE, pointA, pointB, announce);\r\n }\r\n /** transform each plane in place. */\r\n public transformInPlace(transform: Transform) {\r\n for (const plane of this._planes) {\r\n plane.transformInPlace(transform);\r\n }\r\n }\r\n /**\r\n * Clip a polygon to the inside of the convex set.\r\n * * Results with 2 or fewer points are ignored.\r\n * * Other than ensuring capacity in the arrays, there are no object allocations during execution of this function.\r\n * @param xyz input points.\r\n * @param work work buffer\r\n * @param tolerance tolerance for \"on plane\" decision.\r\n */\r\n public clipConvexPolygonInPlace(\r\n xyz: GrowableXYZArray, work: GrowableXYZArray, tolerance: number = Geometry.smallMetricDistance,\r\n ): void {\r\n for (const plane of this._planes) {\r\n plane.clipConvexPolygonInPlace(xyz, work, true, tolerance);\r\n if (xyz.length < 3)\r\n return;\r\n }\r\n }\r\n /**\r\n * Clip a convex polygon to (a single) inside part and (possibly many) outside parts.\r\n * @param xyz input polygon.\r\n * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments\r\n * @param arrayCache cache for work arrays.\r\n * @return the surviving inside part (if any)\r\n * @see polygonClip\r\n */\r\n public clipInsidePushOutside(\r\n xyz: IndexedXYZCollection, outsideFragments: GrowableXYZArray[] | undefined, arrayCache: GrowableXYZArrayCache,\r\n ): GrowableXYZArray | undefined {\r\n const perpendicularRange = Range1d.createNull();\r\n let newInside = arrayCache.grabFromCache();\r\n let newOutside = arrayCache.grabFromCache();\r\n let insidePart = arrayCache.grabFromCache(); // this is empty ...\r\n insidePart.pushFrom(xyz);\r\n // While looping through planes . .\r\n // the outside part for the current plane is definitely outside and can be stashed to the final outside\r\n // the inside part for the current plane passes forward to be further split by the remaining planes.\r\n for (const plane of this._planes) {\r\n IndexedXYZCollectionPolygonOps.splitConvexPolygonInsideOutsidePlane(\r\n plane, insidePart, newInside, newOutside, perpendicularRange,\r\n );\r\n if (newOutside.length > 0) {\r\n // the newOutside fragment is definitely outside the ConvexClipPlaneSet\r\n if (outsideFragments) // save the definitely outside part as return data.\r\n ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);\r\n newOutside = arrayCache.grabFromCache();\r\n if (newInside.length < 3) { // ignore inside slivers\r\n insidePart.length = 0;\r\n break;\r\n }\r\n // insideWork is changed ... swap it with insidePart\r\n arrayCache.dropToCache(insidePart);\r\n insidePart = newInside;\r\n newInside = arrayCache.grabFromCache();\r\n } else {\r\n // newOutside is empty => newInside is identical to insidePart. Let insidePart feed through to the next clipper.\r\n }\r\n }\r\n // at break or fall out ...\r\n // ALWAYS drop `newInside` and `newOutside` to the cache\r\n arrayCache.dropToCache(newInside);\r\n arrayCache.dropToCache(newOutside);\r\n // if `insidePart` is alive, return it to caller. Otherwise drop it to cache and return undefined.\r\n if (insidePart.length > 0)\r\n return insidePart;\r\n arrayCache.dropToCache(insidePart);\r\n return undefined;\r\n }\r\n /**\r\n * Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.\r\n * * This has a peculiar expected use case as a very fast pre-filter for more precise clipping.\r\n * * The expected point set is for a polygon.\r\n * * Hence any clipping will eventually have to consider the lines between the points.\r\n * * This method looks for the special case of a single clip plane that has all the points outside.\r\n * * In this case the whole polygon must be outside.\r\n * * Note that this does not detect a polygon that is outside but \"crosses a corner\" -- it is mixed with respect to\r\n * multiple planes.\r\n */\r\n public classifyPointContainment(points: Point3d[], onIsOutside: boolean): ClipPlaneContainment {\r\n let allInside = true;\r\n const onTolerance = onIsOutside ? 1.0e-8 : -1.0e-8;\r\n const interiorTolerance = 1.0e-8; // Interior tolerance should always be positive\r\n\r\n for (const plane of this._planes) {\r\n let nOutside = 0;\r\n for (const point of points) {\r\n if (plane.altitude(point) < (plane.interior ? interiorTolerance : onTolerance)) {\r\n nOutside++;\r\n allInside = false;\r\n }\r\n }\r\n if (nOutside === points.length)\r\n return ClipPlaneContainment.StronglyOutside;\r\n }\r\n return allInside ? ClipPlaneContainment.StronglyInside : ClipPlaneContainment.Ambiguous;\r\n }\r\n /**\r\n * * Create a convex clip set for a polygon swept with possible tilt angle.\r\n * * planes are constructed by ClipPlane.createEdgeAndUpVector, using successive points from the array.\r\n * * If the first and last points match, the polygon area is checked. If the area is negative, points are used in\r\n * reverse order.\r\n * * If first and last points do not match, points are used in order given\r\n * @param points polygon points. (Closure point optional)\r\n * @param upVector primary sweep direction, as applied by ClipPlane.createEdgeAndUpVector\r\n * @param tiltAngle angle to tilt sweep planes away from the sweep direction.\r\n */\r\n public static createSweptPolyline(\r\n points: Point3d[], upVector: Vector3d, tiltAngle?: Angle,\r\n ): ConvexClipPlaneSet | undefined {\r\n const result = ConvexClipPlaneSet.createEmpty();\r\n let reverse = false;\r\n if (points.length > 3 && points[0].isAlmostEqual(points[points.length - 1])) {\r\n const polygonNormal: Vector3d = PolygonOps.areaNormal(points);\r\n const normalDot = polygonNormal.dotProduct(upVector);\r\n if (normalDot > 0.0)\r\n reverse = true;\r\n }\r\n for (let i = 0; (i + 1) < points.length; i++) {\r\n if (reverse) {\r\n const toAdd = ClipPlane.createEdgeAndUpVector(points[i + 1], points[i], upVector, tiltAngle);\r\n if (toAdd) { // clipPlane creation could result in undefined\r\n result.addPlaneToConvexSet(toAdd);\r\n } else {\r\n return undefined;\r\n }\r\n } else {\r\n const toAdd = ClipPlane.createEdgeAndUpVector(points[i], points[i + 1], upVector, tiltAngle);\r\n if (toAdd) { // clipPlane creation could result in undefined\r\n result.addPlaneToConvexSet(toAdd);\r\n } else {\r\n return undefined;\r\n }\r\n }\r\n }\r\n return result;\r\n }\r\n /**\r\n * Add a plane to the convex set.\r\n * @param plane plane to add\r\n */\r\n public addPlaneToConvexSet(plane: ClipPlane | Plane3dByOriginAndUnitNormal | undefined) {\r\n if (plane instanceof ClipPlane)\r\n this._planes.push(plane);\r\n else if (plane instanceof Plane3dByOriginAndUnitNormal)\r\n this._planes.push(ClipPlane.createPlane(plane));\r\n }\r\n /**\r\n * Test many points. Distribute them to arrays depending on in/out result.\r\n * @param points points to test\r\n * @param inOrOn points that are in or on the set\r\n * @param out points that are out.\r\n */\r\n public clipPointsOnOrInside(points: Point3d[], inOrOn: Point3d[], out: Point3d[]) {\r\n inOrOn.length = 0;\r\n out.length = 0;\r\n for (const xyz of points) {\r\n if (this.isPointOnOrInside(xyz, 0.0)) {\r\n inOrOn.push(xyz);\r\n } else {\r\n out.push(xyz);\r\n }\r\n }\r\n }\r\n /**\r\n * Clip a polygon to the planes of the clip plane set.\r\n * * For a convex input polygon, the output polygon is also convex.\r\n * * For non-convex input, the output polygon may have double-back edges along plane intersections. This is still a\r\n * valid clip in a parity sense (overlapping regions cancel).\r\n * @param input polygon, usually convex. Unchanged.\r\n * @param output output polygon\r\n * @param work optional work array.\r\n * @param planeToSkip if this plane is found in the convex set, it is NOT applied.\r\n * This is useful when caller knows the polygon lies in one of the instance planes.\r\n * @param tolerance distance tolerance for \"on plane\" decision. Default value is [[Geometry.smallMetricDistance]].\r\n * @see appendPolygonClip\r\n */\r\n public polygonClip(\r\n input: GrowableXYZArray | Point3d[],\r\n output: GrowableXYZArray,\r\n work?: GrowableXYZArray,\r\n planeToSkip?: ClipPlane,\r\n tolerance: number = Geometry.smallMetricDistance,\r\n ): void {\r\n if (input instanceof GrowableXYZArray)\r\n input.clone(output);\r\n else\r\n GrowableXYZArray.create(input, output);\r\n if (!work)\r\n work = new GrowableXYZArray();\r\n for (const plane of this._planes) {\r\n if (planeToSkip === plane)\r\n continue;\r\n if (output.length === 0)\r\n break;\r\n plane.clipConvexPolygonInPlace(output, work, true, tolerance);\r\n }\r\n }\r\n /**\r\n * * Define new planes in this ConvexClipPlaneSet so it clips to the inside of a polygon.\r\n * * always create planes for the swept edges of the polygon\r\n * * optionally (with nonzero sideSelect) create a cap plane using the polygon normal.\r\n * @param points Points of a bounding polygon\r\n * @param sweepDirection direction to sweep.\r\n * @param sideSelect 0 to have no cap polygon, 1 if the sweep vector side is in, -1 if sweep vector side is out.\r\n */\r\n public reloadSweptPolygon(points: Point3d[], sweepDirection: Vector3d, sideSelect: number): number {\r\n this._planes.length = 0;\r\n const n = points.length;\r\n if (n <= 2)\r\n return 0;\r\n\r\n const planeNormal: Vector3d = PolygonOps.areaNormal(points);\r\n const isCCW = sweepDirection.dotProduct(planeNormal) > 0.0;\r\n\r\n const delta = isCCW ? 1 : n - 1;\r\n for (let i = 0; i < n; i++) {\r\n const i1 = (i + delta) % n;\r\n const xyz0: Point3d = points[i];\r\n const xyz1: Point3d = points[i1];\r\n if (xyz0.isAlmostEqual(xyz1))\r\n continue;\r\n const edgeVector: Vector3d = Vector3d.createStartEnd(xyz0, xyz1);\r\n const inwardNormal: Vector3d = Vector3d.createCrossProduct(sweepDirection.x, sweepDirection.y, sweepDirection.z,\r\n edgeVector.x, edgeVector.y, edgeVector.z);\r\n const inwardNormalNormalized = inwardNormal.normalize();\r\n let distance;\r\n if (inwardNormalNormalized) { // should never fail... simply a check due to the format of the normalize function return\r\n distance = inwardNormalNormalized.dotProduct(xyz0);\r\n const clipToAdd = ClipPlane.createNormalAndDistance(inwardNormalNormalized, distance, false, false);\r\n if (clipToAdd) { this._planes.push(clipToAdd); } // clipPlane creation could result in undefined\r\n }\r\n }\r\n if (sideSelect !== 0.0) {\r\n let planeNormalNormalized = planeNormal.normalize();\r\n if (planeNormalNormalized) { // Again.. should never fail\r\n const a = sweepDirection.dotProduct(planeNormalNormalized) * sideSelect;\r\n if (a < 0.0)\r\n planeNormalNormalized = planeNormalNormalized.negate();\r\n const xyz0: Point3d = points[0];\r\n const distance = planeNormalNormalized.dotProduct(xyz0);\r\n const clipToAdd = ClipPlane.createNormalAndDistance(planeNormalNormalized, distance, false, false);\r\n if (clipToAdd) { this._planes.push(clipToAdd); } // clipPlane creation could result in undefined\r\n }\r\n }\r\n return isCCW ? 1 : -1;\r\n }\r\n /**\r\n * Compute intersections among all combinations of 3 planes in the convex set.\r\n * * optionally throw out points that are not in the set.\r\n * * optionally push the points in the caller-supplied point array.\r\n * * optionally extend a caller supplied range.\r\n * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the\r\n * range is the range of the convex set.\r\n * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the\r\n * range is not a representative of the \"range of all points in the set\".\r\n * @param points (optional) array to which computed points are to be added.\r\n * @param rangeToExtend (optional) range to be extended by the computed points\r\n * @param transform (optional) transform to apply to the accepted points.\r\n * @param testContainment if true, test each point to see if it is within the convex set. (send false if confident\r\n * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).\r\n * @returns number of points.\r\n */\r\n public computePlanePlanePlaneIntersections(\r\n points: Point3d[] | undefined,\r\n rangeToExtend: Range3d | undefined,\r\n transform?: Transform,\r\n testContainment: boolean = true,\r\n ): number {\r\n const normalRows = Matrix3d.createIdentity();\r\n const allPlanes = this._planes;\r\n const n = allPlanes.length;\r\n let numPoints = 0; // explicitly count points -- can't wait to end for points.length because it may be an optional output.\r\n for (let i = 0; i < n; i++) {\r\n for (let j = i + 1; j < n; j++)\r\n for (let k = j + 1; k < n; k++) {\r\n Matrix3d.createRowValues(\r\n allPlanes[i].inwardNormalRef.x, allPlanes[i].inwardNormalRef.y, allPlanes[i].inwardNormalRef.z,\r\n allPlanes[j].inwardNormalRef.x, allPlanes[j].inwardNormalRef.y, allPlanes[j].inwardNormalRef.z,\r\n allPlanes[k].inwardNormalRef.x, allPlanes[k].inwardNormalRef.y, allPlanes[k].inwardNormalRef.z,\r\n normalRows);\r\n if (normalRows.computeCachedInverse(false)) {\r\n const xyz = normalRows.multiplyInverseXYZAsPoint3d(allPlanes[i].distance, allPlanes[j].distance, allPlanes[k].distance)!;\r\n if (!testContainment || this.isPointOnOrInside(xyz, Geometry.smallMetricDistance)) {\r\n numPoints++;\r\n if (transform)\r\n transform.multiplyPoint3d(xyz, xyz);\r\n if (points)\r\n points.push(xyz);\r\n if (rangeToExtend)\r\n rangeToExtend.extendPoint(xyz);\r\n }\r\n }\r\n }\r\n }\r\n return numPoints;\r\n }\r\n /**\r\n * Set the `invisible` property on each plane of the convex set.\r\n * @param invisible value to store\r\n */\r\n public setInvisible(invisible: boolean) {\r\n for (const plane of this._planes) {\r\n plane.setInvisible(invisible);\r\n }\r\n }\r\n /**\r\n * Add planes for z-direction clip between low and high z levels.\r\n * @param invisible value to apply to the `invisible` bit for the new planes\r\n * @param zLow low z value. The plane clips out points with z below this.\r\n * @param zHigh high z value. The plane clips out points with z above this.\r\n */\r\n public addZClipPlanes(invisible: boolean, zLow?: number, zHigh?: number) {\r\n if (zLow !== undefined)\r\n this._planes.push(ClipPlane.createNormalAndDistance(Vector3d.create(0, 0, 1), zLow, invisible)!);\r\n if (zHigh !== undefined)\r\n this._planes.push(ClipPlane.createNormalAndDistance(Vector3d.create(0, 0, -1), -zHigh, invisible)!);\r\n }\r\n /**\r\n * Implement appendPolygonClip, as defined in interface PolygonClipper.\r\n * @param xyz convex polygon. This is not changed.\r\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\r\n * the cache. This is NOT cleared.\r\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\r\n * the cache. This is NOT cleared.\r\n * @param arrayCache cache for reusable GrowableXYZArray.\r\n * @see polygonClip\r\n */\r\n public appendPolygonClip(\r\n xyz: IndexedXYZCollection,\r\n insideFragments: GrowableXYZArray[],\r\n outsideFragments: GrowableXYZArray[],\r\n arrayCache: GrowableXYZArrayCache,\r\n ): void {\r\n const newInside = this.clipInsidePushOutside(xyz, outsideFragments, arrayCache);\r\n if (newInside)\r\n insideFragments.push(newInside);\r\n }\r\n /**\r\n * Create a convex clip set from a convex mesh.\r\n * * Create a plane for each facet.\r\n * * Assemble the planes as a single clip plane set.\r\n * * If the facets are closed by edge pairing, use the sign of the computed volume to point the plane normals inward.\r\n * * If the facets are not closed, the facet orientation determines plane orientation.\r\n * * The implication of this is that if the facets are a convex volume, the returned clip plane set is convex.\r\n * @param convexMesh input mesh. For best results, the mesh should be closed and convex.\r\n * @param result optional preallocated result to reuse and return\r\n * @return clipper and volume (zero if mesh is not closed)\r\n */\r\n public static createConvexPolyface(\r\n convexMesh: Polyface | PolyfaceVisitor, result?: ConvexClipPlaneSet,\r\n ): { clipper: ConvexClipPlaneSet, volume: number } {\r\n result = this.createEmpty(result);\r\n let vol = 0;\r\n if (PolyfaceQuery.isPolyfaceClosedByEdgePairing(convexMesh))\r\n vol = PolyfaceQuery.sumTetrahedralVolumes(convexMesh);\r\n const scale = vol > 0.0 ? -1.0 : 1.0; // point clipper normals inward if mesh normals point outward\r\n const normal = Vector3d.create();\r\n const plane = Plane3dByOriginAndUnitNormal.createXYPlane();\r\n const visitor = convexMesh instanceof Polyface ? convexMesh.createVisitor(0) : convexMesh;\r\n visitor.setNumWrap(0);\r\n for (visitor.reset(); visitor.moveToNextFacet();) {\r\n if (undefined !== PolygonOps.areaNormalGo(visitor.point, normal)) {\r\n normal.scaleInPlace(scale);\r\n if (undefined !== Plane3dByOriginAndUnitNormal.create(visitor.point.front()!, normal, plane))\r\n result.addPlaneToConvexSet(plane);\r\n }\r\n }\r\n return { clipper: result, volume: vol };\r\n }\r\n\r\n // FUNCTIONS SKIPPED DUE TO BSPLINES, VU, OR NON-USAGE IN NATIVE CODE----------------------------------------------------------------\r\n\r\n // Uses bsplines... skipping for now:\r\n // public convexAppendIntervalsFromBspline();\r\n\r\n // Uses pushing and clearing from/to a cache and added functionality for arrays. . . skipping for now\r\n // public convexPolygonClipInsideOutside(input: Point3d[], inside: Point3d[], outside: Point3d[], work1: Point3d[], work2: Point3d[],\r\n // clearOutside: boolean, distanceTolerance: number)\r\n}\r\n"]}
@@ -13,6 +13,7 @@ import { GrowableXYZArrayCache } from "../geometry3d/ReusableObjectCache";
13
13
  import { Segment1d } from "../geometry3d/Segment1d";
14
14
  import { Transform } from "../geometry3d/Transform";
15
15
  import { Matrix4d } from "../geometry4d/Matrix4d";
16
+ import { ClipPlane } from "./ClipPlane";
16
17
  import { Clipper, PolygonClipper } from "./ClipUtils";
17
18
  import { ConvexClipPlaneSet, ConvexClipPlaneSetProps } from "./ConvexClipPlaneSet";
18
19
  /**
@@ -85,10 +86,22 @@ export declare class UnionOfConvexClipPlaneSets implements Clipper, PolygonClipp
85
86
  /** Returns 1, 2, or 3 based on whether point is strongly inside, ambiguous, or strongly outside respectively. */
86
87
  classifyPointContainment(points: Point3d[], onIsOutside: boolean): number;
87
88
  /**
88
- * Clip a polygon using this ClipPlaneSet, returning new polygon boundaries. Note that each polygon may lie
89
- * next to the previous, or be disconnected.
89
+ * Clip a polygon to the planes of the clip sets, returning new polygon boundaries.
90
+ * * The output polygons may lie next to each other, or be disconnected.
91
+ * * For a convex input polygon, the output polygon(s) are also convex.
92
+ * * For non-convex input, the output polygon(s) may have double-back edges along plane intersections. This is still a
93
+ * valid clip in a parity sense (overlapping regions cancel).
94
+ * * This method differs from [[appendPolygonClip]] by clipping the same input polygon with each [[ConvexClipPlaneSet]]
95
+ * in the instance, and returning only the inside pieces.
96
+ * @param input polygon, usually convex. Unchanged.
97
+ * @param output output polygon
98
+ * @param work optional work array.
99
+ * @param planeToSkip if this plane is found in the convex set, it is NOT applied.
100
+ * This is useful when caller knows the polygon lies in one of the instance planes.
101
+ * @param tolerance distance tolerance for "on plane" decision. Default value is [[Geometry.smallMetricDistance]].
102
+ * @see appendPolygonClip
90
103
  */
91
- polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray[]): void;
104
+ polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray[], work?: GrowableXYZArray, planeToSkip?: ClipPlane, tolerance?: number): void;
92
105
  /**
93
106
  * Announce clipSegment() for each convexSet in this ClipPlaneSet.
94
107
  * * all clipPlaneSets are inspected.
@@ -137,12 +150,16 @@ export declare class UnionOfConvexClipPlaneSets implements Clipper, PolygonClipp
137
150
  takeConvexSets(source: UnionOfConvexClipPlaneSets): void;
138
151
  /**
139
152
  * Implement appendPolygonClip, as defined in interface PolygonClipper.
153
+ * * This method differs from [[polygonClip]] by clipping the outside fragments resulting from the previous
154
+ * [[ConvexClipPlaneSet]] with the following one, and returning both inside and outside pieces.
155
+ * In this way, it always produces disjoint inside fragments, even if the clippers are not disjoint (uncommon).
140
156
  * @param xyz convex polygon. This is not changed.
141
157
  * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
142
158
  * the cache. This is NOT cleared.
143
159
  * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
144
160
  * the cache. This is NOT cleared.
145
161
  * @param arrayCache cache for reusable GrowableXYZArray.
162
+ * @see polygonClip
146
163
  */
147
164
  appendPolygonClip(xyz: IndexedXYZCollection, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
148
165
  }
@@ -1 +1 @@
1
- {"version":3,"file":"UnionOfConvexClipPlaneSets.d.ts","sourceRoot":"","sources":["../../../src/clipping/UnionOfConvexClipPlaneSets.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,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,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAuC,cAAc,EAAE,MAAM,aAAa,CAAC;AAC3F,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAEnF;;;GAGG;AACH,MAAM,MAAM,+BAA+B,GAAG,uBAAuB,EAAE,CAAC;AAExE;;;;;GAKG;AACH,qBAAa,0BAA2B,YAAW,OAAO,EAAE,cAAc;IACxE,OAAO,CAAC,WAAW,CAAuB;IAC1C,uFAAuF;IACvF,IAAW,UAAU,IAAI,kBAAkB,EAAE,CAE5C;IACD,OAAO;IAGP,0EAA0E;IACnE,MAAM,IAAI,+BAA+B;IAMhD,sEAAsE;WACxD,QAAQ,CACpB,IAAI,EAAE,+BAA+B,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,0BAA0B,GACrF,0BAA0B;IAU7B,6DAA6D;WAC/C,WAAW,CAAC,MAAM,CAAC,EAAE,0BAA0B,GAAG,0BAA0B;IAO1F;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,0BAA0B,GAAG,OAAO;IAQhE,qFAAqF;WACvE,gBAAgB,CAC5B,UAAU,EAAE,kBAAkB,EAAE,EAAE,MAAM,CAAC,EAAE,0BAA0B,GACpE,0BAA0B;IAM7B,0BAA0B;IACnB,KAAK,CAAC,MAAM,CAAC,EAAE,0BAA0B,GAAG,0BAA0B;IAO7E;;;OAGG;IACI,YAAY,CAAC,KAAK,EAAE,kBAAkB,GAAG,SAAS;IAIzD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,YAAY,CAAC,EAAE,OAAO,GAAG,OAAO;IAiB1E;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAQ7C;;;OAGG;IACI,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAOnG;;;OAGG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM;IAOpD,+DAA+D;IACxD,2BAA2B,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO;IASnE,sGAAsG;IAC/F,0BAA0B,CAAC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE;IAOhF,yDAAyD;IAClD,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAK5C,iHAAiH;IAC1G,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,MAAM;IAQhF;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE;IAYlF;;;;;;;;;;OAUG;IACI,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAClH,OAAO;IAQV,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAWtG;;;;;;;;OAQG;IACI,kDAAkD,CACvD,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,aAAa,EAAE,OAAO,GAAG,SAAS,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,eAAe,GAAE,OAAc,GACxH,MAAM;IAOT;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAa7G,iEAAiE;IAC1D,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC,wEAAwE;IACjE,mBAAmB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAY5E,mCAAmC;IAC5B,cAAc,CAAC,MAAM,EAAE,0BAA0B;IAMxD;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;CA2BR"}
1
+ {"version":3,"file":"UnionOfConvexClipPlaneSets.d.ts","sourceRoot":"","sources":["../../../src/clipping/UnionOfConvexClipPlaneSets.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,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,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,OAAO,EAAuC,cAAc,EAAE,MAAM,aAAa,CAAC;AAC3F,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAEnF;;;GAGG;AACH,MAAM,MAAM,+BAA+B,GAAG,uBAAuB,EAAE,CAAC;AAExE;;;;;GAKG;AACH,qBAAa,0BAA2B,YAAW,OAAO,EAAE,cAAc;IACxE,OAAO,CAAC,WAAW,CAAuB;IAC1C,uFAAuF;IACvF,IAAW,UAAU,IAAI,kBAAkB,EAAE,CAE5C;IACD,OAAO;IAGP,0EAA0E;IACnE,MAAM,IAAI,+BAA+B;IAMhD,sEAAsE;WACxD,QAAQ,CACpB,IAAI,EAAE,+BAA+B,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,0BAA0B,GACrF,0BAA0B;IAU7B,6DAA6D;WAC/C,WAAW,CAAC,MAAM,CAAC,EAAE,0BAA0B,GAAG,0BAA0B;IAO1F;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,0BAA0B,GAAG,OAAO;IAQhE,qFAAqF;WACvE,gBAAgB,CAC5B,UAAU,EAAE,kBAAkB,EAAE,EAAE,MAAM,CAAC,EAAE,0BAA0B,GACpE,0BAA0B;IAM7B,0BAA0B;IACnB,KAAK,CAAC,MAAM,CAAC,EAAE,0BAA0B,GAAG,0BAA0B;IAO7E;;;OAGG;IACI,YAAY,CAAC,KAAK,EAAE,kBAAkB,GAAG,SAAS;IAIzD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,YAAY,CAAC,EAAE,OAAO,GAAG,OAAO;IAiB1E;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAQ7C;;;OAGG;IACI,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAOnG;;;OAGG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM;IAOpD,+DAA+D;IACxD,2BAA2B,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO;IASnE,sGAAsG;IAC/F,0BAA0B,CAAC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE;IAOhF,yDAAyD;IAClD,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAK5C,iHAAiH;IAC1G,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,MAAM;IAQhF;;;;;;;;;;;;;;;OAeG;IACI,WAAW,CAChB,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EACnC,MAAM,EAAE,gBAAgB,EAAE,EAC1B,IAAI,CAAC,EAAE,gBAAgB,EACvB,WAAW,CAAC,EAAE,SAAS,EACvB,SAAS,GAAE,MAAqC,GAC/C,IAAI;IAaP;;;;;;;;;;OAUG;IACI,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAClH,OAAO;IAQV,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAWtG;;;;;;;;OAQG;IACI,kDAAkD,CACvD,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,aAAa,EAAE,OAAO,GAAG,SAAS,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,eAAe,GAAE,OAAc,GACxH,MAAM;IAOT;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAa7G,iEAAiE;IAC1D,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC,wEAAwE;IACjE,mBAAmB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAY5E,mCAAmC;IAC5B,cAAc,CAAC,MAAM,EAAE,0BAA0B;IAMxD;;;;;;;;;;;;OAYG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;CA2BR"}
@@ -182,17 +182,30 @@ class UnionOfConvexClipPlaneSets {
182
182
  return ClipUtils_1.ClipPlaneContainment.StronglyOutside;
183
183
  }
184
184
  /**
185
- * Clip a polygon using this ClipPlaneSet, returning new polygon boundaries. Note that each polygon may lie
186
- * next to the previous, or be disconnected.
185
+ * Clip a polygon to the planes of the clip sets, returning new polygon boundaries.
186
+ * * The output polygons may lie next to each other, or be disconnected.
187
+ * * For a convex input polygon, the output polygon(s) are also convex.
188
+ * * For non-convex input, the output polygon(s) may have double-back edges along plane intersections. This is still a
189
+ * valid clip in a parity sense (overlapping regions cancel).
190
+ * * This method differs from [[appendPolygonClip]] by clipping the same input polygon with each [[ConvexClipPlaneSet]]
191
+ * in the instance, and returning only the inside pieces.
192
+ * @param input polygon, usually convex. Unchanged.
193
+ * @param output output polygon
194
+ * @param work optional work array.
195
+ * @param planeToSkip if this plane is found in the convex set, it is NOT applied.
196
+ * This is useful when caller knows the polygon lies in one of the instance planes.
197
+ * @param tolerance distance tolerance for "on plane" decision. Default value is [[Geometry.smallMetricDistance]].
198
+ * @see appendPolygonClip
187
199
  */
188
- polygonClip(input, output) {
200
+ polygonClip(input, output, work, planeToSkip, tolerance = Geometry_1.Geometry.smallMetricDistance) {
189
201
  output.length = 0;
190
202
  if (Array.isArray(input))
191
203
  input = GrowableXYZArray_1.GrowableXYZArray.create(input);
192
- const work = new GrowableXYZArray_1.GrowableXYZArray();
204
+ if (!work)
205
+ work = new GrowableXYZArray_1.GrowableXYZArray();
193
206
  for (const convexSet of this._convexSets) {
194
207
  const convexSetOutput = new GrowableXYZArray_1.GrowableXYZArray();
195
- convexSet.polygonClip(input, convexSetOutput, work);
208
+ convexSet.polygonClip(input, convexSetOutput, work, planeToSkip, tolerance);
196
209
  if (convexSetOutput.length !== 0)
197
210
  output.push(convexSetOutput);
198
211
  }
@@ -300,12 +313,16 @@ class UnionOfConvexClipPlaneSets {
300
313
  }
301
314
  /**
302
315
  * Implement appendPolygonClip, as defined in interface PolygonClipper.
316
+ * * This method differs from [[polygonClip]] by clipping the outside fragments resulting from the previous
317
+ * [[ConvexClipPlaneSet]] with the following one, and returning both inside and outside pieces.
318
+ * In this way, it always produces disjoint inside fragments, even if the clippers are not disjoint (uncommon).
303
319
  * @param xyz convex polygon. This is not changed.
304
320
  * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
305
321
  * the cache. This is NOT cleared.
306
322
  * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
307
323
  * the cache. This is NOT cleared.
308
324
  * @param arrayCache cache for reusable GrowableXYZArray.
325
+ * @see polygonClip
309
326
  */
310
327
  appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
311
328
  const oldOutsideCount = outsideFragments.length;