@math.gl/geometry 5.0.0-alpha.9 → 5.0.0-beta.2

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 (378) hide show
  1. package/LICENSE +97 -49
  2. package/README.md +16 -1
  3. package/THIRD-PARTY-NOTICES.md +18 -0
  4. package/dist/culling/constants.d.ts +3 -0
  5. package/dist/culling/constants.d.ts.map +1 -0
  6. package/dist/culling/constants.js +5 -0
  7. package/dist/culling/constants.js.map +1 -0
  8. package/dist/culling/index.cjs +2124 -0
  9. package/dist/culling/index.cjs.map +6 -0
  10. package/dist/culling/index.d.ts +31 -0
  11. package/dist/culling/index.d.ts.map +1 -0
  12. package/dist/culling/index.js +25 -0
  13. package/dist/culling/index.js.map +1 -0
  14. package/dist/culling/lib/algorithms/bounding-box-from-points.d.ts +15 -0
  15. package/dist/culling/lib/algorithms/bounding-box-from-points.d.ts.map +1 -0
  16. package/dist/culling/lib/algorithms/bounding-box-from-points.js +137 -0
  17. package/dist/culling/lib/algorithms/bounding-box-from-points.js.map +1 -0
  18. package/dist/culling/lib/algorithms/bounding-sphere-from-points.d.ts +14 -0
  19. package/dist/culling/lib/algorithms/bounding-sphere-from-points.d.ts.map +1 -0
  20. package/dist/culling/lib/algorithms/bounding-sphere-from-points.js +146 -0
  21. package/dist/culling/lib/algorithms/bounding-sphere-from-points.js.map +1 -0
  22. package/dist/culling/lib/algorithms/compute-eigen-decomposition.d.ts +37 -0
  23. package/dist/culling/lib/algorithms/compute-eigen-decomposition.d.ts.map +1 -0
  24. package/dist/culling/lib/algorithms/compute-eigen-decomposition.js +137 -0
  25. package/dist/culling/lib/algorithms/compute-eigen-decomposition.js.map +1 -0
  26. package/dist/culling/lib/algorithms/oriented-bounding-box-quaternion.d.ts +7 -0
  27. package/dist/culling/lib/algorithms/oriented-bounding-box-quaternion.d.ts.map +1 -0
  28. package/dist/culling/lib/algorithms/oriented-bounding-box-quaternion.js +26 -0
  29. package/dist/culling/lib/algorithms/oriented-bounding-box-quaternion.js.map +1 -0
  30. package/dist/culling/lib/bounding-volumes/axis-aligned-bounding-box.d.ts +56 -0
  31. package/dist/culling/lib/bounding-volumes/axis-aligned-bounding-box.d.ts.map +1 -0
  32. package/dist/culling/lib/bounding-volumes/axis-aligned-bounding-box.js +116 -0
  33. package/dist/culling/lib/bounding-volumes/axis-aligned-bounding-box.js.map +1 -0
  34. package/dist/culling/lib/bounding-volumes/bounding-sphere.d.ts +40 -0
  35. package/dist/culling/lib/bounding-volumes/bounding-sphere.d.ts.map +1 -0
  36. package/dist/culling/lib/bounding-volumes/bounding-sphere.js +123 -0
  37. package/dist/culling/lib/bounding-volumes/bounding-sphere.js.map +1 -0
  38. package/dist/culling/lib/bounding-volumes/bounding-volume.d.ts +30 -0
  39. package/dist/culling/lib/bounding-volumes/bounding-volume.d.ts.map +1 -0
  40. package/dist/culling/lib/bounding-volumes/bounding-volume.js +7 -0
  41. package/dist/culling/lib/bounding-volumes/bounding-volume.js.map +1 -0
  42. package/dist/culling/lib/bounding-volumes/oriented-bounding-box.d.ts +62 -0
  43. package/dist/culling/lib/bounding-volumes/oriented-bounding-box.d.ts.map +1 -0
  44. package/dist/culling/lib/bounding-volumes/oriented-bounding-box.js +230 -0
  45. package/dist/culling/lib/bounding-volumes/oriented-bounding-box.js.map +1 -0
  46. package/dist/culling/lib/culling-volume.d.ts +46 -0
  47. package/dist/culling/lib/culling-volume.d.ts.map +1 -0
  48. package/dist/culling/lib/culling-volume.js +126 -0
  49. package/dist/culling/lib/culling-volume.js.map +1 -0
  50. package/dist/culling/lib/perspective-frustum.d.ts +153 -0
  51. package/dist/culling/lib/perspective-frustum.d.ts.map +1 -0
  52. package/dist/culling/lib/perspective-frustum.js +191 -0
  53. package/dist/culling/lib/perspective-frustum.js.map +1 -0
  54. package/dist/culling/lib/perspective-off-center-frustum.d.ts +158 -0
  55. package/dist/culling/lib/perspective-off-center-frustum.d.ts.map +1 -0
  56. package/dist/culling/lib/perspective-off-center-frustum.js +276 -0
  57. package/dist/culling/lib/perspective-off-center-frustum.js.map +1 -0
  58. package/dist/culling/lib/plane.d.ts +35 -0
  59. package/dist/culling/lib/plane.d.ts.map +1 -0
  60. package/dist/culling/lib/plane.js +90 -0
  61. package/dist/culling/lib/plane.js.map +1 -0
  62. package/dist/culling/lib/ray.d.ts +13 -0
  63. package/dist/culling/lib/ray.d.ts.map +1 -0
  64. package/dist/culling/lib/ray.js +30 -0
  65. package/dist/culling/lib/ray.js.map +1 -0
  66. package/dist/culling/lib/shapes/box-shape.d.ts +19 -0
  67. package/dist/culling/lib/shapes/box-shape.d.ts.map +1 -0
  68. package/dist/culling/lib/shapes/box-shape.js +69 -0
  69. package/dist/culling/lib/shapes/box-shape.js.map +1 -0
  70. package/dist/culling/lib/shapes/capsule-shape.d.ts +23 -0
  71. package/dist/culling/lib/shapes/capsule-shape.d.ts.map +1 -0
  72. package/dist/culling/lib/shapes/capsule-shape.js +151 -0
  73. package/dist/culling/lib/shapes/capsule-shape.js.map +1 -0
  74. package/dist/culling/lib/shapes/cylinder-shape.d.ts +22 -0
  75. package/dist/culling/lib/shapes/cylinder-shape.d.ts.map +1 -0
  76. package/dist/culling/lib/shapes/cylinder-shape.js +99 -0
  77. package/dist/culling/lib/shapes/cylinder-shape.js.map +1 -0
  78. package/dist/culling/lib/shapes/implicit-shape.d.ts +56 -0
  79. package/dist/culling/lib/shapes/implicit-shape.d.ts.map +1 -0
  80. package/dist/culling/lib/shapes/implicit-shape.js +142 -0
  81. package/dist/culling/lib/shapes/implicit-shape.js.map +1 -0
  82. package/dist/culling/lib/shapes/plane-shape.d.ts +27 -0
  83. package/dist/culling/lib/shapes/plane-shape.d.ts.map +1 -0
  84. package/dist/culling/lib/shapes/plane-shape.js +71 -0
  85. package/dist/culling/lib/shapes/plane-shape.js.map +1 -0
  86. package/dist/culling/lib/shapes/sphere-shape.d.ts +18 -0
  87. package/dist/culling/lib/shapes/sphere-shape.d.ts.map +1 -0
  88. package/dist/culling/lib/shapes/sphere-shape.js +43 -0
  89. package/dist/culling/lib/shapes/sphere-shape.js.map +1 -0
  90. package/dist/culling/oriented-box-2d.d.ts +22 -0
  91. package/dist/culling/oriented-box-2d.d.ts.map +1 -0
  92. package/dist/culling/oriented-box-2d.js +86 -0
  93. package/dist/culling/oriented-box-2d.js.map +1 -0
  94. package/dist/culling/queries.d.ts +44 -0
  95. package/dist/culling/queries.d.ts.map +1 -0
  96. package/dist/culling/queries.js +259 -0
  97. package/dist/culling/queries.js.map +1 -0
  98. package/dist/curves/bezier-curves.d.ts +18 -0
  99. package/dist/curves/bezier-curves.d.ts.map +1 -0
  100. package/dist/curves/bezier-curves.js +54 -0
  101. package/dist/curves/bezier-curves.js.map +1 -0
  102. package/dist/curves/catmull-rom-curve.d.ts +15 -0
  103. package/dist/curves/catmull-rom-curve.d.ts.map +1 -0
  104. package/dist/curves/catmull-rom-curve.js +77 -0
  105. package/dist/curves/catmull-rom-curve.js.map +1 -0
  106. package/dist/curves/curve-arc-length.d.ts +17 -0
  107. package/dist/curves/curve-arc-length.d.ts.map +1 -0
  108. package/dist/curves/curve-arc-length.js +58 -0
  109. package/dist/curves/curve-arc-length.js.map +1 -0
  110. package/dist/curves/curve.d.ts +23 -0
  111. package/dist/curves/curve.d.ts.map +1 -0
  112. package/dist/curves/curve.js +77 -0
  113. package/dist/curves/curve.js.map +1 -0
  114. package/dist/curves/hermite-curve.d.ts +9 -0
  115. package/dist/curves/hermite-curve.d.ts.map +1 -0
  116. package/dist/curves/hermite-curve.js +24 -0
  117. package/dist/curves/hermite-curve.js.map +1 -0
  118. package/dist/curves/index.d.ts +8 -0
  119. package/dist/curves/index.d.ts.map +1 -0
  120. package/dist/curves/index.js +9 -0
  121. package/dist/curves/index.js.map +1 -0
  122. package/dist/geometries/box-geometry.js +1 -1
  123. package/dist/geometries/box-geometry.js.map +1 -1
  124. package/dist/geometries/capsule-geometry.js +1 -1
  125. package/dist/geometries/capsule-geometry.js.map +1 -1
  126. package/dist/geometries/cylinder-geometry.js +1 -1
  127. package/dist/geometries/cylinder-geometry.js.map +1 -1
  128. package/dist/geometries/geometry-helpers.js +1 -1
  129. package/dist/geometries/geometry-helpers.js.map +1 -1
  130. package/dist/geometries/ico-sphere-geometry.js +1 -1
  131. package/dist/geometries/ico-sphere-geometry.js.map +1 -1
  132. package/dist/geometries/plane-geometry.js +1 -1
  133. package/dist/geometries/plane-geometry.js.map +1 -1
  134. package/dist/geometries/primitive-mesh-builder.d.ts +24 -0
  135. package/dist/geometries/primitive-mesh-builder.d.ts.map +1 -0
  136. package/dist/geometries/primitive-mesh-builder.js +74 -0
  137. package/dist/geometries/primitive-mesh-builder.js.map +1 -0
  138. package/dist/geometries/prism-geometry.d.ts +13 -0
  139. package/dist/geometries/prism-geometry.d.ts.map +1 -0
  140. package/dist/geometries/prism-geometry.js +34 -0
  141. package/dist/geometries/prism-geometry.js.map +1 -0
  142. package/dist/geometries/ring-geometry.d.ts +15 -0
  143. package/dist/geometries/ring-geometry.d.ts.map +1 -0
  144. package/dist/geometries/ring-geometry.js +64 -0
  145. package/dist/geometries/ring-geometry.js.map +1 -0
  146. package/dist/geometries/sphere-geometry.js +1 -1
  147. package/dist/geometries/sphere-geometry.js.map +1 -1
  148. package/dist/geometries/surface-of-revolution.js +1 -1
  149. package/dist/geometries/surface-of-revolution.js.map +1 -1
  150. package/dist/geometries/truncated-cone-geometry.js +1 -1
  151. package/dist/geometries/truncated-cone-geometry.js.map +1 -1
  152. package/dist/index.cjs +6105 -16
  153. package/dist/index.cjs.map +3 -3
  154. package/dist/index.d.ts +26 -0
  155. package/dist/index.d.ts.map +1 -1
  156. package/dist/index.js +15 -1
  157. package/dist/index.js.map +1 -1
  158. package/dist/lib/geometry-utils.js +1 -1
  159. package/dist/lib/geometry-utils.js.map +1 -1
  160. package/dist/lib/geometry.d.ts +1 -1
  161. package/dist/lib/geometry.d.ts.map +1 -1
  162. package/dist/lib/geometry.js +1 -1
  163. package/dist/lib/geometry.js.map +1 -1
  164. package/dist/lib/hinge-tree.d.ts +33 -0
  165. package/dist/lib/hinge-tree.d.ts.map +1 -0
  166. package/dist/lib/hinge-tree.js +144 -0
  167. package/dist/lib/hinge-tree.js.map +1 -0
  168. package/dist/parametric/lathe-geometry.d.ts +14 -0
  169. package/dist/parametric/lathe-geometry.d.ts.map +1 -0
  170. package/dist/parametric/lathe-geometry.js +48 -0
  171. package/dist/parametric/lathe-geometry.js.map +1 -0
  172. package/dist/parametric/parametric-geometry.d.ts +20 -0
  173. package/dist/parametric/parametric-geometry.d.ts.map +1 -0
  174. package/dist/parametric/parametric-geometry.js +88 -0
  175. package/dist/parametric/parametric-geometry.js.map +1 -0
  176. package/dist/parametric/torus-geometry.d.ts +19 -0
  177. package/dist/parametric/torus-geometry.d.ts.map +1 -0
  178. package/dist/parametric/torus-geometry.js +89 -0
  179. package/dist/parametric/torus-geometry.js.map +1 -0
  180. package/dist/parametric.d.ts +7 -0
  181. package/dist/parametric.d.ts.map +1 -0
  182. package/dist/parametric.js +7 -0
  183. package/dist/parametric.js.map +1 -0
  184. package/dist/polygon/clip-triangle-mesh.d.ts +41 -0
  185. package/dist/polygon/clip-triangle-mesh.d.ts.map +1 -0
  186. package/dist/polygon/clip-triangle-mesh.js +155 -0
  187. package/dist/polygon/clip-triangle-mesh.js.map +1 -0
  188. package/dist/polygon/cut-by-grid.d.ts +24 -0
  189. package/dist/polygon/cut-by-grid.d.ts.map +1 -0
  190. package/dist/polygon/cut-by-grid.js +221 -0
  191. package/dist/polygon/cut-by-grid.js.map +1 -0
  192. package/dist/polygon/cut-by-mercator-bounds.d.ts +17 -0
  193. package/dist/polygon/cut-by-mercator-bounds.d.ts.map +1 -0
  194. package/dist/polygon/cut-by-mercator-bounds.js +149 -0
  195. package/dist/polygon/cut-by-mercator-bounds.js.map +1 -0
  196. package/dist/polygon/earcut.d.ts +13 -0
  197. package/dist/polygon/earcut.d.ts.map +1 -0
  198. package/dist/polygon/earcut.js +693 -0
  199. package/dist/polygon/earcut.js.map +1 -0
  200. package/dist/polygon/index.d.ts +14 -0
  201. package/dist/polygon/index.d.ts.map +1 -0
  202. package/dist/polygon/index.js +13 -0
  203. package/dist/polygon/index.js.map +1 -0
  204. package/dist/polygon/lineclip.d.ts +31 -0
  205. package/dist/polygon/lineclip.d.ts.map +1 -0
  206. package/dist/polygon/lineclip.js +184 -0
  207. package/dist/polygon/lineclip.js.map +1 -0
  208. package/dist/polygon/polygon-utils.d.ts +103 -0
  209. package/dist/polygon/polygon-utils.d.ts.map +1 -0
  210. package/dist/polygon/polygon-utils.js +155 -0
  211. package/dist/polygon/polygon-utils.js.map +1 -0
  212. package/dist/polygon/polygon.d.ts +41 -0
  213. package/dist/polygon/polygon.d.ts.map +1 -0
  214. package/dist/polygon/polygon.js +76 -0
  215. package/dist/polygon/polygon.js.map +1 -0
  216. package/dist/polygon/subdivide-polyline.d.ts +56 -0
  217. package/dist/polygon/subdivide-polyline.d.ts.map +1 -0
  218. package/dist/polygon/subdivide-polyline.js +141 -0
  219. package/dist/polygon/subdivide-polyline.js.map +1 -0
  220. package/dist/polygon/subdivide-triangle-mesh.d.ts +78 -0
  221. package/dist/polygon/subdivide-triangle-mesh.d.ts.map +1 -0
  222. package/dist/polygon/subdivide-triangle-mesh.js +238 -0
  223. package/dist/polygon/subdivide-triangle-mesh.js.map +1 -0
  224. package/dist/polygon/utils.d.ts +5 -0
  225. package/dist/polygon/utils.d.ts.map +1 -0
  226. package/dist/polygon/utils.js +38 -0
  227. package/dist/polygon/utils.js.map +1 -0
  228. package/dist/spatial-index/box-index.d.ts +86 -0
  229. package/dist/spatial-index/box-index.d.ts.map +1 -0
  230. package/dist/spatial-index/box-index.js +335 -0
  231. package/dist/spatial-index/box-index.js.map +1 -0
  232. package/dist/spatial-index/index.d.ts +7 -0
  233. package/dist/spatial-index/index.d.ts.map +1 -0
  234. package/dist/spatial-index/index.js +6 -0
  235. package/dist/spatial-index/index.js.map +1 -0
  236. package/dist/spatial-index/triangle-bvh.d.ts +74 -0
  237. package/dist/spatial-index/triangle-bvh.d.ts.map +1 -0
  238. package/dist/spatial-index/triangle-bvh.js +221 -0
  239. package/dist/spatial-index/triangle-bvh.js.map +1 -0
  240. package/dist/utils/attribute-compression.d.ts +50 -0
  241. package/dist/utils/attribute-compression.d.ts.map +1 -0
  242. package/dist/utils/attribute-compression.js +186 -0
  243. package/dist/utils/attribute-compression.js.map +1 -0
  244. package/dist/utils/attribute-iterator.d.ts +8 -0
  245. package/dist/utils/attribute-iterator.d.ts.map +1 -0
  246. package/dist/utils/attribute-iterator.js +25 -0
  247. package/dist/utils/attribute-iterator.js.map +1 -0
  248. package/dist/utils/compose-attribute-provenance.d.ts +13 -0
  249. package/dist/utils/compose-attribute-provenance.d.ts.map +1 -0
  250. package/dist/utils/compose-attribute-provenance.js +63 -0
  251. package/dist/utils/compose-attribute-provenance.js.map +1 -0
  252. package/dist/utils/compute-vertex-normals.d.ts +4 -0
  253. package/dist/utils/compute-vertex-normals.d.ts.map +1 -0
  254. package/dist/utils/compute-vertex-normals.js +54 -0
  255. package/dist/utils/compute-vertex-normals.js.map +1 -0
  256. package/dist/utils/constants.d.ts +52 -0
  257. package/dist/utils/constants.d.ts.map +1 -0
  258. package/dist/utils/constants.js +39 -0
  259. package/dist/utils/constants.js.map +1 -0
  260. package/dist/utils/coordinates.d.ts +3 -0
  261. package/dist/utils/coordinates.d.ts.map +1 -0
  262. package/dist/utils/coordinates.js +8 -0
  263. package/dist/utils/coordinates.js.map +1 -0
  264. package/dist/utils/geometry.d.ts +20 -0
  265. package/dist/utils/geometry.d.ts.map +1 -0
  266. package/dist/utils/geometry.js +31 -0
  267. package/dist/utils/geometry.js.map +1 -0
  268. package/dist/utils/gl-type.d.ts +17 -0
  269. package/dist/utils/gl-type.d.ts.map +1 -0
  270. package/dist/utils/gl-type.js +69 -0
  271. package/dist/utils/gl-type.js.map +1 -0
  272. package/dist/utils/index.d.ts +18 -0
  273. package/dist/utils/index.d.ts.map +1 -0
  274. package/dist/utils/index.js +16 -0
  275. package/dist/utils/index.js.map +1 -0
  276. package/dist/utils/interpolate-packed-attributes.d.ts +43 -0
  277. package/dist/utils/interpolate-packed-attributes.d.ts.map +1 -0
  278. package/dist/utils/interpolate-packed-attributes.js +192 -0
  279. package/dist/utils/interpolate-packed-attributes.js.map +1 -0
  280. package/dist/utils/mesh-processing.d.ts +18 -0
  281. package/dist/utils/mesh-processing.d.ts.map +1 -0
  282. package/dist/utils/mesh-processing.js +300 -0
  283. package/dist/utils/mesh-processing.js.map +1 -0
  284. package/dist/utils/primitive-iterator.d.ts +21 -0
  285. package/dist/utils/primitive-iterator.d.ts.map +1 -0
  286. package/dist/utils/primitive-iterator.js +117 -0
  287. package/dist/utils/primitive-iterator.js.map +1 -0
  288. package/dist/utils/qualify-surface-transition.d.ts +21 -0
  289. package/dist/utils/qualify-surface-transition.d.ts.map +1 -0
  290. package/dist/utils/qualify-surface-transition.js +140 -0
  291. package/dist/utils/qualify-surface-transition.js.map +1 -0
  292. package/dist/utils/rgb565.d.ts +5 -0
  293. package/dist/utils/rgb565.d.ts.map +1 -0
  294. package/dist/utils/rgb565.js +24 -0
  295. package/dist/utils/rgb565.js.map +1 -0
  296. package/dist/utils/typed-array-utils.d.ts +3 -0
  297. package/dist/utils/typed-array-utils.d.ts.map +1 -0
  298. package/dist/utils/typed-array-utils.js +16 -0
  299. package/dist/utils/typed-array-utils.js.map +1 -0
  300. package/package.json +12 -4
  301. package/src/culling/constants.ts +6 -0
  302. package/src/culling/index.ts +55 -0
  303. package/src/culling/lib/algorithms/bounding-box-from-points.ts +174 -0
  304. package/src/culling/lib/algorithms/bounding-sphere-from-points.ts +175 -0
  305. package/src/culling/lib/algorithms/compute-eigen-decomposition.ts +171 -0
  306. package/src/culling/lib/algorithms/oriented-bounding-box-quaternion.ts +32 -0
  307. package/src/culling/lib/bounding-volumes/axis-aligned-bounding-box.ts +153 -0
  308. package/src/culling/lib/bounding-volumes/bounding-sphere.ts +154 -0
  309. package/src/culling/lib/bounding-volumes/bounding-volume.ts +38 -0
  310. package/src/culling/lib/bounding-volumes/oriented-bounding-box.ts +320 -0
  311. package/src/culling/lib/culling-volume.ts +163 -0
  312. package/src/culling/lib/perspective-frustum.ts +288 -0
  313. package/src/culling/lib/perspective-off-center-frustum.ts +381 -0
  314. package/src/culling/lib/plane.ts +118 -0
  315. package/src/culling/lib/ray.ts +33 -0
  316. package/src/culling/lib/shapes/box-shape.ts +78 -0
  317. package/src/culling/lib/shapes/capsule-shape.ts +232 -0
  318. package/src/culling/lib/shapes/cylinder-shape.ts +133 -0
  319. package/src/culling/lib/shapes/implicit-shape.ts +209 -0
  320. package/src/culling/lib/shapes/plane-shape.ts +78 -0
  321. package/src/culling/lib/shapes/sphere-shape.ts +60 -0
  322. package/src/culling/oriented-box-2d.ts +165 -0
  323. package/src/culling/queries.ts +332 -0
  324. package/src/curves/bezier-curves.ts +62 -0
  325. package/src/curves/catmull-rom-curve.ts +89 -0
  326. package/src/curves/curve-arc-length.ts +70 -0
  327. package/src/curves/curve.ts +96 -0
  328. package/src/curves/hermite-curve.ts +34 -0
  329. package/src/curves/index.ts +15 -0
  330. package/src/geometries/box-geometry.ts +1 -1
  331. package/src/geometries/capsule-geometry.ts +1 -1
  332. package/src/geometries/cylinder-geometry.ts +1 -1
  333. package/src/geometries/geometry-helpers.ts +1 -1
  334. package/src/geometries/ico-sphere-geometry.ts +1 -1
  335. package/src/geometries/plane-geometry.ts +1 -1
  336. package/src/geometries/primitive-mesh-builder.ts +84 -0
  337. package/src/geometries/prism-geometry.ts +57 -0
  338. package/src/geometries/ring-geometry.ts +102 -0
  339. package/src/geometries/sphere-geometry.ts +1 -1
  340. package/src/geometries/surface-of-revolution.ts +1 -1
  341. package/src/geometries/truncated-cone-geometry.ts +1 -1
  342. package/src/index.ts +179 -1
  343. package/src/lib/geometry-utils.ts +2 -2
  344. package/src/lib/geometry.ts +2 -2
  345. package/src/lib/hinge-tree.ts +170 -0
  346. package/src/parametric/lathe-geometry.ts +70 -0
  347. package/src/parametric/parametric-geometry.ts +118 -0
  348. package/src/parametric/torus-geometry.ts +118 -0
  349. package/src/parametric.ts +9 -0
  350. package/src/polygon/clip-triangle-mesh.ts +218 -0
  351. package/src/polygon/cut-by-grid.ts +313 -0
  352. package/src/polygon/cut-by-mercator-bounds.ts +204 -0
  353. package/src/polygon/earcut.ts +859 -0
  354. package/src/polygon/index.ts +42 -0
  355. package/src/polygon/lineclip.ts +218 -0
  356. package/src/polygon/polygon-utils.ts +273 -0
  357. package/src/polygon/polygon.ts +105 -0
  358. package/src/polygon/subdivide-polyline.ts +223 -0
  359. package/src/polygon/subdivide-triangle-mesh.ts +342 -0
  360. package/src/polygon/utils.ts +50 -0
  361. package/src/spatial-index/box-index.ts +452 -0
  362. package/src/spatial-index/index.ts +20 -0
  363. package/src/spatial-index/triangle-bvh.ts +345 -0
  364. package/src/utils/attribute-compression.ts +234 -0
  365. package/src/utils/attribute-iterator.ts +28 -0
  366. package/src/utils/compose-attribute-provenance.ts +74 -0
  367. package/src/utils/compute-vertex-normals.ts +63 -0
  368. package/src/utils/constants.ts +42 -0
  369. package/src/utils/coordinates.ts +8 -0
  370. package/src/utils/geometry.ts +49 -0
  371. package/src/utils/gl-type.ts +87 -0
  372. package/src/utils/index.ts +55 -0
  373. package/src/utils/interpolate-packed-attributes.ts +284 -0
  374. package/src/utils/mesh-processing.ts +377 -0
  375. package/src/utils/primitive-iterator.ts +145 -0
  376. package/src/utils/qualify-surface-transition.ts +169 -0
  377. package/src/utils/rgb565.ts +26 -0
  378. package/src/utils/typed-array-utils.ts +16 -0
