@math.gl/geometry 5.0.0-alpha.8 → 5.0.0-beta.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 (368) 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 +5867 -16
  153. package/dist/index.cjs.map +3 -3
  154. package/dist/index.d.ts +23 -0
  155. package/dist/index.d.ts.map +1 -1
  156. package/dist/index.js +13 -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 +627 -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 +68 -0
  221. package/dist/polygon/subdivide-triangle-mesh.d.ts.map +1 -0
  222. package/dist/polygon/subdivide-triangle-mesh.js +228 -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/compute-vertex-normals.d.ts +4 -0
  249. package/dist/utils/compute-vertex-normals.d.ts.map +1 -0
  250. package/dist/utils/compute-vertex-normals.js +54 -0
  251. package/dist/utils/compute-vertex-normals.js.map +1 -0
  252. package/dist/utils/constants.d.ts +52 -0
  253. package/dist/utils/constants.d.ts.map +1 -0
  254. package/dist/utils/constants.js +39 -0
  255. package/dist/utils/constants.js.map +1 -0
  256. package/dist/utils/coordinates.d.ts +3 -0
  257. package/dist/utils/coordinates.d.ts.map +1 -0
  258. package/dist/utils/coordinates.js +8 -0
  259. package/dist/utils/coordinates.js.map +1 -0
  260. package/dist/utils/geometry.d.ts +20 -0
  261. package/dist/utils/geometry.d.ts.map +1 -0
  262. package/dist/utils/geometry.js +31 -0
  263. package/dist/utils/geometry.js.map +1 -0
  264. package/dist/utils/gl-type.d.ts +17 -0
  265. package/dist/utils/gl-type.d.ts.map +1 -0
  266. package/dist/utils/gl-type.js +69 -0
  267. package/dist/utils/gl-type.js.map +1 -0
  268. package/dist/utils/index.d.ts +18 -0
  269. package/dist/utils/index.d.ts.map +1 -0
  270. package/dist/utils/index.js +16 -0
  271. package/dist/utils/index.js.map +1 -0
  272. package/dist/utils/interpolate-packed-attributes.d.ts +43 -0
  273. package/dist/utils/interpolate-packed-attributes.d.ts.map +1 -0
  274. package/dist/utils/interpolate-packed-attributes.js +192 -0
  275. package/dist/utils/interpolate-packed-attributes.js.map +1 -0
  276. package/dist/utils/mesh-processing.d.ts +18 -0
  277. package/dist/utils/mesh-processing.d.ts.map +1 -0
  278. package/dist/utils/mesh-processing.js +300 -0
  279. package/dist/utils/mesh-processing.js.map +1 -0
  280. package/dist/utils/primitive-iterator.d.ts +21 -0
  281. package/dist/utils/primitive-iterator.d.ts.map +1 -0
  282. package/dist/utils/primitive-iterator.js +117 -0
  283. package/dist/utils/primitive-iterator.js.map +1 -0
  284. package/dist/utils/rgb565.d.ts +5 -0
  285. package/dist/utils/rgb565.d.ts.map +1 -0
  286. package/dist/utils/rgb565.js +24 -0
  287. package/dist/utils/rgb565.js.map +1 -0
  288. package/dist/utils/typed-array-utils.d.ts +3 -0
  289. package/dist/utils/typed-array-utils.d.ts.map +1 -0
  290. package/dist/utils/typed-array-utils.js +16 -0
  291. package/dist/utils/typed-array-utils.js.map +1 -0
  292. package/package.json +12 -4
  293. package/src/culling/constants.ts +6 -0
  294. package/src/culling/index.ts +55 -0
  295. package/src/culling/lib/algorithms/bounding-box-from-points.ts +174 -0
  296. package/src/culling/lib/algorithms/bounding-sphere-from-points.ts +175 -0
  297. package/src/culling/lib/algorithms/compute-eigen-decomposition.ts +171 -0
  298. package/src/culling/lib/algorithms/oriented-bounding-box-quaternion.ts +32 -0
  299. package/src/culling/lib/bounding-volumes/axis-aligned-bounding-box.ts +153 -0
  300. package/src/culling/lib/bounding-volumes/bounding-sphere.ts +154 -0
  301. package/src/culling/lib/bounding-volumes/bounding-volume.ts +38 -0
  302. package/src/culling/lib/bounding-volumes/oriented-bounding-box.ts +320 -0
  303. package/src/culling/lib/culling-volume.ts +163 -0
  304. package/src/culling/lib/perspective-frustum.ts +288 -0
  305. package/src/culling/lib/perspective-off-center-frustum.ts +381 -0
  306. package/src/culling/lib/plane.ts +118 -0
  307. package/src/culling/lib/ray.ts +33 -0
  308. package/src/culling/lib/shapes/box-shape.ts +78 -0
  309. package/src/culling/lib/shapes/capsule-shape.ts +232 -0
  310. package/src/culling/lib/shapes/cylinder-shape.ts +133 -0
  311. package/src/culling/lib/shapes/implicit-shape.ts +209 -0
  312. package/src/culling/lib/shapes/plane-shape.ts +78 -0
  313. package/src/culling/lib/shapes/sphere-shape.ts +60 -0
  314. package/src/culling/oriented-box-2d.ts +165 -0
  315. package/src/culling/queries.ts +332 -0
  316. package/src/curves/bezier-curves.ts +62 -0
  317. package/src/curves/catmull-rom-curve.ts +89 -0
  318. package/src/curves/curve-arc-length.ts +70 -0
  319. package/src/curves/curve.ts +96 -0
  320. package/src/curves/hermite-curve.ts +34 -0
  321. package/src/curves/index.ts +15 -0
  322. package/src/geometries/box-geometry.ts +1 -1
  323. package/src/geometries/capsule-geometry.ts +1 -1
  324. package/src/geometries/cylinder-geometry.ts +1 -1
  325. package/src/geometries/geometry-helpers.ts +1 -1
  326. package/src/geometries/ico-sphere-geometry.ts +1 -1
  327. package/src/geometries/plane-geometry.ts +1 -1
  328. package/src/geometries/primitive-mesh-builder.ts +84 -0
  329. package/src/geometries/prism-geometry.ts +57 -0
  330. package/src/geometries/ring-geometry.ts +102 -0
  331. package/src/geometries/sphere-geometry.ts +1 -1
  332. package/src/geometries/surface-of-revolution.ts +1 -1
  333. package/src/geometries/truncated-cone-geometry.ts +1 -1
  334. package/src/index.ts +175 -1
  335. package/src/lib/geometry-utils.ts +2 -2
  336. package/src/lib/geometry.ts +2 -2
  337. package/src/lib/hinge-tree.ts +170 -0
  338. package/src/parametric/lathe-geometry.ts +70 -0
  339. package/src/parametric/parametric-geometry.ts +118 -0
  340. package/src/parametric/torus-geometry.ts +118 -0
  341. package/src/parametric.ts +9 -0
  342. package/src/polygon/clip-triangle-mesh.ts +218 -0
  343. package/src/polygon/cut-by-grid.ts +313 -0
  344. package/src/polygon/cut-by-mercator-bounds.ts +204 -0
  345. package/src/polygon/earcut.ts +798 -0
  346. package/src/polygon/index.ts +42 -0
  347. package/src/polygon/lineclip.ts +218 -0
  348. package/src/polygon/polygon-utils.ts +273 -0
  349. package/src/polygon/polygon.ts +105 -0
  350. package/src/polygon/subdivide-polyline.ts +223 -0
  351. package/src/polygon/subdivide-triangle-mesh.ts +322 -0
  352. package/src/polygon/utils.ts +50 -0
  353. package/src/spatial-index/box-index.ts +452 -0
  354. package/src/spatial-index/index.ts +20 -0
  355. package/src/spatial-index/triangle-bvh.ts +345 -0
  356. package/src/utils/attribute-compression.ts +234 -0
  357. package/src/utils/attribute-iterator.ts +28 -0
  358. package/src/utils/compute-vertex-normals.ts +63 -0
  359. package/src/utils/constants.ts +42 -0
  360. package/src/utils/coordinates.ts +8 -0
  361. package/src/utils/geometry.ts +49 -0
  362. package/src/utils/gl-type.ts +87 -0
  363. package/src/utils/index.ts +55 -0
  364. package/src/utils/interpolate-packed-attributes.ts +284 -0
  365. package/src/utils/mesh-processing.ts +377 -0
  366. package/src/utils/primitive-iterator.ts +145 -0
  367. package/src/utils/rgb565.ts +26 -0
  368. package/src/utils/typed-array-utils.ts +16 -0
