@math.gl/geometry 5.0.0-alpha.9 → 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,38 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+ export function push(target, source) {
5
+ const size = source.length;
6
+ const startIndex = target.length;
7
+ // dedupe, if source is the same point as the last vertex
8
+ if (startIndex > 0) {
9
+ let isDuplicate = true;
10
+ for (let i = 0; i < size; i++) {
11
+ if (target[startIndex - size + i] !== source[i]) {
12
+ isDuplicate = false;
13
+ break;
14
+ }
15
+ }
16
+ if (isDuplicate) {
17
+ return false;
18
+ }
19
+ }
20
+ for (let i = 0; i < size; i++) {
21
+ target[startIndex + i] = source[i];
22
+ }
23
+ return true;
24
+ }
25
+ export function copy(target, source) {
26
+ const size = source.length;
27
+ for (let i = 0; i < size; i++) {
28
+ target[i] = source[i];
29
+ }
30
+ }
31
+ export function getPointAtIndex(positions, index, size, offset, out = []) {
32
+ const startI = offset + index * size;
33
+ for (let i = 0; i < size; i++) {
34
+ out[i] = positions[startI + i];
35
+ }
36
+ return out;
37
+ }
38
+ //# sourceMappingURL=utils.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/polygon/utils.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAI5D,MAAM,UAAU,IAAI,CAAC,MAAgB,EAAE,MAAgB;IACrD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC;IAEjC,yDAAyD;IACzD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,IAAI,WAAW,GAAG,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,MAAM,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChD,WAAW,GAAG,KAAK,CAAC;gBACpB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,IAAI,CAAC,MAAgB,EAAE,MAA8B;IACnE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,SAAiC,EACjC,KAAa,EACb,IAAY,EACZ,MAAc,EACd,MAAgB,EAAE;IAElB,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}
@@ -0,0 +1,86 @@
1
+ import { type QueryPoint } from "../culling/queries.js";
2
+ export type BoxIndexOptions = {
3
+ /** Flat [minX, minY, (minZ), maxX, maxY, (maxZ)] records, copied at construction. */
4
+ bounds: ArrayLike<number>;
5
+ dimension: 2 | 3;
6
+ leafSize?: number;
7
+ };
8
+ export type NearestIndexResult = {
9
+ index: number;
10
+ distance: number;
11
+ };
12
+ /** A work unit visits one BVH node or one leaf item, including its optional refinement. */
13
+ export type IndexQueryBudget = {
14
+ maxWork?: number;
15
+ };
16
+ /** Incomplete results are provisional: null/empty does not establish absence. */
17
+ export type IndexQueryResult<T> = {
18
+ result: T;
19
+ complete: boolean;
20
+ work: number;
21
+ };
22
+ export type SearchIndexOptions = IndexQueryBudget & {
23
+ filter?: (index: number) => boolean;
24
+ /** Maximum accepted rows retained; one further match establishes truncation. */
25
+ maxResults?: number;
26
+ };
27
+ export type NearestIndexOptions = {
28
+ maxDistance?: number;
29
+ filter?: (index: number) => boolean;
30
+ /** Exact geometry distance, at least its box distance apart from roundoff. Values are never clamped; null excludes it. */
31
+ distanceToItem?: (index: number) => number | null;
32
+ };
33
+ /** Constraints for the nearest accepted ray hit against indexed boxes or caller-owned geometry. */
34
+ export type RayIndexOptions = {
35
+ /** Inclusive Euclidean distance limit; defaults to Infinity. */
36
+ maxDistance?: number;
37
+ /** Exclude an original row before exact refinement. */
38
+ filter?: (index: number) => boolean;
39
+ /**
40
+ * Exact Euclidean hit distance, or null to reject the row.
41
+ * Must be at least its indexed-box entry distance, apart from floating-point roundoff;
42
+ * geometry must stay inside that box. Refined distances are never rounded or clamped.
43
+ * The second argument is the current accepted distance limit, initially maxDistance.
44
+ * Traversal order is unspecified; this is not an all-intersections callback.
45
+ */
46
+ intersectItem?: (index: number, maxDistance: number) => number | null;
47
+ };
48
+ /** Static median-split BVH. Results refer to original input rows, not tree order. */
49
+ export declare class BoxIndex {
50
+ readonly dimension: 2 | 3;
51
+ readonly size: number;
52
+ private readonly bounds;
53
+ private readonly nodeBounds;
54
+ private readonly children;
55
+ private readonly starts;
56
+ private readonly counts;
57
+ private readonly order;
58
+ constructor(options: BoxIndexOptions);
59
+ /** Closed-box overlap, including boundary contact. Sorted by original row index. */
60
+ search(minimum: QueryPoint, maximum: QueryPoint): number[];
61
+ /** Bounded closed-box overlap. Results are sorted even when incomplete. */
62
+ searchQuery(minimum: QueryPoint, maximum: QueryPoint, options?: SearchIndexOptions): IndexQueryResult<number[]>;
63
+ /** Branch-and-bound nearest box, optionally refined against actual geometry. */
64
+ nearest(point: QueryPoint, options?: NearestIndexOptions): NearestIndexResult | null;
65
+ nearestQuery(point: QueryPoint, options?: NearestIndexOptions & IndexQueryBudget): IndexQueryResult<NearestIndexResult | null>;
66
+ /** Nearest indexed box to a filled query box, optionally refined to enclosed geometry. */
67
+ nearestBoxQuery(minimum: QueryPoint, maximum: QueryPoint, options?: NearestIndexOptions & IndexQueryBudget): IndexQueryResult<NearestIndexResult | null>;
68
+ /**
69
+ * Nearest accepted box/geometry hit without materializing and sorting all ray candidates.
70
+ * Rejected refinements do not clip the ray. Equal distances select the lowest original row.
71
+ */
72
+ intersectRay(origin: QueryPoint, direction: QueryPoint, options?: RayIndexOptions): NearestIndexResult | null;
73
+ intersectRayQuery(origin: QueryPoint, direction: QueryPoint, options?: RayIndexOptions & IndexQueryBudget): IndexQueryResult<NearestIndexResult | null>;
74
+ /** Broad-phase ray candidates, sorted by entry distance then original row index. */
75
+ searchRay(origin: QueryPoint, direction: QueryPoint, maxDistance?: number): NearestIndexResult[];
76
+ private validateBounds;
77
+ }
78
+ /** Points are zero-volume boxes: nearest gives exact Euclidean point distance. */
79
+ export declare class PointIndex extends BoxIndex {
80
+ constructor(options: {
81
+ positions: ArrayLike<number>;
82
+ dimension: 2 | 3;
83
+ leafSize?: number;
84
+ });
85
+ }
86
+ //# sourceMappingURL=box-index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"box-index.d.ts","sourceRoot":"","sources":["../../src/spatial-index/box-index.ts"],"names":[],"mappings":"AAIA,OAAO,EAKL,KAAK,UAAU,EAChB,8BAA2B;AAE5B,MAAM,MAAM,eAAe,GAAG;IAC5B,qFAAqF;IACrF,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC1B,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,MAAM,MAAM,kBAAkB,GAAG;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAC,CAAC;AACnE,2FAA2F;AAC3F,MAAM,MAAM,gBAAgB,GAAG;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAC,CAAC;AAClD,iFAAiF;AACjF,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI;IAAC,MAAM,EAAE,CAAC,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,CAAC;AAC/E,MAAM,MAAM,kBAAkB,GAAG,gBAAgB,GAAG;IAClD,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IACpC,gFAAgF;IAChF,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB,CAAC;AACF,MAAM,MAAM,mBAAmB,GAAG;IAChC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IACpC,0HAA0H;IAC1H,cAAc,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;CACnD,CAAC;AAEF,mGAAmG;AACnG,MAAM,MAAM,eAAe,GAAG;IAC5B,gEAAgE;IAChE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uDAAuD;IACvD,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IACpC;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;CACvE,CAAC;AAEF,qFAAqF;AACrF,qBAAa,QAAQ;IACnB,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAe;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;gBAExB,OAAO,EAAE,eAAe;IAiEpC,oFAAoF;IACpF,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,MAAM,EAAE;IAI1D,2EAA2E;IAC3E,WAAW,CACT,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,UAAU,EACnB,OAAO,GAAE,kBAAuB,GAC/B,gBAAgB,CAAC,MAAM,EAAE,CAAC;IA0C7B,gFAAgF;IAChF,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,GAAE,mBAAwB,GAAG,kBAAkB,GAAG,IAAI;IAIxF,YAAY,CACV,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,mBAAmB,GAAG,gBAAqB,GACnD,gBAAgB,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAI9C,0FAA0F;IAC1F,eAAe,CACb,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,UAAU,EACnB,OAAO,GAAE,mBAAmB,GAAG,gBAAqB,GACnD,gBAAgB,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAuE9C;;;OAGG;IACH,YAAY,CACV,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,GAAE,eAAoB,GAC5B,kBAAkB,GAAG,IAAI;IAI5B,iBAAiB,CACf,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,GAAE,eAAe,GAAG,gBAAqB,GAC/C,gBAAgB,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAmF9C,oFAAoF;IACpF,SAAS,CACP,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,WAAW,SAAW,GACrB,kBAAkB,EAAE;IA8BvB,OAAO,CAAC,cAAc;CAOvB;AA4BD,kFAAkF;AAClF,qBAAa,UAAW,SAAQ,QAAQ;gBAC1B,OAAO,EAAE;QAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAC;CAazF"}
@@ -0,0 +1,335 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+ import { intersectRayBounds, normalizeQueryDirection, validateQueryDistance, validateQueryPoint } from "../culling/queries.js";
5
+ /** Static median-split BVH. Results refer to original input rows, not tree order. */
6
+ export class BoxIndex {
7
+ constructor(options) {
8
+ const { dimension, bounds, leafSize = 8 } = options;
9
+ if (dimension !== 2 && dimension !== 3)
10
+ throw new RangeError('Index dimension must be 2 or 3');
11
+ if (!Number.isSafeInteger(leafSize) || leafSize < 1)
12
+ throw new RangeError('leafSize must be positive');
13
+ if (bounds.length % (dimension * 2))
14
+ throw new RangeError('Incomplete bounds record');
15
+ this.dimension = dimension;
16
+ this.bounds = Float64Array.from(bounds);
17
+ this.size = bounds.length / (dimension * 2);
18
+ if (this.size > 0x7fffffff)
19
+ throw new RangeError('Index exceeds 32-bit capacity');
20
+ const stride = dimension * 2;
21
+ for (let i = 0; i < this.size; i++)
22
+ this.validateBounds(this.bounds.subarray(i * stride, i * stride + dimension), this.bounds.subarray(i * stride + dimension, (i + 1) * stride));
23
+ const records = [];
24
+ const ids = Array.from({ length: this.size }, (_, i) => i);
25
+ const build = (start, end) => {
26
+ const node = records.length;
27
+ const bound = [
28
+ ...new Array(dimension).fill(Infinity),
29
+ ...new Array(dimension).fill(-Infinity)
30
+ ];
31
+ for (let i = start; i < end; i++)
32
+ for (let axis = 0; axis < dimension; axis++) {
33
+ bound[axis] = Math.min(bound[axis], this.bounds[ids[i] * stride + axis]);
34
+ bound[axis + dimension] = Math.max(bound[axis + dimension], this.bounds[ids[i] * stride + axis + dimension]);
35
+ }
36
+ const record = { bounds: bound, left: -1, right: -1, start, count: end - start };
37
+ records.push(record);
38
+ if (end - start > leafSize) {
39
+ let axis = 0;
40
+ for (let i = 1; i < dimension; i++) {
41
+ if (bound[i + dimension] - bound[i] > bound[axis + dimension] - bound[axis])
42
+ axis = i;
43
+ }
44
+ const center = (i) => this.bounds[i * stride + axis] / 2 + this.bounds[i * stride + axis + dimension] / 2;
45
+ const sorted = ids.slice(start, end).sort((a, b) => center(a) - center(b) || a - b);
46
+ for (let i = 0; i < sorted.length; i++)
47
+ ids[start + i] = sorted[i];
48
+ const middle = Math.floor((start + end) / 2);
49
+ record.left = build(start, middle);
50
+ record.right = build(middle, end);
51
+ record.count = 0;
52
+ }
53
+ return node;
54
+ };
55
+ if (this.size)
56
+ build(0, this.size);
57
+ this.nodeBounds = new Float64Array(records.length * stride);
58
+ this.children = new Int32Array(records.length * 2);
59
+ this.starts = new Uint32Array(records.length);
60
+ this.counts = new Uint32Array(records.length);
61
+ records.forEach((record, i) => {
62
+ this.nodeBounds.set(record.bounds, i * stride);
63
+ this.children.set([record.left, record.right], i * 2);
64
+ this.starts[i] = record.start;
65
+ this.counts[i] = record.count;
66
+ });
67
+ this.order = Uint32Array.from(ids);
68
+ }
69
+ /** Closed-box overlap, including boundary contact. Sorted by original row index. */
70
+ search(minimum, maximum) {
71
+ return this.searchQuery(minimum, maximum).result;
72
+ }
73
+ /** Bounded closed-box overlap. Results are sorted even when incomplete. */
74
+ searchQuery(minimum, maximum, options = {}) {
75
+ this.validateBounds(minimum, maximum);
76
+ const budget = new QueryBudget(options.maxWork);
77
+ const maxResults = validateLimit(options.maxResults);
78
+ const result = [];
79
+ const overlaps = (bounds, index) => {
80
+ const start = index * this.dimension * 2;
81
+ for (let i = 0; i < this.dimension; i++) {
82
+ if (bounds[start + i] > maximum[i] || bounds[start + i + this.dimension] < minimum[i])
83
+ return false;
84
+ }
85
+ return true;
86
+ };
87
+ const stack = this.size ? [0] : [];
88
+ let complete = true;
89
+ search: while (stack.length) {
90
+ if (!budget.consume()) {
91
+ complete = false;
92
+ break;
93
+ }
94
+ const node = stack.pop();
95
+ if (!overlaps(this.nodeBounds, node))
96
+ continue;
97
+ if (this.counts[node]) {
98
+ for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
99
+ if (!budget.consume()) {
100
+ complete = false;
101
+ break search;
102
+ }
103
+ const index = this.order[i];
104
+ if (overlaps(this.bounds, index) && (!options.filter || options.filter(index))) {
105
+ if (result.length === maxResults) {
106
+ complete = false;
107
+ break search;
108
+ }
109
+ result.push(index);
110
+ }
111
+ }
112
+ }
113
+ else
114
+ stack.push(this.children[node * 2], this.children[node * 2 + 1]);
115
+ }
116
+ return { result: result.sort((a, b) => a - b), complete, work: budget.work };
117
+ }
118
+ /** Branch-and-bound nearest box, optionally refined against actual geometry. */
119
+ nearest(point, options = {}) {
120
+ return this.nearestQuery(point, { ...options, maxWork: Infinity }).result;
121
+ }
122
+ nearestQuery(point, options = {}) {
123
+ return this.nearestBoxQuery(point, point, options);
124
+ }
125
+ /** Nearest indexed box to a filled query box, optionally refined to enclosed geometry. */
126
+ nearestBoxQuery(minimum, maximum, options = {}) {
127
+ this.validateBounds(minimum, maximum);
128
+ const budget = new QueryBudget(options.maxWork);
129
+ let best = options.maxDistance ?? Infinity;
130
+ validateQueryDistance(best);
131
+ let result = null;
132
+ const distance = (bounds, index) => {
133
+ const start = index * this.dimension * 2;
134
+ let x = 0, y = 0, z = 0;
135
+ x = Math.max(bounds[start] - maximum[0], 0, minimum[0] - bounds[start + this.dimension]);
136
+ y = Math.max(bounds[start + 1] - maximum[1], 0, minimum[1] - bounds[start + this.dimension + 1]);
137
+ if (this.dimension === 3)
138
+ z = Math.max(bounds[start + 2] - maximum[2], 0, minimum[2] - bounds[start + 5]);
139
+ return Math.hypot(x, y, z);
140
+ };
141
+ const stack = this.size ? [0] : [];
142
+ let complete = true;
143
+ search: while (stack.length) {
144
+ if (!budget.consume()) {
145
+ complete = false;
146
+ break;
147
+ }
148
+ const node = stack.pop();
149
+ const nodeDistance = distance(this.nodeBounds, node);
150
+ if (nodeDistance > best + getDistanceTolerance(nodeDistance, best))
151
+ continue;
152
+ if (this.counts[node]) {
153
+ for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
154
+ if (!budget.consume()) {
155
+ complete = false;
156
+ break search;
157
+ }
158
+ const index = this.order[i];
159
+ const lower = distance(this.bounds, index);
160
+ if (lower > best + getDistanceTolerance(lower, best) ||
161
+ (options.filter && !options.filter(index)))
162
+ continue;
163
+ const exact = options.distanceToItem ? options.distanceToItem(index) : lower;
164
+ if (exact === null)
165
+ continue;
166
+ validateQueryDistance(exact);
167
+ if (exact < lower &&
168
+ (!Number.isFinite(lower) || lower - exact > getDistanceTolerance(lower, exact)))
169
+ throw new RangeError('Refinement distance cannot be below box distance');
170
+ if (Number.isFinite(exact) &&
171
+ exact <= best &&
172
+ (!result || exact < best || index < result.index)) {
173
+ best = exact;
174
+ result = { index, distance: exact };
175
+ }
176
+ }
177
+ }
178
+ else {
179
+ const a = this.children[node * 2], b = this.children[node * 2 + 1];
180
+ if (distance(this.nodeBounds, a) < distance(this.nodeBounds, b))
181
+ stack.push(b, a);
182
+ else
183
+ stack.push(a, b);
184
+ }
185
+ }
186
+ return { result, complete, work: budget.work };
187
+ }
188
+ /**
189
+ * Nearest accepted box/geometry hit without materializing and sorting all ray candidates.
190
+ * Rejected refinements do not clip the ray. Equal distances select the lowest original row.
191
+ */
192
+ intersectRay(origin, direction, options = {}) {
193
+ return this.intersectRayQuery(origin, direction, { ...options, maxWork: Infinity }).result;
194
+ }
195
+ intersectRayQuery(origin, direction, options = {}) {
196
+ validateQueryPoint(origin, this.dimension);
197
+ const budget = new QueryBudget(options.maxWork);
198
+ const unit = normalizeQueryDirection(direction, this.dimension);
199
+ let best = options.maxDistance ?? Infinity;
200
+ validateQueryDistance(best);
201
+ let result = null;
202
+ const getEntry = (bounds, index) => {
203
+ const offset = index * this.dimension * 2;
204
+ return intersectRayBounds(origin, unit, bounds.subarray(offset, offset + this.dimension), bounds.subarray(offset + this.dimension, offset + this.dimension * 2), best + getDistanceTolerance(best, best));
205
+ };
206
+ // Defer the root bounds test until its visit, including for a zero work budget.
207
+ const stack = this.size ? [{ index: 0, distance: 0 }] : [];
208
+ let complete = true;
209
+ search: while (stack.length) {
210
+ if (!budget.consume()) {
211
+ complete = false;
212
+ break;
213
+ }
214
+ const candidate = stack.pop();
215
+ if (!candidate || candidate.distance > best + getDistanceTolerance(candidate.distance, best))
216
+ continue;
217
+ const node = candidate.index;
218
+ if (node === 0 && getEntry(this.nodeBounds, node) === null)
219
+ continue;
220
+ if (this.counts[node]) {
221
+ for (let offset = this.starts[node]; offset < this.starts[node] + this.counts[node]; offset++) {
222
+ if (!budget.consume()) {
223
+ complete = false;
224
+ break search;
225
+ }
226
+ const index = this.order[offset];
227
+ const lower = getEntry(this.bounds, index);
228
+ if (lower === null || (options.filter && !options.filter(index)))
229
+ continue;
230
+ const exact = options.intersectItem ? options.intersectItem(index, best) : lower;
231
+ if (exact === null)
232
+ continue;
233
+ validateQueryDistance(exact);
234
+ if (exact < lower &&
235
+ (!Number.isFinite(lower) || lower - exact > getDistanceTolerance(lower, exact)))
236
+ throw new RangeError('Refinement distance cannot be below box entry');
237
+ if (Number.isFinite(exact) &&
238
+ exact <= best &&
239
+ (!result || exact < best || index < result.index)) {
240
+ best = exact;
241
+ result = { index, distance: exact };
242
+ }
243
+ }
244
+ }
245
+ else {
246
+ const first = this.children[node * 2], second = this.children[node * 2 + 1];
247
+ const firstDistance = getEntry(this.nodeBounds, first), secondDistance = getEntry(this.nodeBounds, second);
248
+ if (firstDistance !== null && secondDistance !== null) {
249
+ if (firstDistance <= secondDistance)
250
+ stack.push({ index: second, distance: secondDistance }, { index: first, distance: firstDistance });
251
+ else
252
+ stack.push({ index: first, distance: firstDistance }, { index: second, distance: secondDistance });
253
+ }
254
+ else if (firstDistance !== null)
255
+ stack.push({ index: first, distance: firstDistance });
256
+ else if (secondDistance !== null)
257
+ stack.push({ index: second, distance: secondDistance });
258
+ }
259
+ }
260
+ return { result, complete, work: budget.work };
261
+ }
262
+ /** Broad-phase ray candidates, sorted by entry distance then original row index. */
263
+ searchRay(origin, direction, maxDistance = Infinity) {
264
+ validateQueryPoint(origin, this.dimension);
265
+ const unit = normalizeQueryDirection(direction, this.dimension);
266
+ validateQueryDistance(maxDistance);
267
+ const entry = (bounds, index) => {
268
+ const start = index * this.dimension * 2;
269
+ return intersectRayBounds(origin, unit, bounds.subarray(start, start + this.dimension), bounds.subarray(start + this.dimension, start + this.dimension * 2), maxDistance);
270
+ };
271
+ const result = [];
272
+ const stack = this.size ? [0] : [];
273
+ while (stack.length) {
274
+ const node = stack.pop();
275
+ if (entry(this.nodeBounds, node) === null)
276
+ continue;
277
+ if (this.counts[node]) {
278
+ for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
279
+ const index = this.order[i], distance = entry(this.bounds, index);
280
+ if (distance !== null)
281
+ result.push({ index, distance });
282
+ }
283
+ }
284
+ else
285
+ stack.push(this.children[node * 2], this.children[node * 2 + 1]);
286
+ }
287
+ return result.sort((a, b) => a.distance - b.distance || a.index - b.index);
288
+ }
289
+ validateBounds(minimum, maximum) {
290
+ validateQueryPoint(minimum, this.dimension);
291
+ validateQueryPoint(maximum, this.dimension);
292
+ for (let i = 0; i < this.dimension; i++) {
293
+ if (minimum[i] > maximum[i])
294
+ throw new RangeError('Bounds must be ordered');
295
+ }
296
+ }
297
+ }
298
+ /** Relative, unit-independent allowance for independently rounded slab and geometry kernels. */
299
+ function getDistanceTolerance(first, second) {
300
+ return (8 * Math.max(Number.MIN_VALUE, Number.EPSILON * Math.max(Math.abs(first), Math.abs(second))));
301
+ }
302
+ function validateLimit(value = Infinity) {
303
+ if (value !== Infinity && (!Number.isSafeInteger(value) || value < 0))
304
+ throw new RangeError('Query limits must be nonnegative safe integers or Infinity');
305
+ return value;
306
+ }
307
+ class QueryBudget {
308
+ constructor(maximum) {
309
+ this.work = 0;
310
+ this.maximum = validateLimit(maximum);
311
+ }
312
+ consume() {
313
+ if (this.work === this.maximum)
314
+ return false;
315
+ this.work++;
316
+ return true;
317
+ }
318
+ }
319
+ /** Points are zero-volume boxes: nearest gives exact Euclidean point distance. */
320
+ export class PointIndex extends BoxIndex {
321
+ constructor(options) {
322
+ const { positions, dimension, leafSize } = options;
323
+ if ((dimension !== 2 && dimension !== 3) || positions.length % dimension) {
324
+ throw new RangeError('Invalid point layout');
325
+ }
326
+ const bounds = new Float64Array(positions.length * 2);
327
+ for (let i = 0; i < positions.length / dimension; i++)
328
+ for (let axis = 0; axis < dimension; axis++) {
329
+ bounds[i * dimension * 2 + axis] = bounds[i * dimension * 2 + axis + dimension] =
330
+ positions[i * dimension + axis];
331
+ }
332
+ super({ bounds, dimension, leafSize });
333
+ }
334
+ }
335
+ //# sourceMappingURL=box-index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"box-index.js","sourceRoot":"","sources":["../../src/spatial-index/box-index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,qBAAqB,EACrB,kBAAkB,EAEnB,8BAA2B;AAyC5B,qFAAqF;AACrF,MAAM,OAAO,QAAQ;IAUnB,YAAY,OAAwB;QAClC,MAAM,EAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAC,GAAG,OAAO,CAAC;QAClD,IAAI,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gCAAgC,CAAC,CAAC;QAC/F,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC;YACjD,MAAM,IAAI,UAAU,CAAC,2BAA2B,CAAC,CAAC;QACpD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;QACtF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,CAAC,IAAI,GAAG,UAAU;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;QAClF,MAAM,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;YAChC,IAAI,CAAC,cAAc,CACjB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS,CAAC,EACxD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAC/D,CAAC;QACJ,MAAM,OAAO,GACX,EAAE,CAAC;QACL,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAW,EAAU,EAAE;YACnD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC;YAC5B,MAAM,KAAK,GAAG;gBACZ,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACtC,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;aACxC,CAAC;YACF,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;gBAC9B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;oBAC5C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;oBACzE,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAChC,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC,EACvB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,CAChD,CAAC;gBACJ,CAAC;YACH,MAAM,MAAM,GAAG,EAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,EAAC,CAAC;YAC/E,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,GAAG,GAAG,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;wBAAE,IAAI,GAAG,CAAC,CAAC;gBACxF,CAAC;gBACD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CACnC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;gBACtF,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9C,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,oFAAoF;IACpF,MAAM,CAAC,OAAmB,EAAE,OAAmB;QAC7C,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACnD,CAAC;IAED,2EAA2E;IAC3E,WAAW,CACT,OAAmB,EACnB,OAAmB,EACnB,UAA8B,EAAE;QAEhC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACrD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAW,EAAE;YAChE,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBACnF,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtB,QAAQ,GAAG,KAAK,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;gBAAE,SAAS;YAC/C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/E,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;wBACtB,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM,MAAM,CAAC;oBACf,CAAC;oBACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;wBAC/E,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;4BACjC,QAAQ,GAAG,KAAK,CAAC;4BACjB,MAAM,MAAM,CAAC;wBACf,CAAC;wBACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;;gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,EAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAC,CAAC;IAC7E,CAAC;IAED,gFAAgF;IAChF,OAAO,CAAC,KAAiB,EAAE,UAA+B,EAAE;QAC1D,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EAAC,GAAG,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAC,CAAC,CAAC,MAAM,CAAC;IAC1E,CAAC;IAED,YAAY,CACV,KAAiB,EACjB,UAAkD,EAAE;QAEpD,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACrD,CAAC;IAED,0FAA0F;IAC1F,eAAe,CACb,OAAmB,EACnB,OAAmB,EACnB,UAAkD,EAAE;QAEpD,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,OAAO,CAAC,WAAW,IAAI,QAAQ,CAAC;QAC3C,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,MAAM,GAA8B,IAAI,CAAC;QAC7C,MAAM,QAAQ,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAU,EAAE;YAC/D,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACzC,IAAI,CAAC,GAAG,CAAC,EACP,CAAC,GAAG,CAAC,EACL,CAAC,GAAG,CAAC,CAAC;YACR,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACzF,CAAC,GAAG,IAAI,CAAC,GAAG,CACV,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAC9B,CAAC,EACD,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAChD,CAAC;YACF,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC;gBACtB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAClF,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtB,QAAQ,GAAG,KAAK,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACzB,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACrD,IAAI,YAAY,GAAG,IAAI,GAAG,oBAAoB,CAAC,YAAY,EAAE,IAAI,CAAC;gBAAE,SAAS;YAC7E,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/E,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;wBACtB,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM,MAAM,CAAC;oBACf,CAAC;oBACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBAC3C,IACE,KAAK,GAAG,IAAI,GAAG,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC;wBAChD,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBAE1C,SAAS;oBACX,MAAM,KAAK,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;oBAC7E,IAAI,KAAK,KAAK,IAAI;wBAAE,SAAS;oBAC7B,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBAC7B,IACE,KAAK,GAAG,KAAK;wBACb,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,KAAK,GAAG,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;wBAE/E,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,CAAC;oBAC3E,IACE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;wBACtB,KAAK,IAAI,IAAI;wBACb,CAAC,CAAC,MAAM,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,EACjD,CAAC;wBACD,IAAI,GAAG,KAAK,CAAC;wBACb,MAAM,GAAG,EAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,EAC/B,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClC,IAAI,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;;oBAC7E,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QACD,OAAO,EAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACH,YAAY,CACV,MAAkB,EAClB,SAAqB,EACrB,UAA2B,EAAE;QAE7B,OAAO,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,SAAS,EAAE,EAAC,GAAG,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAC,CAAC,CAAC,MAAM,CAAC;IAC3F,CAAC;IAED,iBAAiB,CACf,MAAkB,EAClB,SAAqB,EACrB,UAA8C,EAAE;QAEhD,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,IAAI,GAAG,OAAO,CAAC,WAAW,IAAI,QAAQ,CAAC;QAC3C,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,MAAM,GAA8B,IAAI,CAAC;QAC7C,MAAM,QAAQ,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAiB,EAAE;YACtE,MAAM,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YAC1C,OAAO,kBAAkB,CACvB,MAAM,EACN,IAAI,EACJ,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAChD,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EACrE,IAAI,GAAG,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CACxC,CAAC;QACJ,CAAC,CAAC;QACF,gFAAgF;QAChF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtB,QAAQ,GAAG,KAAK,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,GAAG,oBAAoB,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC;gBAC1F,SAAS;YACX,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC;YAC7B,IAAI,IAAI,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAS;YACrE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,KACE,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAC9B,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAC9C,MAAM,EAAE,EACR,CAAC;oBACD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;wBACtB,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM,MAAM,CAAC;oBACf,CAAC;oBACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;oBACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBAC3C,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBAAE,SAAS;oBAC3E,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;oBACjF,IAAI,KAAK,KAAK,IAAI;wBAAE,SAAS;oBAC7B,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBAC7B,IACE,KAAK,GAAG,KAAK;wBACb,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,KAAK,GAAG,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;wBAE/E,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;oBACxE,IACE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;wBACtB,KAAK,IAAI,IAAI;wBACb,CAAC,CAAC,MAAM,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,EACjD,CAAC;wBACD,IAAI,GAAG,KAAK,CAAC;wBACb,MAAM,GAAG,EAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,EACnC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvC,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,EACpD,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,aAAa,KAAK,IAAI,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;oBACtD,IAAI,aAAa,IAAI,cAAc;wBACjC,KAAK,CAAC,IAAI,CACR,EAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAC,EACzC,EAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAC,CACxC,CAAC;;wBAEF,KAAK,CAAC,IAAI,CACR,EAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAC,EACvC,EAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAC,CAC1C,CAAC;gBACN,CAAC;qBAAM,IAAI,aAAa,KAAK,IAAI;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAC,CAAC,CAAC;qBAClF,IAAI,cAAc,KAAK,IAAI;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAC,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;QACD,OAAO,EAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAC,CAAC;IAC/C,CAAC;IAED,oFAAoF;IACpF,SAAS,CACP,MAAkB,EAClB,SAAqB,EACrB,WAAW,GAAG,QAAQ;QAEtB,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,qBAAqB,CAAC,WAAW,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,CAAC,MAAoB,EAAE,KAAa,EAAiB,EAAE;YACnE,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACzC,OAAO,kBAAkB,CACvB,MAAM,EACN,IAAI,EACJ,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAC9C,MAAM,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EACnE,WAAW,CACZ,CAAC;QACJ,CAAC,CAAC;QACF,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAS;YACpD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EACzB,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBACvC,IAAI,QAAQ,KAAK,IAAI;wBAAE,MAAM,CAAC,IAAI,CAAC,EAAC,KAAK,EAAE,QAAQ,EAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;;gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7E,CAAC;IAEO,cAAc,CAAC,OAAmB,EAAE,OAAmB;QAC7D,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;CACF;AAED,gGAAgG;AAChG,SAAS,oBAAoB,CAAC,KAAa,EAAE,MAAc;IACzD,OAAO,CACL,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAC7F,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,KAAK,GAAG,QAAQ;IACrC,IAAI,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAC;IACrF,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,WAAW;IAGf,YAAY,OAAgB;QAF5B,SAAI,GAAG,CAAC,CAAC;QAGP,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IACD,OAAO;QACL,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAC7C,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,OAAO,UAAW,SAAQ,QAAQ;IACtC,YAAY,OAA4E;QACtF,MAAM,EAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAC,GAAG,OAAO,CAAC;QACjD,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YACzE,MAAM,IAAI,UAAU,CAAC,sBAAsB,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE;YACnD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;oBAC7E,SAAS,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC;YACpC,CAAC;QACH,KAAK,CAAC,EAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAC,CAAC,CAAC;IACvC,CAAC;CACF"}
@@ -0,0 +1,7 @@
1
+ export { BoxIndex, PointIndex } from "./box-index.js";
2
+ export type { BoxIndexOptions, NearestIndexOptions, NearestIndexResult, RayIndexOptions } from "./box-index.js";
3
+ export type { IndexQueryBudget, IndexQueryResult, SearchIndexOptions } from "./box-index.js";
4
+ export { TriangleBVH } from "./triangle-bvh.js";
5
+ export type { TriangleBVHOptions, TriangleQueryResult, TriangleRayResult, TriangleRayOptions } from "./triangle-bvh.js";
6
+ export type { TriangleNearestOptions, TriangleSegmentResult } from "./triangle-bvh.js";
7
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/spatial-index/index.ts"],"names":[],"mappings":"AAIA,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,uBAAoB;AACjD,YAAY,EACV,eAAe,EACf,mBAAmB,EACnB,kBAAkB,EAClB,eAAe,EAChB,uBAAoB;AACrB,YAAY,EAAC,gBAAgB,EAAE,gBAAgB,EAAE,kBAAkB,EAAC,uBAAoB;AACxF,OAAO,EAAC,WAAW,EAAC,0BAAuB;AAC3C,YAAY,EACV,kBAAkB,EAClB,mBAAmB,EACnB,iBAAiB,EACjB,kBAAkB,EACnB,0BAAuB;AACxB,YAAY,EAAC,sBAAsB,EAAE,qBAAqB,EAAC,0BAAuB"}
@@ -0,0 +1,6 @@
1
+ // math.gl
2
+ // SPDX-License-Identifier: MIT
3
+ // SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
4
+ export { BoxIndex, PointIndex } from "./box-index.js";
5
+ export { TriangleBVH } from "./triangle-bvh.js";
6
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/spatial-index/index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,uBAAoB;AAQjD,OAAO,EAAC,WAAW,EAAC,0BAAuB"}
@@ -0,0 +1,74 @@
1
+ import { type QueryPoint } from "../culling/queries.js";
2
+ import { type IndexQueryBudget, type IndexQueryResult, type SearchIndexOptions } from "./box-index.js";
3
+ export type TriangleBVHOptions = {
4
+ /** Packed xyz vertices. Copied at construction. */
5
+ positions: ArrayLike<number>;
6
+ /** Triangle-list vertex indices. Omit for non-indexed triangles. */
7
+ indices?: ArrayLike<number>;
8
+ leafSize?: number;
9
+ };
10
+ export type TriangleQueryResult = {
11
+ index: number;
12
+ distance: number;
13
+ point: [number, number, number];
14
+ };
15
+ export type TriangleRayResult = TriangleQueryResult & {
16
+ barycentric: [number, number, number];
17
+ };
18
+ export type TriangleSegmentResult = TriangleQueryResult & {
19
+ segmentPoint: [number, number, number];
20
+ segmentFraction: number;
21
+ };
22
+ export type TriangleNearestOptions = {
23
+ maxDistance?: number;
24
+ filter?: (index: number) => boolean;
25
+ };
26
+ /** Optional application constraints for the nearest accepted triangle intersection. */
27
+ export type TriangleRayOptions = {
28
+ /** Inclusive Euclidean distance limit in input-coordinate units; defaults to Infinity. */
29
+ maxDistance?: number;
30
+ /** Ignore triangles facing away from the ray; defaults to false. */
31
+ backfaceCulling?: boolean;
32
+ /** Exclude an original triangle index before running its exact intersection kernel. */
33
+ filter?: (index: number) => boolean;
34
+ /**
35
+ * Accept or reject an exact hit using its point and original-order barycentric weights.
36
+ * Rejected hits do not shorten the search: a valid surface behind a hole can still win.
37
+ * Called only for candidates that could improve the current accepted result, not all hits.
38
+ * Treat the detached candidate as immutable; traversal order is unspecified.
39
+ */
40
+ acceptHit?: (hit: Readonly<Omit<TriangleRayResult, 'point' | 'barycentric'>> & {
41
+ readonly point: readonly [number, number, number];
42
+ readonly barycentric: readonly [number, number, number];
43
+ }) => boolean;
44
+ };
45
+ /** Static triangle-list BVH. index is the original triangle number, not a vertex index. */
46
+ export declare class TriangleBVH {
47
+ readonly size: number;
48
+ private readonly positions;
49
+ private readonly indices;
50
+ private readonly boxes;
51
+ constructor(options: TriangleBVHOptions);
52
+ /** Bounds candidates only; does not imply exact triangle/box overlap. */
53
+ search(minimum: QueryPoint, maximum: QueryPoint): number[];
54
+ searchQuery(minimum: QueryPoint, maximum: QueryPoint, options?: SearchIndexOptions): IndexQueryResult<number[]>;
55
+ /** Nearest accepted exact hit; application rejection never clips away later candidates. */
56
+ intersectRay(origin: QueryPoint, direction: QueryPoint, options?: TriangleRayOptions): TriangleRayResult | null;
57
+ intersectRayQuery(origin: QueryPoint, direction: QueryPoint, options?: TriangleRayOptions & IndexQueryBudget): IndexQueryResult<TriangleRayResult | null>;
58
+ nearest(point: QueryPoint, options?: TriangleNearestOptions): TriangleQueryResult | null;
59
+ nearestQuery(point: QueryPoint, options?: TriangleNearestOptions & IndexQueryBudget): IndexQueryResult<TriangleQueryResult | null>;
60
+ /** All triangle contacts with a closed sphere, sorted by original index (not distance).
61
+ * Uses closest points on faces, edges and vertices. No contact manifold reduction.
62
+ */
63
+ intersectSphere(center: QueryPoint, radius: number, options?: SearchIndexOptions): IndexQueryResult<TriangleQueryResult[]>;
64
+ /** Minimum Euclidean distance along the whole closed segment, not first intersection. */
65
+ nearestSegment(start: QueryPoint, end: QueryPoint, options?: TriangleNearestOptions): TriangleSegmentResult | null;
66
+ nearestSegmentQuery(start: QueryPoint, end: QueryPoint, options?: TriangleNearestOptions & IndexQueryBudget): IndexQueryResult<TriangleSegmentResult | null>;
67
+ /** Closed capsule overlap, with one closest pair per accepted triangle.
68
+ * A straight translating sphere covers this volume, but segmentFraction is not first-impact time.
69
+ */
70
+ intersectCapsule(start: QueryPoint, end: QueryPoint, radius: number, options?: SearchIndexOptions): IndexQueryResult<TriangleSegmentResult[]>;
71
+ private segmentClosest;
72
+ private triangle;
73
+ }
74
+ //# sourceMappingURL=triangle-bvh.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"triangle-bvh.d.ts","sourceRoot":"","sources":["../../src/spatial-index/triangle-bvh.ts"],"names":[],"mappings":"AAIA,OAAO,EAML,KAAK,UAAU,EAChB,8BAA2B;AAC5B,OAAO,EAEL,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACxB,uBAAoB;AAErB,MAAM,MAAM,kBAAkB,GAAG;IAC/B,mDAAmD;IACnD,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7B,oEAAoE;IACpE,OAAO,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,MAAM,MAAM,mBAAmB,GAAG;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC,CAAC;AACF,MAAM,MAAM,iBAAiB,GAAG,mBAAmB,GAAG;IAAC,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;CAAC,CAAC;AAC9F,MAAM,MAAM,qBAAqB,GAAG,mBAAmB,GAAG;IACxD,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACvC,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AACF,MAAM,MAAM,sBAAsB,GAAG;IAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAA;CAAC,CAAC;AAEjG,uFAAuF;AACvF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,0FAA0F;IAC1F,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,uFAAuF;IACvF,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IACpC;;;;;OAKG;IACH,SAAS,CAAC,EAAE,CACV,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE,OAAO,GAAG,aAAa,CAAC,CAAC,GAAG;QAChE,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;KACzD,KACE,OAAO,CAAC;CACd,CAAC;AAEF,2FAA2F;AAC3F,qBAAa,WAAW;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAe;IACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAc;IACtC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;gBAErB,OAAO,EAAE,kBAAkB;IAgCvC,yEAAyE;IACzE,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,MAAM,EAAE;IAI1D,WAAW,CACT,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,UAAU,EACnB,OAAO,GAAE,kBAAuB,GAC/B,gBAAgB,CAAC,MAAM,EAAE,CAAC;IAI7B,2FAA2F;IAC3F,YAAY,CACV,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,GAAE,kBAAuB,GAC/B,iBAAiB,GAAG,IAAI;IAI3B,iBAAiB,CACf,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,GAAE,kBAAkB,GAAG,gBAAqB,GAClD,gBAAgB,CAAC,iBAAiB,GAAG,IAAI,CAAC;IAyC7C,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,GAAE,sBAA2B,GAAG,mBAAmB,GAAG,IAAI;IAI5F,YAAY,CACV,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,sBAAsB,GAAG,gBAAqB,GACtD,gBAAgB,CAAC,mBAAmB,GAAG,IAAI,CAAC;IAwB/C;;OAEG;IACH,eAAe,CACb,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,kBAAuB,GAC/B,gBAAgB,CAAC,mBAAmB,EAAE,CAAC;IAmC1C,yFAAyF;IACzF,cAAc,CACZ,KAAK,EAAE,UAAU,EACjB,GAAG,EAAE,UAAU,EACf,OAAO,GAAE,sBAA2B,GACnC,qBAAqB,GAAG,IAAI;IAI/B,mBAAmB,CACjB,KAAK,EAAE,UAAU,EACjB,GAAG,EAAE,UAAU,EACf,OAAO,GAAE,sBAAsB,GAAG,gBAAqB,GACtD,gBAAgB,CAAC,qBAAqB,GAAG,IAAI,CAAC;IAmBjD;;OAEG;IACH,gBAAgB,CACd,KAAK,EAAE,UAAU,EACjB,GAAG,EAAE,UAAU,EACf,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,kBAAuB,GAC/B,gBAAgB,CAAC,qBAAqB,EAAE,CAAC;IAkB5C,OAAO,CAAC,cAAc;IAWtB,OAAO,CAAC,QAAQ;CAOjB"}