@@ -0,0 +1,175 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT AND Apache-2.0
3
+ // SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
4
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
5
+ // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
6
+
7
+ // This file is derived from the Cesium math library under Apache 2 license
8
+ // See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
9
+
10
+ import {Vector3} from '@math.gl/core';
11
+ import {BoundingSphere} from '../bounding-volumes/bounding-sphere';
12
+
13
+ /* eslint-disable */
14
+ const fromPointsXMin = new Vector3();
15
+ const fromPointsYMin = new Vector3();
16
+ const fromPointsZMin = new Vector3();
17
+ const fromPointsXMax = new Vector3();
18
+ const fromPointsYMax = new Vector3();
19
+ const fromPointsZMax = new Vector3();
20
+ const fromPointsCurrentPos = new Vector3();
21
+ const fromPointsScratch = new Vector3();
22
+ const fromPointsRitterCenter = new Vector3();
23
+ const fromPointsMinBoxPt = new Vector3();
24
+ const fromPointsMaxBoxPt = new Vector3();
25
+ const fromPointsNaiveCenterScratch = new Vector3();
26
+ // const volumeConstant = (4.0 / 3.0) * Math.PI;
27
+
28
+ /**
29
+ * Computes a tight-fitting bounding sphere enclosing a list of 3D Cartesian points.
30
+ *
31
+ * The bounding sphere is computed by running two algorithms, a naive algorithm and
32
+ * Ritter's algorithm. The smaller of the two spheres is used to ensure a tight fit.
33
+ * Bounding sphere computation article http://blogs.agi.com/insight3d/index.php/2008/02/04/a-bounding
34
+ *
35
+ * @param positions An array of points that the bounding sphere will enclose.
36
+ * @param result Optional object onto which to store the result.
37
+ * @returns The modified result parameter or a new `BoundingSphere` instance if not provided.
38
+ */
39
+ export function makeBoundingSphereFromPoints(
40
+ positions: number[][],
41
+ result: BoundingSphere = new BoundingSphere()
42
+ ): BoundingSphere {
43
+ if (!positions || positions.length === 0) {
44
+ return result.fromCenterRadius([0, 0, 0], 0);
45
+ }
46
+
47
+ const currentPos = fromPointsCurrentPos.copy(positions[0]);
48
+
49
+ const xMin = fromPointsXMin.copy(currentPos);
50
+ const yMin = fromPointsYMin.copy(currentPos);
51
+ const zMin = fromPointsZMin.copy(currentPos);
52
+
53
+ const xMax = fromPointsXMax.copy(currentPos);
54
+ const yMax = fromPointsYMax.copy(currentPos);
55
+ const zMax = fromPointsZMax.copy(currentPos);
56
+
57
+ for (const position of positions) {
58
+ currentPos.copy(position);
59
+
60
+ const x = currentPos.x;
61
+ const y = currentPos.y;
62
+ const z = currentPos.z;
63
+
64
+ // Store points containing the the smallest and largest components
65
+ if (x < xMin.x) {
66
+ xMin.copy(currentPos);
67
+ }
68
+
69
+ if (x > xMax.x) {
70
+ xMax.copy(currentPos);
71
+ }
72
+
73
+ if (y < yMin.y) {
74
+ yMin.copy(currentPos);
75
+ }
76
+
77
+ if (y > yMax.y) {
78
+ yMax.copy(currentPos);
79
+ }
80
+
81
+ if (z < zMin.z) {
82
+ zMin.copy(currentPos);
83
+ }
84
+
85
+ if (z > zMax.z) {
86
+ zMax.copy(currentPos);
87
+ }
88
+ }
89
+
90
+ // Compute x-, y-, and z-spans (Squared distances b/n each component's min. and max.).
91
+ const xSpan = fromPointsScratch.copy(xMax).subtract(xMin).magnitudeSquared();
92
+ const ySpan = fromPointsScratch.copy(yMax).subtract(yMin).magnitudeSquared();
93
+ const zSpan = fromPointsScratch.copy(zMax).subtract(zMin).magnitudeSquared();
94
+
95
+ // Set the diameter endpoints to the largest span.
96
+ let diameter1 = xMin;
97
+ let diameter2 = xMax;
98
+ let maxSpan = xSpan;
99
+ if (ySpan > maxSpan) {
100
+ maxSpan = ySpan;
101
+ diameter1 = yMin;
102
+ diameter2 = yMax;
103
+ }
104
+ if (zSpan > maxSpan) {
105
+ maxSpan = zSpan;
106
+ diameter1 = zMin;
107
+ diameter2 = zMax;
108
+ }
109
+
110
+ // Calculate the center of the initial sphere found by Ritter's algorithm
111
+ const ritterCenter = fromPointsRitterCenter;
112
+ ritterCenter.x = (diameter1.x + diameter2.x) * 0.5;
113
+ ritterCenter.y = (diameter1.y + diameter2.y) * 0.5;
114
+ ritterCenter.z = (diameter1.z + diameter2.z) * 0.5;
115
+
116
+ // Calculate the radius of the initial sphere found by Ritter's algorithm
117
+ let radiusSquared = fromPointsScratch.copy(diameter2).subtract(ritterCenter).magnitudeSquared();
118
+ let ritterRadius = Math.sqrt(radiusSquared);
119
+
120
+ // Find the center of the sphere found using the Naive method.
121
+ const minBoxPt = fromPointsMinBoxPt;
122
+ minBoxPt.x = xMin.x;
123
+ minBoxPt.y = yMin.y;
124
+ minBoxPt.z = zMin.z;
125
+
126
+ const maxBoxPt = fromPointsMaxBoxPt;
127
+ maxBoxPt.x = xMax.x;
128
+ maxBoxPt.y = yMax.y;
129
+ maxBoxPt.z = zMax.z;
130
+
131
+ const naiveCenter = fromPointsNaiveCenterScratch
132
+ .copy(minBoxPt)
133
+ .add(maxBoxPt)
134
+ .multiplyByScalar(0.5);
135
+
136
+ // Begin 2nd pass to find naive radius and modify the ritter sphere.
137
+ let naiveRadius = 0;
138
+ for (const position of positions) {
139
+ currentPos.copy(position);
140
+
141
+ // Find the furthest point from the naive center to calculate the naive radius.
142
+ const r = fromPointsScratch.copy(currentPos).subtract(naiveCenter).magnitude();
143
+ if (r > naiveRadius) {
144
+ naiveRadius = r;
145
+ }
146
+
147
+ // Make adjustments to the Ritter Sphere to include all points.
148
+ const oldCenterToPointSquared = fromPointsScratch
149
+ .copy(currentPos)
150
+ .subtract(ritterCenter)
151
+ .magnitudeSquared();
152
+
153
+ if (oldCenterToPointSquared > radiusSquared) {
154
+ const oldCenterToPoint = Math.sqrt(oldCenterToPointSquared);
155
+ // Calculate new radius to include the point that lies outside
156
+ ritterRadius = (ritterRadius + oldCenterToPoint) * 0.5;
157
+ radiusSquared = ritterRadius * ritterRadius;
158
+ // Calculate center of new Ritter sphere
159
+ const oldToNew = oldCenterToPoint - ritterRadius;
160
+ ritterCenter.x = (ritterRadius * ritterCenter.x + oldToNew * currentPos.x) / oldCenterToPoint;
161
+ ritterCenter.y = (ritterRadius * ritterCenter.y + oldToNew * currentPos.y) / oldCenterToPoint;
162
+ ritterCenter.z = (ritterRadius * ritterCenter.z + oldToNew * currentPos.z) / oldCenterToPoint;
163
+ }
164
+ }
165
+
166
+ if (ritterRadius < naiveRadius) {
167
+ ritterCenter.to(result.center);
168
+ result.radius = ritterRadius;
169
+ } else {
170
+ naiveCenter.to(result.center);
171
+ result.radius = naiveRadius;
172
+ }
173
+
174
+ return result;
175
+ }
@@ -0,0 +1,171 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT AND Apache-2.0
3
+ // SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
4
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
5
+ // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
6
+
7
+ // This file is derived from the Cesium math library under Apache 2 license
8
+ // See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
9
+
10
+ import {Matrix3, _MathUtils} from '@math.gl/core';
11
+
12
+ const scratchMatrix = new Matrix3();
13
+ const scratchUnitary = new Matrix3();
14
+ const scratchDiagonal = new Matrix3();
15
+
16
+ const jMatrix = new Matrix3();
17
+ const jMatrixTranspose = new Matrix3();
18
+
19
+ export type EigenDecomposition = {
20
+ unitary: Matrix3;
21
+ diagonal: Matrix3;
22
+ };
23
+
24
+ /**
25
+ * Computes the eigenvectors and eigenvalues of a symmetric matrix.
26
+ *
27
+ * - Returns a diagonal matrix and unitary matrix such that:
28
+ * `matrix = unitary matrix * diagonal matrix * transpose(unitary matrix)`
29
+ * - The values along the diagonal of the diagonal matrix are the eigenvalues. The columns
30
+ * of the unitary matrix are the corresponding eigenvectors.
31
+ * - This routine was created based upon Matrix Computations, 3rd ed., by Golub and Van Loan,
32
+ * section 8.4.3 The Classical Jacobi Algorithm
33
+ *
34
+ * @param matrix The 3x3 matrix to decompose into diagonal and unitary matrix. Expected to be symmetric.
35
+ * @param result Optional object with unitary and diagonal properties which are matrices onto which to store the result.
36
+ * @returns An object with unitary and diagonal properties which are the unitary and diagonal matrices, respectively.
37
+ *
38
+ * @example
39
+ * const a = //... symmetric matrix
40
+ * const result = {
41
+ * unitary : new Matrix3(),
42
+ * diagonal : new Matrix3()
43
+ * };
44
+ * computeEigenDecomposition(a, result);
45
+ *
46
+ * const unitaryTranspose = Matrix3.transpose(result.unitary, new Matrix3());
47
+ * const b = Matrix3.multiply(result.unitary, result.diagonal, new Matrix3());
48
+ * Matrix3.multiply(b, unitaryTranspose, b); // b is now equal to a
49
+ *
50
+ * const lambda = result.diagonal.getColumn(0, new Vector3()).x; // first eigenvalue
51
+ * const v = result.unitary.getColumn(0, new Vector3()); // first eigenvector
52
+ * const c = v.multiplyByScalar(lambda); // equal to v.transformByMatrix3(a)
53
+ */
54
+ export function computeEigenDecomposition(
55
+ matrix: number[],
56
+ // @ts-expect-error accept empty object type
57
+ result: EigenDecomposition = {}
58
+ ): EigenDecomposition {
59
+ const EIGEN_TOLERANCE = _MathUtils.EPSILON20;
60
+ const EIGEN_MAX_SWEEPS = 10;
61
+
62
+ let count = 0;
63
+ let sweep = 0;
64
+
65
+ const unitaryMatrix = scratchUnitary;
66
+ const diagonalMatrix = scratchDiagonal;
67
+
68
+ unitaryMatrix.identity();
69
+ diagonalMatrix.copy(matrix);
70
+
71
+ const epsilon = EIGEN_TOLERANCE * computeFrobeniusNorm(diagonalMatrix);
72
+
73
+ while (sweep < EIGEN_MAX_SWEEPS && offDiagonalFrobeniusNorm(diagonalMatrix) > epsilon) {
74
+ shurDecomposition(diagonalMatrix, jMatrix);
75
+
76
+ jMatrixTranspose.copy(jMatrix).transpose();
77
+
78
+ diagonalMatrix.multiplyRight(jMatrix);
79
+ diagonalMatrix.multiplyLeft(jMatrixTranspose);
80
+ unitaryMatrix.multiplyRight(jMatrix);
81
+
82
+ if (++count > 2) {
83
+ ++sweep;
84
+ count = 0;
85
+ }
86
+ }
87
+
88
+ result.unitary = unitaryMatrix.toTarget(result.unitary);
89
+ result.diagonal = diagonalMatrix.toTarget(result.diagonal);
90
+
91
+ return result;
92
+ }
93
+
94
+ function computeFrobeniusNorm(matrix: Matrix3): number {
95
+ let norm = 0.0;
96
+ for (let i = 0; i < 9; ++i) {
97
+ const temp = matrix[i];
98
+ norm += temp * temp;
99
+ }
100
+ return Math.sqrt(norm);
101
+ }
102
+
103
+ const rowVal = [1, 0, 0];
104
+ const colVal = [2, 2, 1];
105
+
106
+ // Computes the "off-diagonal" Frobenius norm.
107
+ // Assumes matrix is symmetric.
108
+ function offDiagonalFrobeniusNorm(matrix: Matrix3): number {
109
+ let norm = 0.0;
110
+ for (let i = 0; i < 3; ++i) {
111
+ const temp = matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])];
112
+ norm += 2.0 * temp * temp;
113
+ }
114
+ return Math.sqrt(norm);
115
+ }
116
+
117
+ // The routine takes a matrix, which is assumed to be symmetric, and
118
+ // finds the largest off-diagonal term, and then creates
119
+ // a matrix (result) which can be used to help reduce it
120
+ //
121
+ // This routine was created based upon Matrix Computations, 3rd ed., by Golub and Van Loan,
122
+ // section 8.4.2 The 2by2 Symmetric Schur Decomposition.
123
+ //
124
+ // eslint-disable-next-line max-statements
125
+ function shurDecomposition(matrix: Matrix3, result: Matrix3): Matrix3 {
126
+ const tolerance = _MathUtils.EPSILON15;
127
+
128
+ let maxDiagonal = 0.0;
129
+ let rotAxis = 1;
130
+
131
+ // find pivot (rotAxis) based on max diagonal of matrix
132
+ for (let i = 0; i < 3; ++i) {
133
+ const temp = Math.abs(matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])]);
134
+ if (temp > maxDiagonal) {
135
+ rotAxis = i;
136
+ maxDiagonal = temp;
137
+ }
138
+ }
139
+
140
+ const p = rowVal[rotAxis];
141
+ const q = colVal[rotAxis];
142
+
143
+ let c = 1.0;
144
+ let s = 0.0;
145
+
146
+ if (Math.abs(matrix[scratchMatrix.getElementIndex(q, p)]) > tolerance) {
147
+ const qq = matrix[scratchMatrix.getElementIndex(q, q)];
148
+ const pp = matrix[scratchMatrix.getElementIndex(p, p)];
149
+ const qp = matrix[scratchMatrix.getElementIndex(q, p)];
150
+
151
+ const tau = (qq - pp) / 2.0 / qp;
152
+ let t;
153
+
154
+ if (tau < 0.0) {
155
+ t = -1.0 / (-tau + Math.sqrt(1.0 + tau * tau));
156
+ } else {
157
+ t = 1.0 / (tau + Math.sqrt(1.0 + tau * tau));
158
+ }
159
+
160
+ c = 1.0 / Math.sqrt(1.0 + t * t);
161
+ s = t * c;
162
+ }
163
+
164
+ // Copy into result
165
+ Matrix3.IDENTITY.to(result);
166
+ result[scratchMatrix.getElementIndex(p, p)] = result[scratchMatrix.getElementIndex(q, q)] = c;
167
+ result[scratchMatrix.getElementIndex(q, p)] = s;
168
+ result[scratchMatrix.getElementIndex(p, q)] = -s;
169
+
170
+ return result;
171
+ }
@@ -0,0 +1,32 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT AND Apache-2.0
3
+ // SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
4
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
5
+ // SPDX-FileComment: Extracted Cesium-derived OBB quaternion operations; see ../../../../LICENSE for attribution.
6
+
7
+ import {Matrix3, Quaternion, Vector3} from '@math.gl/core';
8
+ import {OrientedBoundingBox} from '../bounding-volumes/oriented-bounding-box';
9
+
10
+ /** Return the orientation of a box, excluding the scale of its half axes. */
11
+ export function getOrientedBoundingBoxQuaternion(box: OrientedBoundingBox): Quaternion {
12
+ const x = new Vector3(box.halfAxes.getColumn(0)).normalize();
13
+ const y = new Vector3(box.halfAxes.getColumn(1)).normalize();
14
+ const z = new Vector3(box.halfAxes.getColumn(2)).normalize();
15
+ return new Quaternion().fromMatrix3(new Matrix3([...x, ...y, ...z]));
16
+ }
17
+
18
+ /** Construct a box from its center, half sizes and quaternion, optionally reusing a box. */
19
+ export function makeOrientedBoundingBoxFromQuaternion(
20
+ center: readonly number[],
21
+ halfSize: readonly number[],
22
+ quaternion: readonly number[],
23
+ result = new OrientedBoundingBox()
24
+ ): OrientedBoundingBox {
25
+ const halfAxes = new Matrix3().fromQuaternion(quaternion);
26
+ for (let column = 0; column < 3; column++) {
27
+ for (let row = 0; row < 3; row++) halfAxes[column * 3 + row] *= halfSize[column];
28
+ }
29
+ result.center = new Vector3(center);
30
+ result.halfAxes = halfAxes;
31
+ return result;
32
+ }
@@ -0,0 +1,153 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT AND Apache-2.0
3
+ // SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
4
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
5
+ // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
6
+
7
+ import {BoundingVolume} from './bounding-volume';
8
+ import {Vector3} from '@math.gl/core';
9
+ import {Plane} from '../plane';
10
+ import type {CullingResult} from '../../constants';
11
+
12
+ const scratchVector = new Vector3();
13
+ const scratchNormal = new Vector3();
14
+
15
+ /**
16
+ * An axis aligned bounding box - aligned with coordinate axes
17
+ * @see BoundingVolume
18
+ * @see BoundingRectangle
19
+ * @see OrientedBoundingBox
20
+ */
21
+ export class AxisAlignedBoundingBox implements BoundingVolume {
22
+ /** The center point of the bounding box. */
23
+ readonly center: Vector3;
24
+ /** The positive half diagonal of the bounding box. */
25
+ readonly halfDiagonal: Vector3;
26
+ /** The minimum point defining the bounding box. [0, 0, 0] for empty box */
27
+ readonly minimum: Vector3;
28
+ /** The maximum point defining the bounding box. [0, 0, 0] for empty box */
29
+ readonly maximum: Vector3;
30
+
31
+ /**
32
+ * Creates an instance of an AxisAlignedBoundingBox from the minimum and maximum points along the x, y, and z axes.
33
+ * @param minimum=[0, 0, 0] The minimum point along the x, y, and z axes.
34
+ * @param maximum=[0, 0, 0] The maximum point along the x, y, and z axes.
35
+ * @param center The center of the box; automatically computed if not supplied.
36
+ */
37
+ constructor(
38
+ minimum: readonly number[] = [0, 0, 0],
39
+ maximum: readonly number[] = [0, 0, 0],
40
+ center?: readonly number[]
41
+ ) {
42
+ // If center was not defined, compute it.
43
+ center = center || scratchVector.copy(minimum).add(maximum).scale(0.5);
44
+ this.center = new Vector3(center);
45
+ this.halfDiagonal = new Vector3(maximum).subtract(this.center);
46
+
47
+ /**
48
+ * The minimum point defining the bounding box.
49
+ * @type {Vector3}
50
+ * @default {@link 0, 0, 0}
51
+ */
52
+ this.minimum = new Vector3(minimum);
53
+
54
+ /**
55
+ * The maximum point defining the bounding box.
56
+ * @type {Vector3}
57
+ * @default {@link 0, 0, 0}
58
+ */
59
+ this.maximum = new Vector3(maximum);
60
+ }
61
+
62
+ /**
63
+ * Duplicates a AxisAlignedBoundingBox instance.
64
+ *
65
+ * @returns {AxisAlignedBoundingBox} A new AxisAlignedBoundingBox instance.
66
+ */
67
+ clone(): AxisAlignedBoundingBox {
68
+ return new AxisAlignedBoundingBox(this.minimum, this.maximum, this.center);
69
+ }
70
+
71
+ /**
72
+ * Compares the provided AxisAlignedBoundingBox componentwise and returns
73
+ * <code>true</code> if they are equal, <code>false</code> otherwise.
74
+ *
75
+ * @param {AxisAlignedBoundingBox} [right] The second AxisAlignedBoundingBox to compare with.
76
+ * @returns {Boolean} <code>true</code> if left and right are equal, <code>false</code> otherwise.
77
+ */
78
+ equals(right: AxisAlignedBoundingBox): boolean {
79
+ return (
80
+ this === right ||
81
+ (Boolean(right) && this.minimum.equals(right.minimum) && this.maximum.equals(right.maximum))
82
+ );
83
+ }
84
+
85
+ /**
86
+ * Applies a 4x4 affine transformation matrix to a bounding sphere.
87
+ * @param transform The transformation matrix to apply to the bounding sphere.
88
+ * @returns itself, i.e. the modified BoundingVolume.
89
+ */
90
+ transform(transform: readonly number[]): this {
91
+ this.center.transformAsPoint(transform);
92
+ // TODO - this.halfDiagonal.transformAsVector(transform);
93
+ this.halfDiagonal.transform(transform);
94
+ this.minimum.transform(transform);
95
+ this.maximum.transform(transform);
96
+ return this;
97
+ }
98
+
99
+ /**
100
+ * Determines which side of a plane a box is located.
101
+ */
102
+ intersectPlane(plane: Plane): CullingResult {
103
+ const {halfDiagonal} = this;
104
+ const normal = scratchNormal.from(plane.normal);
105
+ const e =
106
+ halfDiagonal.x * Math.abs(normal.x) +
107
+ halfDiagonal.y * Math.abs(normal.y) +
108
+ halfDiagonal.z * Math.abs(normal.z);
109
+ const s = this.center.dot(normal) + plane.distance; // signed distance from center
110
+
111
+ if (s - e > 0) {
112
+ return 'inside';
113
+ }
114
+
115
+ if (s + e < 0) {
116
+ // Not in front because normals point inward
117
+ return 'outside';
118
+ }
119
+
120
+ return 'intersecting';
121
+ }
122
+
123
+ /** Computes the estimated distance from the closest point on a bounding box to a point. */
124
+ distanceTo(point: readonly number[]): number {
125
+ return Math.sqrt(this.distanceSquaredTo(point));
126
+ }
127
+
128
+ /** Computes the estimated distance squared from the closest point on a bounding box to a point. */
129
+ distanceSquaredTo(point: readonly number[]): number {
130
+ const offset = scratchVector.from(point).subtract(this.center);
131
+ const {halfDiagonal} = this;
132
+
133
+ let distanceSquared = 0.0;
134
+ let d;
135
+
136
+ d = Math.abs(offset.x) - halfDiagonal.x;
137
+ if (d > 0) {
138
+ distanceSquared += d * d;
139
+ }
140
+
141
+ d = Math.abs(offset.y) - halfDiagonal.y;
142
+ if (d > 0) {
143
+ distanceSquared += d * d;
144
+ }
145
+
146
+ d = Math.abs(offset.z) - halfDiagonal.z;
147
+ if (d > 0) {
148
+ distanceSquared += d * d;
149
+ }
150
+
151
+ return distanceSquared;
152
+ }
153
+ }
@@ -0,0 +1,154 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT AND Apache-2.0
3
+ // SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
4
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
5
+ // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
6
+
7
+ // This file is derived from the Cesium math library under Apache 2 license
8
+ // See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
9
+
10
+ import {NumericArray, Vector3} from '@math.gl/core';
11
+ import {mat4GetScaling} from '@math.gl/core';
12
+
13
+ import type {CullingResult} from '../../constants';
14
+ import {BoundingVolume} from './bounding-volume';
15
+ import {Plane} from '../plane';
16
+
17
+ const scratchVector = new Vector3();
18
+ const scratchVector2 = new Vector3();
19
+
20
+ /** A BoundingSphere */
21
+ export class BoundingSphere implements BoundingVolume {
22
+ center: Vector3;
23
+ radius: number;
24
+
25
+ /** Creates a bounding sphere */
26
+ constructor(center: readonly number[] = [0, 0, 0], radius: number = 0.0) {
27
+ this.radius = -0;
28
+ this.center = new Vector3();
29
+ this.fromCenterRadius(center, radius);
30
+ }
31
+
32
+ /** Sets the bounding sphere from `center` and `radius`. */
33
+ fromCenterRadius(center: readonly number[], radius: number): this {
34
+ this.center.from(center);
35
+ this.radius = radius;
36
+ return this;
37
+ }
38
+
39
+ /**
40
+ * Computes a bounding sphere from the corner points of an axis-aligned bounding box. The sphere
41
+ * tightly and fully encompasses the box.
42
+ */
43
+ fromCornerPoints(corner: readonly number[], oppositeCorner: readonly number[]): this {
44
+ oppositeCorner = scratchVector.from(oppositeCorner);
45
+ this.center = new Vector3().from(corner).add(oppositeCorner).scale(0.5);
46
+ this.radius = this.center.distance(oppositeCorner);
47
+ return this;
48
+ }
49
+
50
+ /** Compares the provided BoundingSphere component wise */
51
+ equals(right: BoundingSphere): boolean {
52
+ return (
53
+ this === right ||
54
+ (Boolean(right) && this.center.equals(right.center) && this.radius === right.radius)
55
+ );
56
+ }
57
+
58
+ /** Duplicates a BoundingSphere instance. */
59
+ clone(): BoundingSphere {
60
+ return new BoundingSphere(this.center, this.radius);
61
+ }
62
+
63
+ /** Computes a bounding sphere that contains both the left and right bounding spheres. */
64
+ union(boundingSphere: BoundingSphere): BoundingSphere {
65
+ const leftCenter = this.center;
66
+ const leftRadius = this.radius;
67
+ const rightCenter = boundingSphere.center;
68
+ const rightRadius = boundingSphere.radius;
69
+
70
+ const toRightCenter = scratchVector.copy(rightCenter).subtract(leftCenter);
71
+ const centerSeparation = toRightCenter.magnitude();
72
+
73
+ if (leftRadius >= centerSeparation + rightRadius) {
74
+ // Left sphere wins.
75
+ return this.clone();
76
+ }
77
+
78
+ if (rightRadius >= centerSeparation + leftRadius) {
79
+ // Right sphere wins.
80
+ return boundingSphere.clone();
81
+ }
82
+
83
+ // There are two tangent points, one on far side of each sphere.
84
+ const halfDistanceBetweenTangentPoints = (leftRadius + centerSeparation + rightRadius) * 0.5;
85
+
86
+ // Compute the center point halfway between the two tangent points.
87
+ scratchVector2
88
+ .copy(toRightCenter)
89
+ .scale((-leftRadius + halfDistanceBetweenTangentPoints) / centerSeparation)
90
+ .add(leftCenter);
91
+
92
+ this.center.copy(scratchVector2);
93
+ this.radius = halfDistanceBetweenTangentPoints;
94
+
95
+ return this;
96
+ }
97
+
98
+ /** Computes a bounding sphere by enlarging the provided sphere to contain the provided point. */
99
+ expand(point: readonly number[]): this {
100
+ const scratchPoint = scratchVector.from(point);
101
+ const radius = scratchPoint.subtract(this.center).magnitude();
102
+ if (radius > this.radius) {
103
+ this.radius = radius;
104
+ }
105
+ return this;
106
+ }
107
+
108
+ // BoundingVolume interface
109
+
110
+ /**
111
+ * Applies a 4x4 affine transformation matrix to a bounding sphere.
112
+ * @param sphere The bounding sphere to apply the transformation to.
113
+ * @param transform The transformation matrix to apply to the bounding sphere.
114
+ * @returns self.
115
+ */
116
+ transform(transform: readonly number[]): this {
117
+ this.center.transform(transform);
118
+ const scale = mat4GetScaling(scratchVector, transform);
119
+ this.radius = Math.max(scale[0], Math.max(scale[1], scale[2])) * this.radius;
120
+ return this;
121
+ }
122
+
123
+ /** Computes the estimated distance squared from the closest point on a bounding sphere to a point. */
124
+ distanceSquaredTo(point: Readonly<NumericArray>): number {
125
+ const d = this.distanceTo(point);
126
+ return d * d;
127
+ }
128
+
129
+ /** Computes the estimated distance from the closest point on a bounding sphere to a point. */
130
+ distanceTo(point: Readonly<NumericArray>): number {
131
+ const scratchPoint = scratchVector.from(point);
132
+ const delta = scratchPoint.subtract(this.center);
133
+ return Math.max(0, delta.len() - this.radius);
134
+ }
135
+
136
+ /** Determines which side of a plane a sphere is located. */
137
+ intersectPlane(plane: Plane): CullingResult {
138
+ const center = this.center;
139
+ const radius = this.radius;
140
+ const normal = plane.normal;
141
+ const distanceToPlane = normal.dot(center) + plane.distance;
142
+
143
+ // The center point is negative side of the plane normal
144
+ if (distanceToPlane < -radius) {
145
+ return 'outside';
146
+ }
147
+ // The center point is positive side of the plane, but radius extends beyond it; partial overlap
148
+ if (distanceToPlane < radius) {
149
+ return 'intersecting';
150
+ }
151
+ // The center point and radius is positive side of the plane
152
+ return 'inside';
153
+ }
154
+ }