@@ -0,0 +1,60 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+
5
+ import {
6
+ ImplicitShapeBase,
7
+ solveQuadratic,
8
+ type ImplicitShape,
9
+ type LocalRayIntersection
10
+ } from './implicit-shape';
11
+
12
+ const EPSILON = 1e-6;
13
+
14
+ export type SphereShapeProps = {radius?: number; matrix?: readonly number[]};
15
+
16
+ /** Analytic glTF sphere shape. */
17
+ export class SphereShape extends ImplicitShapeBase {
18
+ readonly type = 'sphere' as const;
19
+ readonly radius: number;
20
+ constructor(props: SphereShapeProps = {}) {
21
+ super(props.matrix);
22
+ this.radius = props.radius ?? 0.5;
23
+ if (!Number.isFinite(this.radius) || this.radius <= 0)
24
+ throw new Error('Sphere radius must be greater than zero');
25
+ }
26
+ clone(): SphereShape {
27
+ return new SphereShape({radius: this.radius, matrix: this.matrix});
28
+ }
29
+ override equals(shape: ImplicitShape): boolean {
30
+ return shape instanceof SphereShape && super.equals(shape) && this.radius === shape.radius;
31
+ }
32
+ containsLocalPoint(point: readonly number[]): boolean {
33
+ return Math.hypot(...point) <= this.radius + EPSILON;
34
+ }
35
+ distanceToLocalPoint(point: readonly number[]): number {
36
+ return Math.max(0, Math.hypot(...point) - this.radius);
37
+ }
38
+ supportLocal(direction: readonly number[]): readonly number[] {
39
+ const length = Math.hypot(...direction);
40
+ return length ? direction.map(value => (value / length) * this.radius) : [this.radius, 0, 0];
41
+ }
42
+ intersectLocalRay(
43
+ origin: readonly number[],
44
+ direction: readonly number[]
45
+ ): LocalRayIntersection | undefined {
46
+ const roots = solveQuadratic(
47
+ dot(direction, direction),
48
+ 2 * dot(origin, direction),
49
+ dot(origin, origin) - this.radius * this.radius
50
+ );
51
+ const distance = roots.find(value => value >= 0);
52
+ if (distance === undefined) return undefined;
53
+ const point = origin.map((value, i) => value + distance * direction[i]);
54
+ return {distance, normal: point.map(value => value / this.radius)};
55
+ }
56
+ }
57
+
58
+ function dot(a: readonly number[], b: readonly number[]): number {
59
+ return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
60
+ }
@@ -0,0 +1,165 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+
5
+ /** A rectangle in a shared two-dimensional Euclidean coordinate space. */
6
+ export type OrientedBox2D = {
7
+ /** Two finite center coordinates; arrays, typed arrays and core vectors are accepted. */
8
+ readonly center: Readonly<ArrayLike<number>>;
9
+ /** Nonnegative half-width and half-height, in the center's coordinate units. */
10
+ readonly halfSize: Readonly<ArrayLike<number>>;
11
+ /** Nonzero finite width-axis direction. Its magnitude does not change the size. */
12
+ readonly direction: Readonly<ArrayLike<number>>;
13
+ };
14
+
15
+ /** Test closed rectangles using their four separating axes, without allocating query objects.
16
+ * Directions are normalized locally; the height axis is the perpendicular of the width axis.
17
+ * Points and line segments (zero half-sizes) are supported. Inputs are never modified.
18
+ * Subtracting centers before projection avoids projecting large translated corner coordinates.
19
+ * @param first First rectangle in the shared coordinate space.
20
+ * @param second Second rectangle in the shared coordinate space.
21
+ * @param epsilon Nonnegative finite separation allowance in coordinate units; default zero.
22
+ * Touching edges/vertices intersect. A gap no larger than epsilon on every tested axis also
23
+ * intersects; this is a SAT allowance, not a Euclidean-distance query.
24
+ * @throws RangeError For invalid vectors, sizes, directions or epsilon.
25
+ */
26
+ export function intersectOrientedBoxes2D(
27
+ first: OrientedBox2D,
28
+ second: OrientedBox2D,
29
+ epsilon = 0
30
+ ): boolean {
31
+ validateBox(first);
32
+ validateBox(second);
33
+ if (!Number.isFinite(epsilon) || epsilon < 0) {
34
+ throw new RangeError('Box separation allowance must be finite and nonnegative');
35
+ }
36
+
37
+ // Scale before normalizing so both huge and subnormal directions remain usable.
38
+ const firstDirectionScale = Math.max(Math.abs(first.direction[0]), Math.abs(first.direction[1]));
39
+ const secondDirectionScale = Math.max(
40
+ Math.abs(second.direction[0]),
41
+ Math.abs(second.direction[1])
42
+ );
43
+ const firstWidthX = first.direction[0] / firstDirectionScale;
44
+ const firstWidthY = first.direction[1] / firstDirectionScale;
45
+ const secondWidthX = second.direction[0] / secondDirectionScale;
46
+ const secondWidthY = second.direction[1] / secondDirectionScale;
47
+ const firstLength = Math.hypot(firstWidthX, firstWidthY);
48
+ const secondLength = Math.hypot(secondWidthX, secondWidthY);
49
+ const firstX = firstWidthX / firstLength;
50
+ const firstY = firstWidthY / firstLength;
51
+ const secondX = secondWidthX / secondLength;
52
+ const secondY = secondWidthY / secondLength;
53
+
54
+ // Clamp unit-axis dot products against rounding slightly above one.
55
+ const cosine = Math.min(1, Math.abs(firstX * secondX + firstY * secondY));
56
+ const sine = Math.min(1, Math.abs(firstX * secondY - firstY * secondX));
57
+ return (
58
+ overlapsOnAxis(
59
+ first,
60
+ second,
61
+ firstX,
62
+ firstY,
63
+ first.halfSize[0],
64
+ second.halfSize[0] * cosine,
65
+ second.halfSize[1] * sine,
66
+ epsilon
67
+ ) &&
68
+ overlapsOnAxis(
69
+ first,
70
+ second,
71
+ -firstY,
72
+ firstX,
73
+ first.halfSize[1],
74
+ second.halfSize[0] * sine,
75
+ second.halfSize[1] * cosine,
76
+ epsilon
77
+ ) &&
78
+ overlapsOnAxis(
79
+ first,
80
+ second,
81
+ secondX,
82
+ secondY,
83
+ second.halfSize[0],
84
+ first.halfSize[0] * cosine,
85
+ first.halfSize[1] * sine,
86
+ epsilon
87
+ ) &&
88
+ overlapsOnAxis(
89
+ first,
90
+ second,
91
+ -secondY,
92
+ secondX,
93
+ second.halfSize[1],
94
+ first.halfSize[0] * sine,
95
+ first.halfSize[1] * cosine,
96
+ epsilon
97
+ )
98
+ );
99
+ }
100
+
101
+ /** Scale each projection independently so an irrelevant huge extent cannot erase a small gap. */
102
+ function overlapsOnAxis(
103
+ first: OrientedBox2D,
104
+ second: OrientedBox2D,
105
+ axisX: number,
106
+ axisY: number,
107
+ ownRadius: number,
108
+ otherWidthRadius: number,
109
+ otherHeightRadius: number,
110
+ epsilon: number
111
+ ): boolean {
112
+ const displacementX = second.center[0] - first.center[0];
113
+ const displacementY = second.center[1] - first.center[1];
114
+ // Keep a representable center difference before multiplying. If subtraction overflows,
115
+ // project the finite centers first; a zero axis component then stays exactly zero.
116
+ const projectionX = Number.isFinite(displacementX)
117
+ ? displacementX * axisX
118
+ : second.center[0] * axisX - first.center[0] * axisX;
119
+ const projectionY = Number.isFinite(displacementY)
120
+ ? displacementY * axisY
121
+ : second.center[1] * axisY - first.center[1] * axisY;
122
+ const scale =
123
+ Math.max(
124
+ ownRadius,
125
+ otherWidthRadius,
126
+ otherHeightRadius,
127
+ epsilon,
128
+ Number.isFinite(projectionX)
129
+ ? Math.abs(projectionX)
130
+ : Math.max(Math.abs(first.center[0] * axisX), Math.abs(second.center[0] * axisX)),
131
+ Number.isFinite(projectionY)
132
+ ? Math.abs(projectionY)
133
+ : Math.max(Math.abs(first.center[1] * axisY), Math.abs(second.center[1] * axisY))
134
+ ) || 1;
135
+ const normalizedX = Number.isFinite(projectionX)
136
+ ? projectionX / scale
137
+ : (second.center[0] * axisX) / scale - (first.center[0] * axisX) / scale;
138
+ const normalizedY = Number.isFinite(projectionY)
139
+ ? projectionY / scale
140
+ : (second.center[1] * axisY) / scale - (first.center[1] * axisY) / scale;
141
+ return (
142
+ Math.abs(normalizedX + normalizedY) <=
143
+ ownRadius / scale + otherWidthRadius / scale + otherHeightRadius / scale + epsilon / scale
144
+ );
145
+ }
146
+
147
+ /** Validate structural boxes before entering the scalar query kernel. */
148
+ function validateBox(box: OrientedBox2D): void {
149
+ validateVector(box.center);
150
+ validateVector(box.halfSize);
151
+ validateVector(box.direction);
152
+ if (box.halfSize[0] < 0 || box.halfSize[1] < 0) {
153
+ throw new RangeError('Box half-sizes must be nonnegative');
154
+ }
155
+ if (box.direction[0] === 0 && box.direction[1] === 0) {
156
+ throw new RangeError('Box direction must be nonzero');
157
+ }
158
+ }
159
+
160
+ /** Require exactly two finite components, without copying the vector. */
161
+ function validateVector(vector: Readonly<ArrayLike<number>>): void {
162
+ if (vector.length !== 2 || !Number.isFinite(vector[0]) || !Number.isFinite(vector[1])) {
163
+ throw new RangeError('Box vectors must have exactly two finite components');
164
+ }
165
+ }
@@ -0,0 +1,332 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+
5
+ /** Low-level Euclidean query kernels shared with spatial indexes. */
6
+ export type QueryPoint = Readonly<ArrayLike<number>>;
7
+ export type TriangleRayHit = {t: number; barycentric: [number, number, number]};
8
+ export type SegmentClosestPoints = {
9
+ distance: number;
10
+ pointA: [number, number, number];
11
+ pointB: [number, number, number];
12
+ fractionA: number;
13
+ fractionB: number;
14
+ };
15
+ export type SegmentTriangleClosestPoints = {
16
+ distance: number;
17
+ segmentPoint: [number, number, number];
18
+ trianglePoint: [number, number, number];
19
+ /** Parameter on the input segment, not a time of impact. */
20
+ segmentFraction: number;
21
+ };
22
+
23
+ export function validateQueryPoint(point: QueryPoint, dimension: number): void {
24
+ if (point.length !== dimension) throw new RangeError('Query dimension must match the index');
25
+ for (let i = 0; i < dimension; i++) {
26
+ if (!Number.isFinite(point[i])) throw new RangeError('Coordinates must be finite');
27
+ }
28
+ }
29
+
30
+ export function validateQueryDistance(distance: number): void {
31
+ if (Number.isNaN(distance) || distance < 0) throw new RangeError('Distance must be nonnegative');
32
+ }
33
+
34
+ /** Returns a unit direction; ray distances in indexes are always coordinate units. */
35
+ export function normalizeQueryDirection(direction: QueryPoint, dimension: number): number[] {
36
+ validateQueryPoint(direction, dimension);
37
+ const scale = Math.max(...Array.from(direction, Math.abs));
38
+ if (scale === 0) throw new RangeError('Ray direction must be nonzero');
39
+ const scaled = Array.from(direction, x => x / scale);
40
+ const length = Math.hypot(...scaled);
41
+ return scaled.map(x => x / length);
42
+ }
43
+
44
+ /** Closed bounds; returns zero for an origin inside. t uses the supplied direction scale. */
45
+ export function intersectRayBounds(
46
+ origin: QueryPoint,
47
+ direction: QueryPoint,
48
+ minimum: QueryPoint,
49
+ maximum: QueryPoint,
50
+ maxT = Infinity
51
+ ): number | null {
52
+ const dimension = origin.length;
53
+ if (dimension !== 2 && dimension !== 3) throw new RangeError('Bounds must be 2D or 3D');
54
+ validateQueryPoint(origin, dimension);
55
+ validateQueryPoint(direction, dimension);
56
+ validateQueryPoint(minimum, dimension);
57
+ validateQueryPoint(maximum, dimension);
58
+ validateQueryDistance(maxT);
59
+ let near = 0,
60
+ far = maxT,
61
+ nonzero = false;
62
+ for (let i = 0; i < dimension; i++) {
63
+ if (minimum[i] > maximum[i]) throw new RangeError('Bounds must be ordered');
64
+ nonzero ||= direction[i] !== 0;
65
+ }
66
+ if (!nonzero) throw new RangeError('Ray direction must be nonzero');
67
+ for (let i = 0; i < dimension; i++) {
68
+ if (direction[i] === 0) {
69
+ if (origin[i] < minimum[i] || origin[i] > maximum[i]) return null;
70
+ continue;
71
+ }
72
+ let a = (minimum[i] - origin[i]) / direction[i];
73
+ let b = (maximum[i] - origin[i]) / direction[i];
74
+ if (a > b) [a, b] = [b, a];
75
+ near = Math.max(near, a);
76
+ far = Math.min(far, b);
77
+ if (near > far) return null;
78
+ }
79
+ return Number.isFinite(near) ? near : null;
80
+ }
81
+
82
+ /** Two-sided Möller–Trumbore test; degenerates and coplanar rays have no hit. */
83
+ export function intersectRayTriangle(
84
+ origin: QueryPoint,
85
+ direction: QueryPoint,
86
+ a: QueryPoint,
87
+ b: QueryPoint,
88
+ c: QueryPoint,
89
+ options: {backfaceCulling?: boolean; maxT?: number} = {}
90
+ ): TriangleRayHit | null {
91
+ for (const point of [origin, direction, a, b, c]) validateQueryPoint(point, 3);
92
+ if (direction[0] === 0 && direction[1] === 0 && direction[2] === 0) {
93
+ throw new RangeError('Ray direction must be nonzero');
94
+ }
95
+ const maxT = options.maxT ?? Infinity;
96
+ validateQueryDistance(maxT);
97
+ const e1 = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
98
+ const e2 = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
99
+ const p = cross(direction, e2);
100
+ const determinant = dot(e1, p);
101
+ if (determinant === 0 || (options.backfaceCulling && determinant < 0)) return null;
102
+ const offset = [origin[0] - a[0], origin[1] - a[1], origin[2] - a[2]];
103
+ const u = dot(offset, p) / determinant;
104
+ if (u < 0 || u > 1) return null;
105
+ const q = cross(offset, e1);
106
+ const v = dot(direction, q) / determinant;
107
+ if (v < 0 || u + v > 1) return null;
108
+ const t = dot(e2, q) / determinant;
109
+ if (!Number.isFinite(t) || t < 0 || t > maxT) return null;
110
+ return {t: Math.max(0, t), barycentric: [1 - u - v, u, v]};
111
+ }
112
+
113
+ /** Closest point on a filled triangle; degenerate triangles reduce to segments/points. */
114
+ export function getClosestPointOnTriangle(
115
+ point: QueryPoint,
116
+ a: QueryPoint,
117
+ b: QueryPoint,
118
+ c: QueryPoint
119
+ ): [number, number, number] {
120
+ for (const value of [point, a, b, c]) validateQueryPoint(value, 3);
121
+ const ab = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
122
+ const ac = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
123
+ const ap = [point[0] - a[0], point[1] - a[1], point[2] - a[2]];
124
+ const aa = dot(ab, ab),
125
+ bb = dot(ac, ac),
126
+ cc = dot(ab, ac);
127
+ const denominator = aa * bb - cc * cc;
128
+ if (denominator > 0 && Number.isFinite(denominator)) {
129
+ const u = (bb * dot(ap, ab) - cc * dot(ap, ac)) / denominator;
130
+ const v = (aa * dot(ap, ac) - cc * dot(ap, ab)) / denominator;
131
+ if (u >= 0 && v >= 0 && u + v <= 1) {
132
+ return [
133
+ a[0] + u * ab[0] + v * ac[0],
134
+ a[1] + u * ab[1] + v * ac[1],
135
+ a[2] + u * ab[2] + v * ac[2]
136
+ ];
137
+ }
138
+ }
139
+ let best: [number, number, number] = [a[0], a[1], a[2]];
140
+ let distance = Infinity;
141
+ for (const [start, end] of [
142
+ [a, b],
143
+ [b, c],
144
+ [c, a]
145
+ ]) {
146
+ const edge = [end[0] - start[0], end[1] - start[1], end[2] - start[2]];
147
+ const offset = [point[0] - start[0], point[1] - start[1], point[2] - start[2]];
148
+ const squared = dot(edge, edge);
149
+ const t = squared > 0 ? Math.max(0, Math.min(1, dot(offset, edge) / squared)) : 0;
150
+ const candidate: [number, number, number] = [
151
+ start[0] + t * edge[0],
152
+ start[1] + t * edge[1],
153
+ start[2] + t * edge[2]
154
+ ];
155
+ const d = Math.hypot(point[0] - candidate[0], point[1] - candidate[1], point[2] - candidate[2]);
156
+ if (d < distance) {
157
+ distance = d;
158
+ best = candidate;
159
+ }
160
+ }
161
+ return best;
162
+ }
163
+
164
+ /** Closest pair on two closed segments; zero-length segments are points.
165
+ * Enumerates endpoint projections and the interior line-line stationary point.
166
+ * Equal computed distances prefer the lowest first-segment parameter, then the second.
167
+ */
168
+ export function getClosestPointsOnSegments(
169
+ a0: QueryPoint,
170
+ a1: QueryPoint,
171
+ b0: QueryPoint,
172
+ b1: QueryPoint
173
+ ): SegmentClosestPoints {
174
+ const frame = queryFrame([a0, a1, b0, b1]);
175
+ const pair = closestSegments(...(frame.points as [number[], number[], number[], number[]]));
176
+ const pointA = interpolatePoint(a0, a1, pair.fractionA);
177
+ const pointB = interpolatePoint(b0, b1, pair.fractionB);
178
+ return {
179
+ distance: finiteDistance(pointA, pointB),
180
+ pointA,
181
+ pointB,
182
+ fractionA: pair.fractionA,
183
+ fractionB: pair.fractionB
184
+ };
185
+ }
186
+
187
+ /** Closest pair on a closed segment and a filled triangle, including coplanar and degenerate cases.
188
+ * Face crossings, endpoint-face minima and all three segment-edge minima are considered.
189
+ * Equal computed distances prefer the lowest segment parameter; other ties use feature order.
190
+ */
191
+ export function getClosestPointsSegmentTriangle(
192
+ start: QueryPoint,
193
+ end: QueryPoint,
194
+ a: QueryPoint,
195
+ b: QueryPoint,
196
+ c: QueryPoint
197
+ ): SegmentTriangleClosestPoints {
198
+ const frame = queryFrame([start, end, a, b, c]);
199
+ const [s, e, va, vb, vc] = frame.points;
200
+ const direction = subtract(e, s);
201
+ if (direction.some(value => value !== 0)) {
202
+ const hit = intersectRayTriangle(s, direction, va, vb, vc, {maxT: 1});
203
+ if (hit) {
204
+ const point = interpolatePoint(start, end, hit.t);
205
+ return {distance: 0, segmentPoint: point, trianglePoint: [...point], segmentFraction: hit.t};
206
+ }
207
+ }
208
+ let best = {distance: Infinity, segmentFraction: 0, trianglePoint: va};
209
+ const consider = (point: QueryPoint, trianglePoint: number[], segmentFraction: number): void => {
210
+ const distance = Math.hypot(...subtract(point, trianglePoint));
211
+ if (
212
+ distance < best.distance ||
213
+ (distance === best.distance && segmentFraction < best.segmentFraction)
214
+ )
215
+ best = {distance, segmentFraction, trianglePoint};
216
+ };
217
+ consider(s, getClosestPointOnTriangle(s, va, vb, vc), 0);
218
+ consider(e, getClosestPointOnTriangle(e, va, vb, vc), 1);
219
+ for (const [v0, v1] of [
220
+ [va, vb],
221
+ [vb, vc],
222
+ [vc, va]
223
+ ]) {
224
+ const pair = closestSegments(s, e, v0, v1);
225
+ consider(
226
+ interpolatePoint(s, e, pair.fractionA),
227
+ interpolatePoint(v0, v1, pair.fractionB),
228
+ pair.fractionA
229
+ );
230
+ }
231
+ // Restore and keep rounded coordinates inside the triangle's closed bounds.
232
+ const trianglePoint = best.trianglePoint.map((value, axis) =>
233
+ Math.max(
234
+ Math.min(a[axis], b[axis], c[axis]),
235
+ Math.min(Math.max(a[axis], b[axis], c[axis]), start[axis] + value * frame.scale)
236
+ )
237
+ ) as [number, number, number];
238
+ if (!trianglePoint.every(Number.isFinite)) throw new RangeError('Closest-point result overflow');
239
+ const segmentPoint = interpolatePoint(start, end, best.segmentFraction);
240
+ return {
241
+ distance: finiteDistance(segmentPoint, trianglePoint),
242
+ segmentPoint,
243
+ trianglePoint,
244
+ segmentFraction: best.segmentFraction
245
+ };
246
+ }
247
+
248
+ /** Translate and uniformly scale before dot/cross products to avoid absolute-scale overflow. */
249
+ function queryFrame(input: QueryPoint[]): {points: number[][]; scale: number} {
250
+ input.forEach(point => validateQueryPoint(point, 3));
251
+ const offsets = input.map(point => subtract(point, input[0]));
252
+ let scale = 0;
253
+ for (const offset of offsets)
254
+ for (const value of offset) {
255
+ if (!Number.isFinite(value)) throw new RangeError('Closest-point coordinate span overflow');
256
+ scale = Math.max(scale, Math.abs(value));
257
+ }
258
+ scale ||= 1;
259
+ return {points: offsets.map(point => point.map(value => value / scale)), scale};
260
+ }
261
+
262
+ function closestSegments(
263
+ a0: QueryPoint,
264
+ a1: QueryPoint,
265
+ b0: QueryPoint,
266
+ b1: QueryPoint
267
+ ): {distance: number; fractionA: number; fractionB: number} {
268
+ const da = subtract(a1, a0),
269
+ db = subtract(b1, b0);
270
+ const lengthA = Math.hypot(...da),
271
+ lengthB = Math.hypot(...db);
272
+ const ua = da.map(value => (lengthA ? value / lengthA : 0));
273
+ const ub = db.map(value => (lengthB ? value / lengthB : 0));
274
+ let best = {distance: Infinity, fractionA: 0, fractionB: 0};
275
+ const consider = (fractionA: number, fractionB: number): void => {
276
+ const distance = Math.hypot(
277
+ ...subtract(interpolatePoint(a0, a1, fractionA), interpolatePoint(b0, b1, fractionB))
278
+ );
279
+ if (
280
+ distance < best.distance ||
281
+ (distance === best.distance &&
282
+ (fractionA < best.fractionA ||
283
+ (fractionA === best.fractionA && fractionB < best.fractionB)))
284
+ )
285
+ best = {distance, fractionA, fractionB};
286
+ };
287
+ for (const t of [0, 1]) {
288
+ consider(t, lengthB ? clampUnit(dot(subtract(t ? a1 : a0, b0), ub) / lengthB) : 0);
289
+ consider(lengthA ? clampUnit(dot(subtract(t ? b1 : b0, a0), ua) / lengthA) : 0, t);
290
+ }
291
+ const normal = cross(ua, ub);
292
+ const sine = Math.hypot(...normal);
293
+ if (sine > 0) {
294
+ const unit = normal.map(value => value / sine);
295
+ const offset = subtract(b0, a0);
296
+ const fractionA = dot(cross(offset, ub), unit) / sine / lengthA;
297
+ const fractionB = dot(cross(offset, ua), unit) / sine / lengthB;
298
+ if (fractionA >= 0 && fractionA <= 1 && fractionB >= 0 && fractionB <= 1)
299
+ consider(fractionA, fractionB);
300
+ }
301
+ return best;
302
+ }
303
+
304
+ function subtract(a: QueryPoint, b: QueryPoint): number[] {
305
+ return [a[0] - b[0], a[1] - b[1], a[2] - b[2]];
306
+ }
307
+
308
+ function interpolatePoint(a: QueryPoint, b: QueryPoint, t: number): [number, number, number] {
309
+ return [0, 1, 2].map(axis =>
310
+ Math.max(
311
+ Math.min(a[axis], b[axis]),
312
+ Math.min(Math.max(a[axis], b[axis]), (1 - t) * a[axis] + t * b[axis])
313
+ )
314
+ ) as [number, number, number];
315
+ }
316
+
317
+ function clampUnit(value: number): number {
318
+ return Math.max(0, Math.min(1, value));
319
+ }
320
+
321
+ function finiteDistance(a: QueryPoint, b: QueryPoint): number {
322
+ const distance = Math.hypot(...subtract(a, b));
323
+ if (!Number.isFinite(distance)) throw new RangeError('Closest-point distance overflow');
324
+ return distance;
325
+ }
326
+
327
+ function dot(a: QueryPoint, b: QueryPoint): number {
328
+ return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
329
+ }
330
+ function cross(a: QueryPoint, b: QueryPoint): number[] {
331
+ return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
332
+ }
@@ -0,0 +1,62 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+
5
+ import type {NumericArray} from '@math.gl/core';
6
+ import {Curve, copyPoints, type CurvePoint} from './curve';
7
+
8
+ abstract class BezierCurve extends Curve {
9
+ private readonly points: number[][];
10
+
11
+ protected constructor(points: readonly CurvePoint[]) {
12
+ const copied = copyPoints(points);
13
+ super(copied[0].length);
14
+ this.points = copied;
15
+ }
16
+
17
+ protected evaluate(t: number, result: NumericArray, derivative: boolean): void {
18
+ const degree = this.points.length - 1;
19
+ // Scalar de Casteljau evaluation avoids temporary vectors and preserves endpoints.
20
+ for (let i = 0; i < this.dimension; i++) {
21
+ let a = this.points[0][i];
22
+ let b = this.points[1][i];
23
+ let c = degree >= 2 ? this.points[2][i] : 0;
24
+ const d = degree === 3 ? this.points[3][i] : 0;
25
+ let order = degree;
26
+ if (derivative) {
27
+ a = degree * (b - a);
28
+ b = degree * (c - b);
29
+ c = degree * (d - c);
30
+ order--;
31
+ }
32
+ if (order === 3) {
33
+ a = (1 - t) * a + t * b;
34
+ b = (1 - t) * b + t * c;
35
+ c = (1 - t) * c + t * d;
36
+ }
37
+ if (order >= 2) {
38
+ a = (1 - t) * a + t * b;
39
+ b = (1 - t) * b + t * c;
40
+ }
41
+ result[i] = order >= 1 ? (1 - t) * a + t * b : a;
42
+ }
43
+ }
44
+ }
45
+
46
+ export class LineCurve extends BezierCurve {
47
+ constructor(start: CurvePoint, end: CurvePoint) {
48
+ super([start, end]);
49
+ }
50
+ }
51
+
52
+ export class QuadraticBezierCurve extends BezierCurve {
53
+ constructor(start: CurvePoint, control: CurvePoint, end: CurvePoint) {
54
+ super([start, control, end]);
55
+ }
56
+ }
57
+
58
+ export class CubicBezierCurve extends BezierCurve {
59
+ constructor(start: CurvePoint, control1: CurvePoint, control2: CurvePoint, end: CurvePoint) {
60
+ super([start, control1, control2, end]);
61
+ }
62
+ }