flo-mat 3.0.15 → 4.0.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (601) hide show
  1. package/README.md +1 -1
  2. package/__tests__/cp-node/compare-cp-nodes-by-value.ts +5 -3
  3. package/__tests__/cp-node/compare-poss-by-value.ts +7 -7
  4. package/__tests__/cp-node/fs/get-all-on-circle.spec.ts +8 -8
  5. package/__tests__/cp-node/fs/is-one-prong.spec.ts +3 -3
  6. package/__tests__/cp-node/fs/is-sharp.spec.ts +1 -1
  7. package/__tests__/find-2-prong/get-medial/get-closest-points.spec.ts +49 -0
  8. package/__tests__/get-mats1.ts +29 -32
  9. package/__tests__/helpers/close-to.ts +71 -0
  10. package/__tests__/helpers/jest-extend-nearly.ts +39 -0
  11. package/__tests__/helpers/jest.setup.ts +6 -0
  12. package/__tests__/helpers/obj-or-array.ts +8 -0
  13. package/__tests__/jest-extensions.d.ts +26 -0
  14. package/__tests__/lib-load.spec.ts +1 -1
  15. package/browser/index.js +20280 -17610
  16. package/browser/index.min.js +1 -1
  17. package/jest.config.cjs +1 -0
  18. package/node/add-n-prong.ts/join-spokes.d.ts +2 -2
  19. package/node/add-n-prong.ts/join-spokes.js +5 -4
  20. package/node/add-n-prong.ts/join-spokes.js.map +1 -1
  21. package/node/closest-boundary-point/cull-bezier-pieces-1.d.ts +9 -0
  22. package/node/closest-boundary-point/{cull-bezier-pieces.js → cull-bezier-pieces-1.js} +6 -7
  23. package/node/closest-boundary-point/cull-bezier-pieces-1.js.map +1 -0
  24. package/node/closest-boundary-point/cull-by-loose-bounding-box.d.ts +7 -5
  25. package/node/closest-boundary-point/cull-by-loose-bounding-box.js +12 -10
  26. package/node/closest-boundary-point/cull-by-loose-bounding-box.js.map +1 -1
  27. package/node/closest-boundary-point/cull-by-tight-boundary-box.js +2 -2
  28. package/node/closest-boundary-point/foot-and-endpoint-info.d.ts +6 -9
  29. package/node/closest-boundary-point/get-best-distance-squared.d.ts +4 -3
  30. package/node/closest-boundary-point/get-best-distance-squared.js +11 -11
  31. package/node/closest-boundary-point/get-best-distance-squared.js.map +1 -1
  32. package/node/closest-boundary-point/get-close-boundary-points-certified.d.ts +5 -9
  33. package/node/closest-boundary-point/get-close-boundary-points-certified.js +22 -18
  34. package/node/closest-boundary-point/get-close-boundary-points-certified.js.map +1 -1
  35. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.d.ts +3 -8
  36. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js +34 -91
  37. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js.map +1 -1
  38. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.d.ts +1 -1
  39. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js +8 -11
  40. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js.map +1 -1
  41. package/node/corner/compare-curvatures-at-interface.d.ts +1 -1
  42. package/node/corner/compare-curvatures-at-interface.js +1 -1
  43. package/node/corner/corner.d.ts +7 -6
  44. package/node/corner/get-corner.d.ts +1 -6
  45. package/node/corner/get-corner.js +2 -9
  46. package/node/corner/get-corner.js.map +1 -1
  47. package/node/corner/get-interface-ccw.d.ts +2 -2
  48. package/node/corner/get-interface-ccw.js +4 -5
  49. package/node/corner/get-interface-ccw.js.map +1 -1
  50. package/node/cp-node/cp-node-fs.d.ts +0 -15
  51. package/node/cp-node/cp-node-fs.js +0 -4
  52. package/node/cp-node/cp-node-fs.js.map +1 -1
  53. package/node/cp-node/cp-node.d.ts +10 -10
  54. package/node/cp-node/fs/clone.js.map +1 -1
  55. package/node/cp-node/fs/cp-node-comparator.js +2 -2
  56. package/node/cp-node/fs/cp-node-comparator.js.map +1 -1
  57. package/node/cp-node/fs/enhance-cp-node.d.ts +1 -1
  58. package/node/cp-node/fs/enhance-cp-node.js +5 -5
  59. package/node/cp-node/fs/enhance-cp-node.js.map +1 -1
  60. package/node/cp-node/fs/get-boundary-bezier-parts-to-next.js +2 -2
  61. package/node/cp-node/fs/get-boundary-bezier-parts-to-next.js.map +1 -1
  62. package/node/cp-node/fs/get-cp-node-ordering.js +4 -4
  63. package/node/cp-node/fs/get-cp-node-ordering.js.map +1 -1
  64. package/node/cp-node/fs/get-edge-direction.js +3 -3
  65. package/node/cp-node/fs/get-edge-direction.js.map +1 -1
  66. package/node/cp-node/fs/get-hole-closers.d.ts +1 -1
  67. package/node/cp-node/fs/get-implied-boundary-bezier-between.js +2 -2
  68. package/node/cp-node/fs/get-implied-boundary-bezier-between.js.map +1 -1
  69. package/node/cp-node/fs/get-mat-curve-between.d.ts +1 -1
  70. package/node/cp-node/fs/get-mat-curve-between.js +6 -5
  71. package/node/cp-node/fs/get-mat-curve-between.js.map +1 -1
  72. package/node/cp-node/fs/get-salience.d.ts +1 -1
  73. package/node/cp-node/fs/get-salience.js +3 -3
  74. package/node/cp-node/fs/get-salience.js.map +1 -1
  75. package/node/cp-node/fs/insert-cp-node.d.ts +4 -4
  76. package/node/cp-node/fs/insert-cp-node.js +3 -4
  77. package/node/cp-node/fs/insert-cp-node.js.map +1 -1
  78. package/node/cp-node/fs/is-one-prong.d.ts +1 -1
  79. package/node/cp-node/fs/is-one-prong.js +2 -9
  80. package/node/cp-node/fs/is-one-prong.js.map +1 -1
  81. package/node/cp-node/fs/is-order-correct.d.ts +3 -3
  82. package/node/cp-node/fs/is-order-correct.js +5 -8
  83. package/node/cp-node/fs/is-order-correct.js.map +1 -1
  84. package/node/cp-node/fs/is-sharp.js +1 -1
  85. package/node/cp-node/fs/is-sharp.js.map +1 -1
  86. package/node/cp-node/fs/remove-cp-node.js +1 -2
  87. package/node/cp-node/fs/remove-cp-node.js.map +1 -1
  88. package/node/cp-node/fs/traverse-cp.js.map +1 -1
  89. package/node/cp-node/fs/traverse-vertices.d.ts +1 -1
  90. package/node/cp-node/fs/traverse-vertices.js.map +1 -1
  91. package/node/debug/debug-elem-types.d.ts +1 -2
  92. package/node/debug/debug-elem-types.js +1 -2
  93. package/node/debug/debug-elem-types.js.map +1 -1
  94. package/node/debug/functions/draw-elem/draw-branch.d.ts +1 -1
  95. package/node/debug/functions/draw-elem/draw-branch.js.map +1 -1
  96. package/node/debug/functions/draw-elem/draw-cp-node.d.ts +1 -1
  97. package/node/debug/functions/draw-elem/draw-cp-node.js +4 -4
  98. package/node/debug/functions/draw-elem/draw-cp-node.js.map +1 -1
  99. package/node/debug/functions/draw-elem/draw-elem.js +1 -5
  100. package/node/debug/functions/draw-elem/draw-elem.js.map +1 -1
  101. package/node/debug/functions/draw-elem/draw-leaves.d.ts +1 -1
  102. package/node/debug/functions/draw-elem/draw-leaves.js +4 -4
  103. package/node/debug/functions/draw-elem/draw-leaves.js.map +1 -1
  104. package/node/debug/functions/draw-elem/draw-mat.d.ts +1 -1
  105. package/node/debug/functions/draw-elem/draw-mat.js +1 -2
  106. package/node/debug/functions/draw-elem/draw-mat.js.map +1 -1
  107. package/node/debug/functions/draw-elem/draw-max-vertex.d.ts +1 -1
  108. package/node/debug/functions/draw-elem/draw-max-vertex.js +1 -1
  109. package/node/debug/functions/draw-elem/draw-max-vertex.js.map +1 -1
  110. package/node/debug/functions/draw-elem/draw-min-y.d.ts +1 -1
  111. package/node/debug/functions/draw-elem/draw-min-y.js.map +1 -1
  112. package/node/debug/functions/draw-elem/draw-one-prong-at-dull-corner.js +12 -3
  113. package/node/debug/functions/draw-elem/draw-one-prong-at-dull-corner.js.map +1 -1
  114. package/node/debug/functions/draw-elem/draw-one-prong.d.ts +2 -2
  115. package/node/debug/functions/draw-elem/draw-one-prong.js +8 -7
  116. package/node/debug/functions/draw-elem/draw-one-prong.js.map +1 -1
  117. package/node/debug/functions/draw-elem/draw-three-prong.d.ts +1 -1
  118. package/node/debug/functions/draw-elem/draw-three-prong.js +4 -4
  119. package/node/debug/functions/draw-elem/draw-three-prong.js.map +1 -1
  120. package/node/debug/functions/draw-elem/draw-two-prong.js +4 -3
  121. package/node/debug/functions/draw-elem/draw-two-prong.js.map +1 -1
  122. package/node/debug/functions/draw-elem/draw-vertex.d.ts +1 -1
  123. package/node/debug/functions/draw-elem/draw-vertex.js +1 -3
  124. package/node/debug/functions/draw-elem/draw-vertex.js.map +1 -1
  125. package/node/debug/functions/general.js +1 -1
  126. package/node/debug/functions/general.js.map +1 -1
  127. package/node/error-analysis/gamma.d.ts +7 -1
  128. package/node/error-analysis/gamma.js +6 -2
  129. package/node/error-analysis/gamma.js.map +1 -1
  130. package/node/find-2-prong/add-1-prong.d.ts +3 -3
  131. package/node/find-2-prong/add-1-prong.js +4 -4
  132. package/node/find-2-prong/add-1-prong.js.map +1 -1
  133. package/node/find-2-prong/add-2-prong.d.ts +10 -11
  134. package/node/find-2-prong/add-2-prong.js +42 -37
  135. package/node/find-2-prong/add-2-prong.js.map +1 -1
  136. package/node/find-2-prong/calc-seperation-tolerance.js +4 -7
  137. package/node/find-2-prong/calc-seperation-tolerance.js.map +1 -1
  138. package/node/find-2-prong/cull-bezier-pieces.d.ts +9 -7
  139. package/node/find-2-prong/cull-bezier-pieces.js +30 -15
  140. package/node/find-2-prong/cull-bezier-pieces.js.map +1 -1
  141. package/node/find-2-prong/find-2-prong.d.ts +12 -13
  142. package/node/find-2-prong/find-2-prong.js +73 -116
  143. package/node/find-2-prong/find-2-prong.js.map +1 -1
  144. package/node/find-2-prong/find-and-add-2-prongs-on-all-loops.d.ts +4 -4
  145. package/node/find-2-prong/find-and-add-2-prongs-on-all-loops.js.map +1 -1
  146. package/node/find-2-prong/find-and-add-2-prongs.d.ts +5 -4
  147. package/node/find-2-prong/find-and-add-2-prongs.js +28 -24
  148. package/node/find-2-prong/find-and-add-2-prongs.js.map +1 -1
  149. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.d.ts +6 -8
  150. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js +11 -12
  151. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js.map +1 -1
  152. package/node/find-2-prong/get-initial-bezier-pieces.d.ts +5 -6
  153. package/node/find-2-prong/get-initial-bezier-pieces.js +8 -11
  154. package/node/find-2-prong/get-initial-bezier-pieces.js.map +1 -1
  155. package/node/find-2-prong/get-initial-x.d.ts +12 -0
  156. package/node/find-2-prong/get-initial-x.js +35 -0
  157. package/node/find-2-prong/get-initial-x.js.map +1 -0
  158. package/node/find-2-prong/get-medial/antipodal-point.d.ts +8 -0
  159. package/node/find-2-prong/get-medial/antipodal-point.js +2 -0
  160. package/node/find-2-prong/get-medial/antipodal-point.js.map +1 -0
  161. package/node/find-2-prong/get-medial/get-antipodal-points.d.ts +18 -0
  162. package/node/find-2-prong/get-medial/get-antipodal-points.js +41 -0
  163. package/node/find-2-prong/get-medial/get-antipodal-points.js.map +1 -0
  164. package/node/find-2-prong/get-medial/get-closest-points.d.ts +15 -0
  165. package/node/find-2-prong/get-medial/get-closest-points.js +167 -0
  166. package/node/find-2-prong/get-medial/get-closest-points.js.map +1 -0
  167. package/node/find-2-prong/reduce-radius.d.ts +4 -4
  168. package/node/find-2-prong/reduce-radius.js +30 -50
  169. package/node/find-2-prong/reduce-radius.js.map +1 -1
  170. package/node/{find-3-prong.ts → find-3-prong}/calc-better-x.d.ts +9 -6
  171. package/node/{find-3-prong.ts → find-3-prong}/calc-better-x.js +11 -6
  172. package/node/find-3-prong/calc-better-x.js.map +1 -0
  173. package/node/find-3-prong/calc-initial-3-prong-center.d.ts +15 -0
  174. package/node/find-3-prong/calc-initial-3-prong-center.js +27 -0
  175. package/node/find-3-prong/calc-initial-3-prong-center.js.map +1 -0
  176. package/node/find-3-prong/find-3-prong-for-delta3s.d.ts +19 -0
  177. package/node/{find-3-prong.ts → find-3-prong}/find-3-prong-for-delta3s.js +47 -32
  178. package/node/find-3-prong/find-3-prong-for-delta3s.js.map +1 -0
  179. package/node/find-3-prong/find-3-prong.d.ts +13 -0
  180. package/node/{find-3-prong.ts → find-3-prong}/find-3-prong.js +14 -9
  181. package/node/find-3-prong/find-3-prong.js.map +1 -0
  182. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.d.ts +2 -2
  183. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.js +17 -2
  184. package/node/find-3-prong/find-and-add-3-prong.js.map +1 -0
  185. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.js +8 -21
  186. package/node/find-3-prong/find-and-add-3-prongs-on-loop.js.map +1 -0
  187. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.d.ts +1 -4
  188. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.js +2 -3
  189. package/node/find-3-prong/find-and-add-3-prongs.js.map +1 -0
  190. package/node/find-3-prong/get-closest-points.d.ts +10 -0
  191. package/node/{find-3-prong.ts → find-3-prong}/get-closest-points.js +4 -4
  192. package/node/find-3-prong/get-closest-points.js.map +1 -0
  193. package/node/find-3-prong/three-prong-info.d.ts +9 -0
  194. package/node/find-3-prong/three-prong-info.js +2 -0
  195. package/node/find-3-prong/three-prong-info.js.map +1 -0
  196. package/node/find-3-prong/timed-cc.d.ts +3 -0
  197. package/node/find-3-prong/timed-cc.js +5 -0
  198. package/node/find-3-prong/timed-cc.js.map +1 -0
  199. package/node/find-mat/clip-options.d.ts +2 -2
  200. package/node/find-mat/clip-options.js +7 -14
  201. package/node/find-mat/clip-options.js.map +1 -1
  202. package/node/find-mat/create-initial-cp-tree.d.ts +9 -8
  203. package/node/find-mat/create-initial-cp-tree.js +17 -20
  204. package/node/find-mat/create-initial-cp-tree.js.map +1 -1
  205. package/node/find-mat/find-mat.d.ts +5 -5
  206. package/node/find-mat/find-mat.js +6 -12
  207. package/node/find-mat/find-mat.js.map +1 -1
  208. package/node/find-mat/find-mats.js +7 -12
  209. package/node/find-mat/find-mats.js.map +1 -1
  210. package/node/find-mat/get-dull-corners-on-loop.d.ts +3 -3
  211. package/node/find-mat/get-dull-corners-on-loop.js +5 -4
  212. package/node/find-mat/get-dull-corners-on-loop.js.map +1 -1
  213. package/node/find-mat/get-for-1-prongs-on-loop.d.ts +7 -7
  214. package/node/find-mat/get-for-1-prongs-on-loop.js +9 -21
  215. package/node/find-mat/get-for-1-prongs-on-loop.js.map +1 -1
  216. package/node/find-mat/get-for-2-prongs-on-loop.d.ts +5 -4
  217. package/node/find-mat/get-for-2-prongs-on-loop.js +4 -6
  218. package/node/find-mat/get-for-2-prongs-on-loop.js.map +1 -1
  219. package/node/find-mat/get-meta.d.ts +3 -3
  220. package/node/find-mat/get-meta.js +13 -12
  221. package/node/find-mat/get-meta.js.map +1 -1
  222. package/node/find-mat/get-sharp-corners.d.ts +3 -3
  223. package/node/find-mat/get-sharp-corners.js +2 -3
  224. package/node/find-mat/get-sharp-corners.js.map +1 -1
  225. package/node/find-mat/mat-options.d.ts +15 -15
  226. package/node/find-mat/mat-options.js +7 -4
  227. package/node/find-mat/mat-options.js.map +1 -1
  228. package/node/floyd-warshall/floyd-warshall.js +1 -1
  229. package/node/floyd-warshall/floyd-warshall.js.map +1 -1
  230. package/node/floyd-warshall/get-graph.js +2 -2
  231. package/node/floyd-warshall/get-graph.js.map +1 -1
  232. package/node/floyd-warshall/get-hole-closer-pairs.js +6 -6
  233. package/node/floyd-warshall/get-hole-closer-pairs.js.map +1 -1
  234. package/node/geometry/circle.d.ts +1 -0
  235. package/node/geometry/circle.js +1 -0
  236. package/node/geometry/circle.js.map +1 -1
  237. package/node/geometry/get-closest-square-distance-to-rect.js +1 -4
  238. package/node/geometry/get-closest-square-distance-to-rect.js.map +1 -1
  239. package/node/geometry/get-closest-squared-distance-to-rotated-rect.js +2 -1
  240. package/node/geometry/get-closest-squared-distance-to-rotated-rect.js.map +1 -1
  241. package/node/index.d.ts +1 -7
  242. package/node/index.js +1 -5
  243. package/node/index.js.map +1 -1
  244. package/node/loop/get-max-coordinate.d.ts +2 -1
  245. package/node/loop/get-max-coordinate.js +6 -8
  246. package/node/loop/get-max-coordinate.js.map +1 -1
  247. package/node/mat/add-to-cp-tree.d.ts +3 -3
  248. package/node/mat/add-to-cp-tree.js +5 -5
  249. package/node/mat/add-to-cp-tree.js.map +1 -1
  250. package/node/mat/create-new-cp-trees.d.ts +10 -0
  251. package/node/mat/create-new-cp-trees.js +24 -0
  252. package/node/mat/create-new-cp-trees.js.map +1 -0
  253. package/node/mat/curve-piece.d.ts +1 -1
  254. package/node/mat/get-boundary-piece-beziers.d.ts +3 -3
  255. package/node/mat/get-boundary-piece-beziers.js +125 -20
  256. package/node/mat/get-boundary-piece-beziers.js.map +1 -1
  257. package/node/mat/get-branches.d.ts +1 -1
  258. package/node/mat/get-closeby-cp-if-exist.d.ts +5 -5
  259. package/node/mat/get-closeby-cp-if-exist.js +6 -5
  260. package/node/mat/get-closeby-cp-if-exist.js.map +1 -1
  261. package/node/mat/get-cp-node-to-left-or-same.d.ts +4 -4
  262. package/node/mat/get-cp-node-to-left-or-same.js +4 -3
  263. package/node/mat/get-cp-node-to-left-or-same.js.map +1 -1
  264. package/node/mat/get-largest-vertex.d.ts +1 -1
  265. package/node/mat/get-largest-vertex.js +1 -1
  266. package/node/mat/get-largest-vertex.js.map +1 -1
  267. package/node/mat/mat-meta.d.ts +4 -5
  268. package/node/mat/mat.d.ts +5 -5
  269. package/node/mat/simplify-mat.js +5 -4
  270. package/node/mat/simplify-mat.js.map +1 -1
  271. package/node/mat/trim-mat.d.ts +3 -2
  272. package/node/mat/trim-mat.js +5 -3
  273. package/node/mat/trim-mat.js.map +1 -1
  274. package/node/point-on-shape/calc-pos-order.d.ts +8 -5
  275. package/node/point-on-shape/calc-pos-order.js +7 -7
  276. package/node/point-on-shape/calc-pos-order.js.map +1 -1
  277. package/node/point-on-shape/compare-poss.d.ts +4 -0
  278. package/node/point-on-shape/compare-poss.js +12 -0
  279. package/node/point-on-shape/compare-poss.js.map +1 -1
  280. package/node/point-on-shape/get-osculating-circle.d.ts +5 -6
  281. package/node/point-on-shape/get-osculating-circle.js +18 -20
  282. package/node/point-on-shape/get-osculating-circle.js.map +1 -1
  283. package/node/point-on-shape/get-pos-corner.d.ts +18 -4
  284. package/node/point-on-shape/get-pos-corner.js +6 -6
  285. package/node/point-on-shape/get-pos-corner.js.map +1 -1
  286. package/node/point-on-shape/is-pos-corner.d.ts +3 -2
  287. package/node/point-on-shape/is-pos-corner.js.map +1 -1
  288. package/node/point-on-shape/is-pos-sharp-corner.d.ts +1 -12
  289. package/node/point-on-shape/is-pos-sharp-corner.js +4 -5
  290. package/node/point-on-shape/is-pos-sharp-corner.js.map +1 -1
  291. package/node/point-on-shape/point-on-shape.d.ts +39 -6
  292. package/node/point-on-shape/pos-to-human-string.d.ts +1 -1
  293. package/node/point-on-shape/pos-to-human-string.js.map +1 -1
  294. package/node/point-on-shape/to-p.d.ts +9 -0
  295. package/node/point-on-shape/to-p.js +13 -0
  296. package/node/point-on-shape/to-p.js.map +1 -0
  297. package/node/sat/add-debug-info.d.ts +2 -1
  298. package/node/sat/add-debug-info.js +2 -1
  299. package/node/sat/add-debug-info.js.map +1 -1
  300. package/node/sat/cull-non-cycles.d.ts +2 -1
  301. package/node/sat/cull-non-cycles.js +5 -3
  302. package/node/sat/cull-non-cycles.js.map +1 -1
  303. package/node/sat/cull.js +3 -4
  304. package/node/sat/cull.js.map +1 -1
  305. package/node/sat/get-leaves.d.ts +1 -1
  306. package/node/sat/get-leaves.js +1 -2
  307. package/node/sat/get-leaves.js.map +1 -1
  308. package/node/sat/get-sat-culls.d.ts +2 -2
  309. package/node/sat/get-sat-culls.js +3 -3
  310. package/node/sat/get-sat-culls.js.map +1 -1
  311. package/node/sat/to-scale-axis.d.ts +1 -1
  312. package/node/sat/to-scale-axis.js +2 -2
  313. package/node/sat/to-scale-axis.js.map +1 -1
  314. package/node/svg/get-loop-bounds.d.ts +7 -7
  315. package/node/svg/get-loop-bounds.js +33 -70
  316. package/node/svg/get-loop-bounds.js.map +1 -1
  317. package/node/svg/get-min-y-pos.d.ts +2 -3
  318. package/node/svg/get-min-y-pos.js +2 -2
  319. package/node/svg/get-min-y-pos.js.map +1 -1
  320. package/node/svg/get-shape-bounds.d.ts +6 -6
  321. package/node/svg/get-shape-bounds.js +6 -6
  322. package/node/svg/get-shape-bounds.js.map +1 -1
  323. package/node/utils/mutable.d.ts +4 -0
  324. package/node/utils/mutable.js +2 -0
  325. package/node/utils/mutable.js.map +1 -0
  326. package/node/utils/sum.js.map +1 -1
  327. package/node/utils/time-function-call.d.ts +14 -0
  328. package/node/utils/time-function-call.js +32 -0
  329. package/node/utils/time-function-call.js.map +1 -0
  330. package/node/vertex/remove-vertex.d.ts +1 -0
  331. package/node/vertex/remove-vertex.js +1 -1
  332. package/node/vertex/remove-vertex.js.map +1 -1
  333. package/package.json +6 -9
  334. package/src/add-n-prong.ts/join-spokes.ts +8 -6
  335. package/src/closest-boundary-point/{cull-bezier-pieces.ts → cull-bezier-pieces-1.ts} +7 -7
  336. package/src/closest-boundary-point/cull-by-loose-bounding-box.ts +15 -14
  337. package/src/closest-boundary-point/cull-by-tight-boundary-box.ts +2 -2
  338. package/src/closest-boundary-point/foot-and-endpoint-info.ts +5 -10
  339. package/src/closest-boundary-point/get-best-distance-squared.ts +18 -15
  340. package/src/closest-boundary-point/get-close-boundary-points-certified.ts +25 -31
  341. package/src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts +41 -102
  342. package/src/closest-boundary-point/root-interval-to-distance-squared-interval.ts +7 -12
  343. package/src/corner/compare-curvatures-at-interface.ts +1 -1
  344. package/src/corner/corner.ts +7 -6
  345. package/src/corner/get-corner.ts +4 -11
  346. package/src/corner/get-interface-ccw.ts +5 -5
  347. package/src/cp-node/cp-node-fs.ts +0 -5
  348. package/src/cp-node/cp-node.ts +12 -10
  349. package/src/cp-node/fs/add-distance-from.ts +1 -2
  350. package/src/cp-node/fs/clone.ts +2 -1
  351. package/src/cp-node/fs/cp-node-comparator.ts +2 -2
  352. package/src/cp-node/fs/enhance-cp-node.ts +5 -5
  353. package/src/cp-node/fs/get-boundary-bezier-parts-to-next.ts +2 -2
  354. package/src/cp-node/fs/get-cp-node-ordering.ts +4 -4
  355. package/src/cp-node/fs/get-edge-direction.ts +3 -3
  356. package/src/cp-node/fs/get-hole-closers.ts +1 -1
  357. package/src/cp-node/fs/get-implied-boundary-bezier-between.ts +2 -2
  358. package/src/cp-node/fs/get-mat-curve-between.ts +8 -6
  359. package/src/cp-node/fs/get-salience.ts +4 -4
  360. package/src/cp-node/fs/insert-cp-node.ts +12 -12
  361. package/src/cp-node/fs/is-one-prong.ts +3 -14
  362. package/src/cp-node/fs/is-order-correct.ts +8 -10
  363. package/src/cp-node/fs/is-sharp.ts +1 -1
  364. package/src/cp-node/fs/remove-cp-node.ts +4 -6
  365. package/src/cp-node/fs/traverse-cp.ts +1 -1
  366. package/src/cp-node/fs/traverse-vertices.ts +1 -2
  367. package/src/cp-node/stringification/cp-node-stringifyable.ts +7 -16
  368. package/src/cp-node/stringification/from-stringifyable.ts +6 -6
  369. package/src/cp-node/stringification/to-stringifyable.ts +5 -9
  370. package/src/debug/debug-elem-types.ts +2 -3
  371. package/src/{mat → debug}/elem-type-two-prong.ts +1 -1
  372. package/src/debug/functions/check-ordering.ts +13 -17
  373. package/src/debug/functions/cmp-cp-on-delta.ts +3 -3
  374. package/src/debug/functions/draw-elem/draw-branch.ts +1 -3
  375. package/src/debug/functions/draw-elem/draw-cp-node.ts +5 -6
  376. package/src/debug/functions/draw-elem/draw-elem.ts +1 -5
  377. package/src/debug/functions/draw-elem/draw-leaves.ts +5 -5
  378. package/src/debug/functions/draw-elem/draw-mat.ts +2 -5
  379. package/src/debug/functions/draw-elem/draw-max-vertex.ts +3 -3
  380. package/src/debug/functions/draw-elem/draw-min-y.ts +2 -2
  381. package/src/debug/functions/draw-elem/draw-one-prong-at-dull-corner.ts +17 -3
  382. package/src/debug/functions/draw-elem/draw-one-prong.ts +10 -8
  383. package/src/debug/functions/draw-elem/draw-three-prong.ts +5 -5
  384. package/src/debug/functions/draw-elem/draw-two-prong.ts +4 -3
  385. package/src/debug/functions/draw-elem/draw-vertex.ts +2 -5
  386. package/src/debug/functions/draw-elem/one-prong-at-dull-corner.ts +2 -2
  387. package/src/debug/functions/general.ts +1 -1
  388. package/src/debug/functions/three-prong.ts +220 -220
  389. package/src/error-analysis/gamma.ts +9 -2
  390. package/src/find-2-prong/add-1-prong.ts +8 -8
  391. package/src/find-2-prong/add-2-prong.ts +64 -58
  392. package/src/find-2-prong/calc-seperation-tolerance.ts +4 -8
  393. package/src/find-2-prong/cull-bezier-pieces.ts +41 -21
  394. package/src/find-2-prong/find-2-prong.ts +105 -153
  395. package/src/find-2-prong/find-and-add-2-prong.ts +23 -23
  396. package/src/find-2-prong/find-and-add-2-prongs-on-all-loops.ts +4 -6
  397. package/src/find-2-prong/find-and-add-2-prongs.ts +44 -29
  398. package/src/find-2-prong/find-and-add-hole-closing-2-prongs.ts +15 -15
  399. package/src/find-2-prong/get-initial-bezier-pieces.ts +21 -24
  400. package/src/find-2-prong/get-initial-x.ts +52 -0
  401. package/src/find-2-prong/get-medial/antipodal-point.ts +12 -0
  402. package/src/find-2-prong/get-medial/get-antipodal-points.ts +63 -0
  403. package/src/find-2-prong/get-medial/get-closest-points.ts +211 -0
  404. package/src/find-2-prong/reduce-radius.ts +38 -61
  405. package/src/find-2-prong/x-for-debugging.ts +9 -9
  406. package/src/{find-3-prong.ts → find-3-prong}/calc-better-x.ts +23 -13
  407. package/src/{find-3-prong.ts → find-3-prong}/calc-initial-3-prong-center.ts +12 -15
  408. package/src/{find-3-prong.ts → find-3-prong}/find-3-prong-for-delta3s.ts +64 -51
  409. package/src/find-3-prong/find-3-prong.ts +52 -0
  410. package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.ts +20 -6
  411. package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.ts +7 -23
  412. package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.ts +6 -4
  413. package/src/{find-3-prong.ts → find-3-prong}/get-closest-points.ts +6 -5
  414. package/src/find-3-prong/three-prong-info.ts +13 -0
  415. package/src/find-3-prong/timed-cc.ts +9 -0
  416. package/src/find-mat/clip-options.ts +11 -16
  417. package/src/find-mat/create-initial-cp-tree.ts +29 -34
  418. package/src/find-mat/find-mat.ts +15 -23
  419. package/src/find-mat/find-mats.ts +11 -13
  420. package/src/find-mat/fix-ordering.ts +58 -58
  421. package/src/find-mat/get-dull-corners-on-loop.ts +12 -10
  422. package/src/find-mat/get-for-1-prongs-on-loop.ts +11 -33
  423. package/src/find-mat/get-for-2-prongs-on-loop.ts +9 -12
  424. package/src/find-mat/get-meta.ts +18 -16
  425. package/src/find-mat/get-sharp-corners.ts +7 -8
  426. package/src/find-mat/mat-options.ts +22 -19
  427. package/src/floyd-warshall/floyd-warshall.ts +1 -1
  428. package/src/floyd-warshall/get-graph.ts +2 -2
  429. package/src/floyd-warshall/get-hole-closer-pairs.ts +6 -6
  430. package/src/geometry/circle.ts +1 -0
  431. package/src/geometry/get-closest-square-distance-to-rect.ts +3 -8
  432. package/src/geometry/get-closest-squared-distance-to-rotated-rect.ts +3 -2
  433. package/src/index.ts +2 -8
  434. package/src/loop/get-max-coordinate.ts +8 -9
  435. package/src/mat/add-to-cp-tree.ts +10 -11
  436. package/src/mat/clone-mat.ts +8 -4
  437. package/src/mat/clone-meta.ts +22 -10
  438. package/src/mat/create-new-cp-trees.ts +35 -0
  439. package/src/mat/curve-piece.ts +1 -1
  440. package/src/mat/get-boundary-piece-beziers.ts +153 -37
  441. package/src/mat/get-branches.ts +1 -1
  442. package/src/mat/get-closeby-cp-if-exist.ts +11 -12
  443. package/src/mat/get-cp-node-to-left-or-same.ts +9 -8
  444. package/src/mat/get-largest-3-prong.ts +2 -2
  445. package/src/mat/get-largest-vertex.ts +2 -2
  446. package/src/mat/mat-meta.ts +5 -4
  447. package/src/mat/mat.ts +5 -5
  448. package/src/mat/simplify-mat.ts +5 -4
  449. package/src/mat/trim-mat.ts +6 -4
  450. package/src/point-on-shape/calc-pos-order.ts +10 -11
  451. package/src/point-on-shape/compare-poss.ts +11 -1
  452. package/src/point-on-shape/get-osculating-circle.ts +26 -28
  453. package/src/point-on-shape/get-pos-corner.ts +14 -12
  454. package/src/point-on-shape/is-pos-corner.ts +1 -4
  455. package/src/point-on-shape/is-pos-dull-corner.ts +9 -9
  456. package/src/point-on-shape/is-pos-quite-dull-corner.ts +7 -6
  457. package/src/point-on-shape/is-pos-quite-sharp-corner.ts +7 -6
  458. package/src/point-on-shape/is-pos-sharp-corner.ts +6 -5
  459. package/src/point-on-shape/point-on-shape.ts +44 -6
  460. package/src/point-on-shape/pos-to-human-string.ts +4 -2
  461. package/src/point-on-shape/to-p.ts +19 -0
  462. package/src/sat/add-debug-info.ts +3 -3
  463. package/src/sat/cull-non-cycles.ts +8 -6
  464. package/src/sat/cull.ts +7 -8
  465. package/src/sat/get-leaves.ts +2 -4
  466. package/src/sat/get-sat-culls.ts +6 -5
  467. package/src/sat/to-scale-axis.ts +4 -5
  468. package/src/svg/get-loop-bounds.ts +61 -86
  469. package/src/svg/get-min-y-pos.ts +3 -4
  470. package/src/svg/get-shape-bounds.ts +12 -12
  471. package/src/sweep-line/are-boxes-intersecting.ts +3 -2
  472. package/src/utils/mutable.ts +7 -0
  473. package/src/utils/rad-to-deg.ts +1 -1
  474. package/src/utils/smart-log.ts +20 -0
  475. package/src/utils/sum.ts +3 -1
  476. package/src/utils/time-function-call.ts +53 -0
  477. package/src/vertex/remove-vertex.ts +1 -3
  478. package/wallaby.mjs +1 -0
  479. package/.eslintrc.cjs +0 -69
  480. package/__tests__/cp-node/fs/get-avg-speed.spec.ts +0 -7
  481. package/__tests__/cp-node/fs/get-smoothed-speed.spec.ts +0 -7
  482. package/__tests__/cp-node/fs/get-smoothed.spec.ts +0 -7
  483. package/__tests__/cp-node/fs/get-speed.spec.ts +0 -7
  484. package/__tests__/cp-node/fs/is-order-correct.spec.ts +0 -7
  485. package/node/bezier/fit-quads-to-cubic.d.ts +0 -19
  486. package/node/bezier/fit-quads-to-cubic.js +0 -83
  487. package/node/bezier/fit-quads-to-cubic.js.map +0 -1
  488. package/node/bezier/total-curvature.d.ts +0 -14
  489. package/node/bezier/total-curvature.js +0 -5
  490. package/node/bezier/total-curvature.js.map +0 -1
  491. package/node/bezier/total-length.d.ts +0 -14
  492. package/node/bezier/total-length.js +0 -5
  493. package/node/bezier/total-length.js.map +0 -1
  494. package/node/closest-boundary-point/cull-bezier-pieces.d.ts +0 -10
  495. package/node/closest-boundary-point/cull-bezier-pieces.js.map +0 -1
  496. package/node/closest-boundary-point/dd-deflate-with-running-error.d.ts +0 -25
  497. package/node/closest-boundary-point/dd-deflate-with-running-error.js +0 -68
  498. package/node/closest-boundary-point/dd-deflate-with-running-error.js.map +0 -1
  499. package/node/closest-boundary-point/get-p-from-box.d.ts +0 -3
  500. package/node/closest-boundary-point/get-p-from-box.js +0 -11
  501. package/node/closest-boundary-point/get-p-from-box.js.map +0 -1
  502. package/node/contact-point/contact-point.d.ts +0 -26
  503. package/node/contact-point/contact-point.js +0 -22
  504. package/node/contact-point/contact-point.js.map +0 -1
  505. package/node/cp-node/fs/get-smoothed-speed.d.ts +0 -14
  506. package/node/cp-node/fs/get-smoothed-speed.js +0 -75
  507. package/node/cp-node/fs/get-smoothed-speed.js.map +0 -1
  508. package/node/cp-node/fs/get-speed.d.ts +0 -15
  509. package/node/cp-node/fs/get-speed.js +0 -39
  510. package/node/cp-node/fs/get-speed.js.map +0 -1
  511. package/node/debug/cp-node-for-debugging.d.ts +0 -11
  512. package/node/debug/cp-node-for-debugging.js +0 -2
  513. package/node/debug/cp-node-for-debugging.js.map +0 -1
  514. package/node/debug/functions/draw-elem/draw-speed.d.ts +0 -4
  515. package/node/debug/functions/draw-elem/draw-speed.js +0 -21
  516. package/node/debug/functions/draw-elem/draw-speed.js.map +0 -1
  517. package/node/find-2-prong/find-and-add-2-prong.d.ts +0 -11
  518. package/node/find-2-prong/find-and-add-2-prong.js +0 -19
  519. package/node/find-2-prong/find-and-add-2-prong.js.map +0 -1
  520. package/node/find-2-prong/find-equidistant-point-on-line-dd.d.ts +0 -10
  521. package/node/find-2-prong/find-equidistant-point-on-line-dd.js +0 -56
  522. package/node/find-2-prong/find-equidistant-point-on-line-dd.js.map +0 -1
  523. package/node/find-3-prong.ts/calc-better-x.js.map +0 -1
  524. package/node/find-3-prong.ts/calc-initial-3-prong-center.d.ts +0 -13
  525. package/node/find-3-prong.ts/calc-initial-3-prong-center.js +0 -27
  526. package/node/find-3-prong.ts/calc-initial-3-prong-center.js.map +0 -1
  527. package/node/find-3-prong.ts/find-3-prong-for-delta3s.d.ts +0 -22
  528. package/node/find-3-prong.ts/find-3-prong-for-delta3s.js.map +0 -1
  529. package/node/find-3-prong.ts/find-3-prong.d.ts +0 -16
  530. package/node/find-3-prong.ts/find-3-prong.js.map +0 -1
  531. package/node/find-3-prong.ts/find-and-add-3-prong.js.map +0 -1
  532. package/node/find-3-prong.ts/find-and-add-3-prongs-on-loop.js.map +0 -1
  533. package/node/find-3-prong.ts/find-and-add-3-prongs.js.map +0 -1
  534. package/node/find-3-prong.ts/get-closest-points.d.ts +0 -9
  535. package/node/find-3-prong.ts/get-closest-points.js.map +0 -1
  536. package/node/mat/connect-hole-closers.d.ts +0 -3
  537. package/node/mat/connect-hole-closers.js +0 -5
  538. package/node/mat/connect-hole-closers.js.map +0 -1
  539. package/node/mat/create-new-cp-tree.d.ts +0 -9
  540. package/node/mat/create-new-cp-tree.js +0 -23
  541. package/node/mat/create-new-cp-tree.js.map +0 -1
  542. package/node/memoize-primitive.d.ts +0 -11
  543. package/node/memoize-primitive.js +0 -25
  544. package/node/memoize-primitive.js.map +0 -1
  545. package/node/point-on-shape/create-pos.d.ts +0 -4
  546. package/node/point-on-shape/create-pos.js +0 -11
  547. package/node/point-on-shape/create-pos.js.map +0 -1
  548. package/node/point-on-shape/is-pos-quite-sharp-corner.d.ts +0 -17
  549. package/node/point-on-shape/is-pos-quite-sharp-corner.js +0 -14
  550. package/node/point-on-shape/is-pos-quite-sharp-corner.js.map +0 -1
  551. package/src/bezier/fit-quads-to-cubic.ts +0 -103
  552. package/src/bezier/total-curvature.ts +0 -8
  553. package/src/bezier/total-length.ts +0 -8
  554. package/src/closest-boundary-point/closest-points-on-curve-precise.ts +0 -75
  555. package/src/closest-boundary-point/closest-points-on-curve.ts +0 -72
  556. package/src/closest-boundary-point/dd-deflate-with-running-error.ts +0 -88
  557. package/src/contact-point/contact-point.ts +0 -42
  558. package/src/cp-node/fs/get-avg-speed.ts +0 -31
  559. package/src/cp-node/fs/get-smoothed-speed.ts +0 -97
  560. package/src/cp-node/fs/get-smoothed.ts +0 -62
  561. package/src/cp-node/fs/get-speed.ts +0 -56
  562. package/src/curve/curve.ts +0 -35
  563. package/src/dbscan/dbscan.ts +0 -91
  564. package/src/debug/cp-node-for-debugging.ts +0 -15
  565. package/src/debug/functions/draw-elem/draw-speed.ts +0 -35
  566. package/src/debug/three-prong-for-debugging.ts +0 -58
  567. package/src/debug/two-prong-for-debugging.ts +0 -30
  568. package/src/dijkstra/dijkstra.ts +0 -418
  569. package/src/find-2-prong/find-and-add-2-prongs-on-all-paths.ts +0 -38
  570. package/src/find-2-prong/find-equidistant-point-on-line-dd.ts +0 -77
  571. package/src/find-2-prong/find-equidistant-point-on-line.ts +0 -40
  572. package/src/find-2-prong/pyth-trips.ts +0 -146
  573. package/src/find-3-prong.ts/add-3-prong.ts +0 -113
  574. package/src/find-3-prong.ts/array-set.ts +0 -47
  575. package/src/find-3-prong.ts/find-3-prong.ts +0 -48
  576. package/src/find-3-prong.ts/find-and-add-all-3-prongs.ts +0 -109
  577. package/src/find-mat/add-2-prongs-by-error.ts +0 -122
  578. package/src/find-mat/add-debug-info.ts +0 -93
  579. package/src/find-mat/cp-node-for-insertion.ts +0 -13
  580. package/src/find-mat/get-dull-corners.ts +0 -34
  581. package/src/find-mat/get-half-angles.ts +0 -95
  582. package/src/find-mat/get-size-params.ts +0 -34
  583. package/src/find-mat/get-total-by.ts +0 -27
  584. package/src/get-curve/get-curve-between.ts +0 -80
  585. package/src/get-curve/get-edge-direction.ts +0 -70
  586. package/src/mat/add-to-cp-graph.ts +0 -60
  587. package/src/mat/cmp-cp-on-delta.ts +0 -56
  588. package/src/mat/connect-hole-closers.ts +0 -9
  589. package/src/mat/create-new-cp-tree.ts +0 -32
  590. package/src/mat/get-edges-as-array.ts +0 -18
  591. package/src/mat/get-largest-three-prong.ts +0 -14
  592. package/src/mat/get-neighboring-cps.ts +0 -49
  593. package/src/mat/is-another-cp-closeby.ts +0 -69
  594. package/src/mat/simplify-mat-map-only.ts +0 -110
  595. package/src/memoize-primitive.ts +0 -31
  596. package/src/point-on-shape/create-pos.ts +0 -20
  597. package/src/sat/cull-by-salience.ts +0 -115
  598. package/src/svg/get-extreme.ts +0 -23
  599. package/src/utils/bezier-piece-to-bezier.ts +0 -13
  600. package/src/utils/sleep.ts +0 -7
  601. /package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.d.ts +0 -0
package/jest.config.cjs CHANGED
@@ -19,6 +19,7 @@ const esModules = [
19
19
  module.exports = {
20
20
  testEnvironment: 'node',
21
21
  resolver: "jest-ts-webcompat-resolver",
22
+ setupFilesAfterEnv: ['<rootDir>/__tests__/helpers/jest.setup.ts'],
22
23
  testMatch: [ "**/__tests__/**/*.spec.ts"],
23
24
  collectCoverage: false, // Make true again!
24
25
  coverageProvider: 'v8',
@@ -1,4 +1,4 @@
1
- import { CpNode } from "../cp-node/cp-node.js";
2
- import { Circle } from "../geometry/circle.js";
1
+ import type { CpNode } from "../cp-node/cp-node.js";
2
+ import type { Circle } from "../geometry/circle.js";
3
3
  declare function joinSpokes(circle: Circle, cpNodes: CpNode[]): void;
4
4
  export { joinSpokes };
@@ -2,16 +2,17 @@ function joinSpokes(circle, cpNodes) {
2
2
  cpNodes = cpNodes.slice().sort(byAngle(circle));
3
3
  const len = cpNodes.length;
4
4
  for (let i = 0; i < len; i++) {
5
- cpNodes[i].nextOnCircle = cpNodes[(i + 1) % len];
6
- cpNodes[i].prevOnCircle = cpNodes[(i - 1 + len) % len];
5
+ const cpNode = cpNodes[i];
6
+ cpNode.nextOnCircle = cpNodes[(i + 1) % len];
7
+ cpNode.prevOnCircle = cpNodes[(i - 1 + len) % len];
7
8
  }
8
9
  }
9
10
  /** @internal */
10
11
  function byAngle(circle) {
11
12
  const c = circle.center;
12
13
  return function (_a, _b) {
13
- let a = _a.cp.pointOnShape.p;
14
- let b = _b.cp.pointOnShape.p;
14
+ let a = _a.pointOnShape.p;
15
+ let b = _b.pointOnShape.p;
15
16
  // Move onto origin
16
17
  a = [a[0] - c[0], a[1] - c[1]];
17
18
  b = [b[0] - c[0], b[1] - c[1]];
@@ -1 +1 @@
1
- {"version":3,"file":"join-spokes.js","sourceRoot":"","sources":["../../src/add-n-prong.ts/join-spokes.ts"],"names":[],"mappings":"AAIA,SAAS,UAAU,CACX,MAAc,EACd,OAAiB;IAErB,OAAO,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAC,GAAG,CAAC,CAAC;IACzD,CAAC;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,OAAO,CAAC,MAAc;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,OAAO,UAAS,EAAU,EAAE,EAAU;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAE7B,mBAAmB;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElC,OAAO,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,UAAU,EAAE,CAAA"}
1
+ {"version":3,"file":"join-spokes.js","sourceRoot":"","sources":["../../src/add-n-prong.ts/join-spokes.ts"],"names":[],"mappings":"AAKA,SAAS,UAAU,CACX,MAAc,EACd,OAAiB;IAErB,OAAO,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAoB,CAAC;QAC7C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAC,GAAG,CAAC,CAAC;IACrD,CAAC;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,OAAO,CAAC,MAAc;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,OAAO,UAAS,EAAU,EAAE,EAAU;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAE1B,mBAAmB;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElC,OAAO,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,UAAU,EAAE,CAAA"}
@@ -0,0 +1,9 @@
1
+ import type { CurvePiece } from '../mat/curve-piece.js';
2
+ /**
3
+ * @param curvePieces
4
+ * @param xO
5
+ *
6
+ * @internal
7
+ */
8
+ declare function cullCurvePieces1(curvePieces: CurvePiece[], xO: number[]): CurvePiece[];
9
+ export { cullCurvePieces1 };
@@ -3,16 +3,15 @@ import { cullByLooseBoundingBox } from './cull-by-loose-bounding-box.js';
3
3
  import { cullByTightBoundingBox } from './cull-by-tight-boundary-box.js';
4
4
  /**
5
5
  * @param curvePieces
6
- * @param p
7
- * @param extreme
6
+ * @param xO
8
7
  *
9
8
  * @internal
10
9
  */
11
- function cullCurvePieces1(curvePieces, p) {
12
- const bestSquaredDistance = getBestDistanceSquared(curvePieces, p);
13
- curvePieces = cullByLooseBoundingBox(curvePieces, p, bestSquaredDistance);
14
- curvePieces = cullByTightBoundingBox(curvePieces, p, bestSquaredDistance);
10
+ function cullCurvePieces1(curvePieces, xO) {
11
+ const bestSquaredDistance = getBestDistanceSquared(curvePieces, xO);
12
+ curvePieces = cullByLooseBoundingBox(curvePieces, xO, bestSquaredDistance);
13
+ curvePieces = cullByTightBoundingBox(curvePieces, xO, bestSquaredDistance);
15
14
  return curvePieces;
16
15
  }
17
16
  export { cullCurvePieces1 };
18
- //# sourceMappingURL=cull-bezier-pieces.js.map
17
+ //# sourceMappingURL=cull-bezier-pieces-1.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"cull-bezier-pieces-1.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-bezier-pieces-1.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAGzE;;;;;GAKG;AACH,SAAS,gBAAgB,CACjB,WAAyB,EACzB,EAAY;IAEhB,MAAM,mBAAmB,GAAG,sBAAsB,CAC9C,WAAW,EAAE,EAAE,CAClB,CAAC;IAEF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,EAAE,EACf,mBAAmB,CACtB,CAAC;IAEF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,EAAE,EACf,mBAAmB,CACtB,CAAC;IAGF,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}
@@ -1,11 +1,13 @@
1
- import { CurvePiece } from '../mat/curve-piece.js';
1
+ import type { CurvePiece } from '../mat/curve-piece.js';
2
2
  /**
3
- * @internal
4
3
  * When checking distances, ignore all those with closest possible distance
5
4
  * further than 'bestSquaredDistance', i.e. cull them.
5
+ *
6
6
  * @param curvePieces
7
- * @param p
8
- * @param dSquared
7
+ * @param xO
8
+ * @param xy2
9
+ *
10
+ * @internal
9
11
  */
10
- declare function cullByLooseBoundingBox(curvePieces: CurvePiece[], p: number[], dSquared: number): CurvePiece[];
12
+ declare function cullByLooseBoundingBox(curvePieces: CurvePiece[], xO: number[], xy2: number): CurvePiece[];
11
13
  export { cullByLooseBoundingBox };
@@ -1,25 +1,27 @@
1
1
  import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
2
2
  import { getBoundingBox$ } from '../geometry/get-bounding-box-.js';
3
3
  /**
4
- * @internal
5
4
  * When checking distances, ignore all those with closest possible distance
6
5
  * further than 'bestSquaredDistance', i.e. cull them.
6
+ *
7
7
  * @param curvePieces
8
- * @param p
9
- * @param dSquared
8
+ * @param xO
9
+ * @param xy2
10
+ *
11
+ * @internal
10
12
  */
11
- function cullByLooseBoundingBox(curvePieces, p, dSquared) {
12
- const candidateCurvePieces = [];
13
+ function cullByLooseBoundingBox(curvePieces, xO, xy2) {
14
+ const curvePieces_ = [];
13
15
  for (let i = 0; i < curvePieces.length; i++) {
14
16
  const curvePiece = curvePieces[i];
15
- const ps = curvePiece.curve.ps;
17
+ const { ps } = curvePiece.curve;
16
18
  const boundingBox = getBoundingBox$(ps);
17
- const d = getClosestSquareDistanceToRect(boundingBox, p);
18
- if (d <= dSquared) {
19
- candidateCurvePieces.push(curvePiece);
19
+ const d = getClosestSquareDistanceToRect(boundingBox, xO);
20
+ if (d <= xy2) {
21
+ curvePieces_.push(curvePiece);
20
22
  }
21
23
  }
22
- return candidateCurvePieces;
24
+ return curvePieces_;
23
25
  }
24
26
  export { cullByLooseBoundingBox };
25
27
  //# sourceMappingURL=cull-by-loose-bounding-box.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;;;GAOG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,CAAW,EACX,QAAgB;IAEpB,MAAM,oBAAoB,GAAG,EAAE,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAE/B,MAAM,WAAW,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAExC,MAAM,CAAC,GAAG,8BAA8B,CACpC,WAAW,EACX,CAAC,CACJ,CAAC;QACF,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YAChB,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC;IAED,OAAO,oBAAoB,CAAC;AAChC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
1
+ {"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;;;;;GASG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,EAAY,EACZ,GAAW;IAEf,MAAM,YAAY,GAAG,EAAE,CAAC;IAExB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC;QAEhC,MAAM,WAAW,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAExC,MAAM,CAAC,GAAG,8BAA8B,CACpC,WAAW,EACX,EAAE,CACL,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACX,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;IACL,CAAC;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
@@ -1,7 +1,7 @@
1
1
  import { getBoundingBoxTight } from "flo-bezier3";
2
2
  import { memoize } from "flo-memoize";
3
3
  import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
4
- const getBoundingBoxTight_ = memoize(getBoundingBoxTight);
4
+ const getBoundingBoxTight$ = memoize(getBoundingBoxTight);
5
5
  /**
6
6
  * @internal
7
7
  * When checking distances, ignore all those with closest possible distance
@@ -15,7 +15,7 @@ function cullByTightBoundingBox(curvePieces, p, bestSquaredDistance) {
15
15
  for (let i = 0; i < curvePieces.length; i++) {
16
16
  const curvePiece = curvePieces[i];
17
17
  const ps = curvePiece.curve.ps;
18
- const tightBoundingBox = getBoundingBoxTight_(ps);
18
+ const tightBoundingBox = getBoundingBoxTight$(ps);
19
19
  const d = getClosestSquaredDistanceToRotatedRect(tightBoundingBox, p);
20
20
  if (d <= bestSquaredDistance) {
21
21
  candidateCurvePieces.push(curvePiece);
@@ -1,10 +1,7 @@
1
- import { Curve } from "flo-boolean";
2
- type FootAndEndpointInfo = {
3
- curve: Curve;
4
- p: number[];
5
- t: number;
6
- d: number;
7
- box: number[][];
8
- dSquaredI: number[];
9
- };
1
+ import type { Curve } from "flo-boolean";
2
+ interface FootAndEndpointInfo {
3
+ readonly curve: Curve;
4
+ readonly t: number;
5
+ readonly dSquaredI: number[];
6
+ }
10
7
  export { FootAndEndpointInfo };
@@ -1,8 +1,9 @@
1
- import { CurvePiece } from "../mat/curve-piece.js";
1
+ import type { CurvePiece } from "../mat/curve-piece.js";
2
2
  /**
3
- * @internal
4
3
  * Finds an initial distance such that the closest point can not be further than
5
4
  * this distance away.
5
+ *
6
+ * @internal
6
7
  */
7
- declare function getBestDistanceSquared(curvePieces: CurvePiece[], p: number[]): number;
8
+ declare function getBestDistanceSquared(curvePieces: CurvePiece[], xO: number[]): number;
8
9
  export { getBestDistanceSquared };
@@ -1,24 +1,24 @@
1
1
  import { evalDeCasteljau } from 'flo-bezier3';
2
2
  import { squaredDistanceBetween } from 'flo-vector2d';
3
+ const { min } = Math;
4
+ const TOLERANCE = 1 + 2 ** -20;
3
5
  /**
4
- * @internal
5
6
  * Finds an initial distance such that the closest point can not be further than
6
7
  * this distance away.
8
+ *
9
+ * @internal
7
10
  */
8
- function getBestDistanceSquared(curvePieces, p) {
9
- let bestSquaredDistance = Number.POSITIVE_INFINITY;
11
+ function getBestDistanceSquared(curvePieces, xO) {
12
+ let bestSquaredDistance = Infinity;
10
13
  for (let i = 0; i < curvePieces.length; i++) {
11
14
  const curvePiece = curvePieces[i];
12
- const ps = curvePiece.curve.ps;
13
- const p1 = evalDeCasteljau(ps, curvePiece.ts[0]);
14
- const p2 = evalDeCasteljau(ps, curvePiece.ts[1]);
15
- const d = Math.min(squaredDistanceBetween(p, p1), squaredDistanceBetween(p, p2));
16
- if (d < bestSquaredDistance) {
17
- bestSquaredDistance = d;
18
- }
15
+ const { curve: { ps }, ts } = curvePiece;
16
+ const p1 = evalDeCasteljau(ps, ts[0]);
17
+ const p2 = evalDeCasteljau(ps, ts[1]);
18
+ bestSquaredDistance = min(bestSquaredDistance, squaredDistanceBetween(xO, p1), squaredDistanceBetween(xO, p2));
19
19
  }
20
20
  // The extra multiplier is to account for floating point precision.
21
- return (1 + 2 ** -10) * bestSquaredDistance;
21
+ return TOLERANCE * bestSquaredDistance;
22
22
  }
23
23
  export { getBestDistanceSquared };
24
24
  //# sourceMappingURL=get-best-distance-squared.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"get-best-distance-squared.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-best-distance-squared.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAItD;;;;GAIG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,CAAW;IAEf,IAAI,mBAAmB,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACnD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAE/B,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CACd,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,EAC7B,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAChC,CAAC;QAEF,IAAI,CAAC,GAAG,mBAAmB,EAAE,CAAC;YAC1B,mBAAmB,GAAG,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,mEAAmE;IACnE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC,GAAC,mBAAmB,CAAC;AAC5C,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
1
+ {"version":3,"file":"get-best-distance-squared.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-best-distance-squared.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAEtD,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGrB,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC;AAG7B;;;;;GAKG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,EAAY;IAEhB,IAAI,mBAAmB,GAAG,QAAQ,CAAC;IACnC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC;QAEzC,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtC,mBAAmB,GAAG,GAAG,CACrB,mBAAmB,EACnB,sBAAsB,CAAC,EAAE,EAAE,EAAE,CAAC,EAC9B,sBAAsB,CAAC,EAAE,EAAE,EAAE,CAAC,CACjC,CAAC;IACN,CAAC;IAED,mEAAmE;IACnE,OAAO,SAAS,GAAC,mBAAmB,CAAC;AACzC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
@@ -1,18 +1,14 @@
1
- import type { Curve } from 'flo-boolean';
2
1
  import type { CurvePiece } from '../mat/curve-piece.js';
3
- import type { PointOnShape } from '../point-on-shape/point-on-shape.js';
2
+ import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
4
3
  /**
5
- * @internal
6
4
  * Returns the closest boundary point to the given point, limited to the given
7
5
  * bezier pieces, including the beziers actually checked after culling.
8
6
  *
9
- * @param pow
7
+ * @param maxCoordPowerOf2
10
8
  * @param curvePieces
11
9
  * @param x
12
- * @param touchedCurve
13
- * @param t
14
- * @param for1Prong defaults to `false`;
15
- * @param angle defaults to `0`
10
+ *
11
+ * @internal
16
12
  */
17
- declare function getCloseBoundaryPointsCertified(pow: number, curvePieces: CurvePiece[], x: number[], touchedCurve?: Curve | undefined, t?: number | undefined, for1Prong?: boolean, angle?: number): PointOnShape[];
13
+ declare function getCloseBoundaryPointsCertified(curvePieces: CurvePiece[], x: number[]): PrePointOnShape[];
18
14
  export { getCloseBoundaryPointsCertified };
@@ -1,43 +1,47 @@
1
- import { createPos } from '../point-on-shape/create-pos.js';
2
1
  import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
3
- import { cullCurvePieces1 } from './cull-bezier-pieces.js';
2
+ import { cullCurvePieces1 } from './cull-bezier-pieces-1.js';
3
+ import { toP } from '../point-on-shape/to-p.js';
4
4
  /**
5
- * @internal
6
5
  * Returns the closest boundary point to the given point, limited to the given
7
6
  * bezier pieces, including the beziers actually checked after culling.
8
7
  *
9
- * @param pow
8
+ * @param maxCoordPowerOf2
10
9
  * @param curvePieces
11
10
  * @param x
12
- * @param touchedCurve
13
- * @param t
14
- * @param for1Prong defaults to `false`;
15
- * @param angle defaults to `0`
11
+ *
12
+ * @internal
16
13
  */
17
- function getCloseBoundaryPointsCertified(pow, curvePieces, x, touchedCurve = undefined, t = undefined, for1Prong = false, angle = 0) {
14
+ function getCloseBoundaryPointsCertified(curvePieces, x) {
18
15
  curvePieces = cullCurvePieces1(curvePieces, x);
19
- const pInfoss = [];
16
+ const pInfos = [];
20
17
  for (let i = 0; i < curvePieces.length; i++) {
21
18
  const curvePiece = curvePieces[i];
22
- const pInfos = getPotentialClosestPointsOnCurveCertified(pow, curvePiece.curve, x, curvePiece.ts, touchedCurve, t, for1Prong, angle);
23
- pInfoss.push(...pInfos);
19
+ const _pInfos = getPotentialClosestPointsOnCurveCertified(curvePiece.curve, x, curvePiece.ts);
20
+ pInfos.push(..._pInfos);
24
21
  }
25
22
  /** the minimum max interval value */
26
- let minMax = Number.POSITIVE_INFINITY;
27
- for (let i = 0; i < pInfoss.length; i++) {
28
- const diMax = pInfoss[i].dSquaredI[1];
23
+ let minMax = Infinity;
24
+ for (let i = 0; i < pInfos.length; i++) {
25
+ const diMax = pInfos[i].dSquaredI[1];
29
26
  if (diMax < minMax) {
30
27
  minMax = diMax;
31
28
  }
32
29
  }
33
30
  const closestPointInfos = [];
34
- for (let i = 0; i < pInfoss.length; i++) {
35
- const info = pInfoss[i];
31
+ for (let i = 0; i < pInfos.length; i++) {
32
+ const info = pInfos[i];
36
33
  if (info.dSquaredI[0] <= minMax) {
37
34
  closestPointInfos.push(info);
38
35
  }
39
36
  }
40
- return closestPointInfos.map(info => createPos(info.curve, info.t, false));
37
+ return closestPointInfos.map(info => {
38
+ const { curve, t } = info;
39
+ const { ps } = curve;
40
+ const p = toP(ps, t);
41
+ return {
42
+ p, t, curve, isSource: false
43
+ };
44
+ });
41
45
  }
42
46
  export { getCloseBoundaryPointsCertified };
43
47
  //# sourceMappingURL=get-close-boundary-points-certified.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"get-close-boundary-points-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-close-boundary-points-certified.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAC5D,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAG3D;;;;;;;;;;;;GAYG;AACH,SAAS,+BAA+B,CAChC,GAAW,EACX,WAAyB,EACzB,CAAW,EACX,eAAkC,SAAS,EAC3C,IAAwB,SAAS,EACjC,SAAS,GAAG,KAAK,EACjB,KAAK,GAAG,CAAC;IAEb,WAAW,GAAG,gBAAgB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAE/C,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,MAAM,GAAG,yCAAyC,CACpD,GAAG,EACH,UAAU,CAAC,KAAK,EAChB,CAAC,EACD,UAAU,CAAC,EAAE,EACb,YAAY,EACZ,CAAC,EACD,SAAS,EACT,KAAK,CACR,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,qCAAqC;IACrC,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACtC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAA0B,EAAE,CAAC;IAEpD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/E,CAAC;AAGD,OAAO,EAAE,+BAA+B,EAAE,CAAC"}
1
+ {"version":3,"file":"get-close-boundary-points-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-close-boundary-points-certified.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,GAAG,EAAE,MAAM,2BAA2B,CAAC;AAGhD;;;;;;;;;GASG;AACH,SAAS,+BAA+B,CAChC,WAAyB,EACzB,CAAW;IAEf,WAAW,GAAG,gBAAgB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAE/C,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,OAAO,GAAG,yCAAyC,CACrD,UAAU,CAAC,KAAK,EAChB,CAAC,EACD,UAAU,CAAC,EAAqB,CACnC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IAC5B,CAAC;IAED,qCAAqC;IACrC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAA0B,EAAE,CAAC;IAEpD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QAChC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;QAC1B,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;QACrB,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAErB,OAAO;YACH,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK;SAC/B,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAGD,OAAO,EAAE,+BAA+B,EAAE,CAAC"}
@@ -3,14 +3,9 @@ import type { FootAndEndpointInfo } from './foot-and-endpoint-info.js';
3
3
  /**
4
4
  * @internal
5
5
  *
6
- * @param pow
7
- * @param curve The curve
8
- * @param x The point from which to check
6
+ * @param curve the curve
7
+ * @param x the point from which to check
9
8
  * @param tRange The allowed t range
10
- * @param touchedCurve The bezier on which p is located
11
- * @param t The t value of the bezier that locates p
12
- * @param for1Prong defaults to `false;
13
- * @param angle defaults to `0`;
14
9
  */
15
- declare function getPotentialClosestPointsOnCurveCertified(pow: number, curve: Curve, x: number[], tRange?: number[], touchedCurve?: Curve | undefined, t?: number | undefined, for1Prong?: boolean, angle?: number): FootAndEndpointInfo[];
10
+ declare function getPotentialClosestPointsOnCurveCertified(curve: Curve, x: number[], tRange: [number, number]): FootAndEndpointInfo[];
16
11
  export { getPotentialClosestPointsOnCurveCertified };
@@ -1,110 +1,53 @@
1
- import { allRootsCertified } from 'flo-poly';
2
- import { eDeflate } from 'flo-poly';
3
- import { getFootPointsOnBezierPolysCertified, getIntervalBox } from 'flo-bezier3';
4
- import { ddDeflateWithRunningError } from './dd-deflate-with-running-error.js';
5
- import { γγ } from '../error-analysis/gamma.js';
1
+ import { roots } from 'flo-poly';
2
+ import { evalDeCasteljauDd, getFootPointsOnBezierPolysCertified, getIntervalBox } from 'flo-bezier3';
6
3
  import { rootIntervalToDistanceSquaredInterval } from './root-interval-to-distance-squared-interval.js';
7
- import { getPFromBox } from './get-p-from-box.js';
8
- const γγ3 = γγ(3);
9
- const { sqrt } = Math;
4
+ import { squaredDistanceBetweenDd } from "../find-2-prong/squared-distance-between-dd.js";
5
+ import { eps } from '../error-analysis/gamma.js';
10
6
  /**
11
7
  * @internal
12
8
  *
13
- * @param pow
14
- * @param curve The curve
15
- * @param x The point from which to check
9
+ * @param curve the curve
10
+ * @param x the point from which to check
16
11
  * @param tRange The allowed t range
17
- * @param touchedCurve The bezier on which p is located
18
- * @param t The t value of the bezier that locates p
19
- * @param for1Prong defaults to `false;
20
- * @param angle defaults to `0`;
21
12
  */
22
- function getPotentialClosestPointsOnCurveCertified(pow, curve, x, tRange = [0, 1], touchedCurve = undefined, t = undefined, for1Prong = false, angle = 0) {
13
+ function getPotentialClosestPointsOnCurveCertified(curve, x, tRange) {
23
14
  const [tS, tE] = tRange;
24
- const ps = curve.ps;
25
- const shouldDeflate = angle === 0 && curve === touchedCurve;
26
- let { polyDd: polyDdO, polyE: polyEO, getPolyExact: getPolyExactO } = getFootPointsOnBezierPolysCertified(ps, x);
27
- const def = shouldDeflate
28
- ? ddDeflateWithRunningError(polyDdO, polyEO.map(e => e / γγ3), t)
29
- : undefined;
30
- const def2 = for1Prong && shouldDeflate
31
- ? ddDeflateWithRunningError(def.coeffs, def.errBound.map(e => e / γγ3), t)
32
- : undefined;
33
- const def3 = for1Prong && shouldDeflate
34
- ? ddDeflateWithRunningError(def2.coeffs, def2.errBound.map(e => e / γγ3), t)
35
- : undefined;
36
- const { polyDd, polyE, getPolyExact } = def3 !== undefined
37
- ? {
38
- polyDd: def3.coeffs,
39
- polyE: def3.errBound,
40
- getPolyExact: () => eDeflate(eDeflate(eDeflate(getPolyExactO(), t), t), t)
41
- }
42
- : def !== undefined
43
- ? {
44
- polyDd: def.coeffs,
45
- polyE: def.errBound,
46
- getPolyExact: () => eDeflate(getPolyExactO(), t)
47
- }
48
- : {
49
- polyDd: polyDdO,
50
- polyE: polyEO,
51
- getPolyExact: getPolyExactO
15
+ const { ps } = curve;
16
+ const infos = [];
17
+ if (tS !== tE) {
18
+ const { polyDd: pDd, polyE: pDd_, getPolyExact } = getFootPointsOnBezierPolysCertified(ps, x);
19
+ const ris = roots(pDd, tS, tE, pDd_, getPolyExact) || [];
20
+ infos.push(...ris.map(ri => {
21
+ const { tS: ts, tE: te, t: _t } = ri;
22
+ const t = _t < 0 ? 0 : _t > 1 ? 1 : _t;
23
+ const box = getIntervalBox(ps, [ts, te]);
24
+ const dSquaredI = rootIntervalToDistanceSquaredInterval(box, x);
25
+ const t_ = t === 0 ? 1 : t;
26
+ const curve_ = t === 0 ? curve.prev : curve;
27
+ return {
28
+ curve: curve_,
29
+ t: t_,
30
+ dSquaredI
52
31
  };
53
- const ris = allRootsCertified(polyDd, tS, tE, polyE, getPolyExact);
54
- const dontPush0 = ((t === 1 && curve === touchedCurve.next) ||
55
- (t === 0 && curve === touchedCurve));
56
- const dontPush1 = ((t === 0 && curve === touchedCurve.prev) ||
57
- (t === 1 && curve === touchedCurve));
58
- if (tS === 0) {
59
- if (!dontPush0) {
60
- ris.push({ t: 0, tS: 0, tE: 0, multiplicity: 1 });
61
- }
32
+ }));
62
33
  }
63
- else if (tS === 1) {
64
- if (!dontPush1) {
65
- ris.push({ t: 1, tS: 1, tE: 1, multiplicity: 1 });
66
- }
34
+ const ts = tRange.slice();
35
+ if (tS === tE) {
36
+ ts.push(tS);
67
37
  }
68
- else {
69
- ris.push({ t: tS, tS: tS, tE: tS, multiplicity: 1 });
70
- }
71
- if (tE === 0) {
72
- if (!dontPush0) {
73
- ris.push({ t: 0, tS: 0, tE: 0, multiplicity: 1 });
74
- }
75
- }
76
- else if (tE === 1) {
77
- if (!dontPush1) {
78
- ris.push({ t: 1, tS: 1, tE: 1, multiplicity: 1 });
79
- }
80
- }
81
- else {
82
- ris.push({ t: tE, tS: tE, tE: tE, multiplicity: 1 });
83
- }
84
- const infos = ris
85
- .map(ri => {
86
- const { tS: ts, tE: te } = ri;
87
- if (te < tS || ts > tE) {
88
- return undefined;
89
- }
90
- const _t = (ts + te) / 2;
91
- const t = _t < 0 ? 0 : _t > 1 ? 1 : _t;
92
- const box = getIntervalBox(ps, [ts, te]);
93
- const p_ = getPFromBox(box);
94
- const dSquaredI = rootIntervalToDistanceSquaredInterval(pow, box, x);
38
+ infos.push(...ts.map(t => {
39
+ const p = evalDeCasteljauDd(ps, [0, t]).map(v => v[0] + v[1]);
40
+ const d = squaredDistanceBetweenDd(p, x);
41
+ const dSquaredI = [d * (1 - eps), d * (1 + eps)];
95
42
  const t_ = t === 0 ? 1 : t;
96
43
  const curve_ = t === 0 ? curve.prev : curve;
97
44
  return {
98
45
  curve: curve_,
99
- p: p_,
100
46
  t: t_,
101
- d: (sqrt(dSquaredI[0]) + sqrt(dSquaredI[1])) / 2,
102
- dSquaredI,
103
- box,
47
+ dSquaredI
104
48
  };
105
- });
106
- const infos_ = infos.filter(info => info !== undefined);
107
- return infos_;
49
+ }));
50
+ return infos;
108
51
  }
109
52
  export { getPotentialClosestPointsOnCurveCertified };
110
53
  //# sourceMappingURL=get-potential-closest-points-on-curve-certified.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"get-potential-closest-points-on-curve-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACpC,OAAO,EAAE,mCAAmC,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClF,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,EAAE,EAAE,MAAM,4BAA4B,CAAC;AAChD,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC;AACxG,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAGlD,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAElB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGtB;;;;;;;;;;;GAWG;AACH,SAAS,yCAAyC,CAC1C,GAAW,EACX,KAAY,EACZ,CAAW,EACX,SAAmB,CAAC,CAAC,EAAC,CAAC,CAAC,EACxB,eAAkC,SAAS,EAC3C,IAAwB,SAAS,EACjC,SAAS,GAAG,KAAK,EACjB,KAAK,GAAG,CAAC;IAEb,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IACvB,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;IAEpB,MAAM,aAAa,GAAG,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC;IAE5D,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,GAC/D,mCAAmC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE/C,MAAM,GAAG,GAAG,aAAa;QACjB,CAAC,CAAC,yBAAyB,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAChE,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;QAC/B,CAAC,CAAC,yBAAyB,CAAC,GAAI,CAAC,MAAM,EAAE,GAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC3E,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;QAC/B,CAAC,CAAC,yBAAyB,CAAC,IAAK,CAAC,MAAM,EAAE,IAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC7E,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAC3B,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC;YACE,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,QAAQ;YACpB,YAAY,EAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAE,CAAC,EAAE,CAAE,CAAC,EAAE,CAAE,CAAC;SACjF;QACD,CAAC,CAAC,GAAG,KAAK,SAAS;YACnB,CAAC,CAAC;gBACE,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,KAAK,EAAE,GAAG,CAAC,QAAQ;gBACnB,YAAY,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAE,CAAC;aACpD;YACD,CAAC,CAAC;gBACE,MAAM,EAAE,OAAO;gBACf,KAAK,EAAE,MAAM;gBACb,YAAY,EAAE,aAAa;aAC9B,CAAC;IAEV,MAAM,GAAG,GAAG,iBAAiB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IAEnE,MAAM,SAAS,GAAG,CACd,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAa,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,CACtC,CAAC;IACF,MAAM,SAAS,GAAG,CACd,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAa,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,CACtC,CAAC;IAEF,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,SAAS,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;IAC1E,CAAC;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;IAC1E,CAAC;SAAM,CAAC;QACJ,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,SAAS,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;IAC1E,CAAC;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;IAC1E,CAAC;SAAM,CAAC;QACJ,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,MAAM,KAAK,GAAG,GAAG;SAChB,GAAG,CAAC,EAAE,CAAC,EAAE;QACN,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;QAE9B,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACrB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAEvC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAE5B,MAAM,SAAS,GAAG,qCAAqC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAErE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAE5C,OAAO;YACH,KAAK,EAAE,MAAM;YACb,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC;YAC9C,SAAS;YACT,GAAG;SACN,CAAA;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,SAAS,CAA0B,CAAC;IAEjF,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,yCAAyC,EAAE,CAAA"}
1
+ {"version":3,"file":"get-potential-closest-points-on-curve-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,iBAAiB,EAAE,mCAAmC,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACrG,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC;AACxG,OAAO,EAAE,wBAAwB,EAAE,MAAM,gDAAgD,CAAC;AAC1F,OAAO,EAAE,GAAG,EAAE,MAAM,4BAA4B,CAAC;AAGjD;;;;;;GAMG;AACH,SAAS,yCAAyC,CAC1C,KAAY,EACZ,CAAW,EACX,MAAwB;IAE5B,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IACvB,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAErB,MAAM,KAAK,GAA0B,EAAE,CAAC;IAExC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,GAC5C,mCAAmC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;QAEzD,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACvB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;YAErC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAEvC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAEzC,MAAM,SAAS,GAAG,qCAAqC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEhE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YAE5C,OAAO;gBACH,KAAK,EAAE,MAAM;gBACb,CAAC,EAAE,EAAE;gBACL,SAAS;aACZ,CAAA;QACL,CAAC,CAAC,CAAC,CAAC;IACR,CAAC;IAED,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACrB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,MAAM,CAAC,GAAG,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzC,MAAM,SAAS,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAE7C,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAE5C,OAAO;YACH,KAAK,EAAE,MAAM;YACb,CAAC,EAAE,EAAE;YACL,SAAS;SACZ,CAAA;IACL,CAAC,CAAC,CAAC,CAAC;IAEJ,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,yCAAyC,EAAE,CAAA"}
@@ -9,5 +9,5 @@
9
9
  *
10
10
  * @internal
11
11
  */
12
- declare function rootIntervalToDistanceSquaredInterval(pow: number, box: number[][], p: number[]): number[];
12
+ declare function rootIntervalToDistanceSquaredInterval(box: number[][], p: number[]): number[];
13
13
  export { rootIntervalToDistanceSquaredInterval };
@@ -1,10 +1,5 @@
1
- import { twoDiff, eEstimate } from 'big-float-ts';
2
- import { ddMultDd, ddAddDd } from 'double-double';
3
- // We *have* to do the below to improve performance with bundlers❗ The assignee is a getter❗ The assigned is a pure function❗
4
- const estimate = eEstimate;
1
+ import { twoDiff, ddMultDd, ddAddDd } from 'double-double';
5
2
  const td = twoDiff;
6
- // const emult = eMult;
7
- // const eadd = eAdd;
8
3
  const qmq = ddMultDd;
9
4
  const qaq = ddAddDd;
10
5
  const eps = Number.EPSILON;
@@ -19,7 +14,7 @@ const eps = Number.EPSILON;
19
14
  *
20
15
  * @internal
21
16
  */
22
- function rootIntervalToDistanceSquaredInterval(pow, box, p) {
17
+ function rootIntervalToDistanceSquaredInterval(box, p) {
23
18
  const bl = box[0];
24
19
  const tr = box[1];
25
20
  const minX = bl[0];
@@ -28,8 +23,8 @@ function rootIntervalToDistanceSquaredInterval(pow, box, p) {
28
23
  const maxY = tr[1];
29
24
  const x = p[0]; // <0>
30
25
  const y = p[1]; // <0>
31
- let minDSquared = Number.POSITIVE_INFINITY;
32
- let maxDSquared = Number.NEGATIVE_INFINITY;
26
+ let minDSquared = +Infinity;
27
+ let maxDSquared = -Infinity;
33
28
  // for each corner of the interval box
34
29
  for (const [a, b] of [[minX, minY], [minX, maxY], [maxX, minY], [maxX, maxY]]) {
35
30
  /*
@@ -48,8 +43,10 @@ function rootIntervalToDistanceSquaredInterval(pow, box, p) {
48
43
  // const dc1 = estimate(dc1Exact);
49
44
  const dc1Dd = qaq(qmq(ax, ax), qmq(by, by)); // ax**2 + bx**2
50
45
  const dc1 = dc1Dd[1];
51
- const dc1Min = dc1 * (1 - 2 ** pow * eps); // distance minus max error
52
- const dc1Max = dc1 * (1 + 2 ** pow * eps); // distance plus max error
46
+ // const dc1Min = dc1*(1 - 2**maxCoordPowerOf2*eps); // distance minus max error
47
+ // const dc1Max = dc1*(1 + 2**maxCoordPowerOf2*eps); // distance plus max error
48
+ const dc1Min = dc1 * (1 - eps); // distance minus max error
49
+ const dc1Max = dc1 * (1 + eps); // distance plus max error
53
50
  if (dc1Min <= minDSquared) {
54
51
  minDSquared = dc1Min;
55
52
  }
@@ -1 +1 @@
1
- {"version":3,"file":"root-interval-to-distance-squared-interval.js","sourceRoot":"","sources":["../../src/closest-boundary-point/root-interval-to-distance-squared-interval.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAe,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAGlD,6HAA6H;AAC7H,MAAM,QAAQ,GAAG,SAAS,CAAC;AAC3B,MAAM,EAAE,GAAG,OAAO,CAAC;AACnB,uBAAuB;AACvB,qBAAqB;AACrB,MAAM,GAAG,GAAG,QAAQ,CAAC;AACrB,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;AAG3B;;;;;;;;;;GAUG;AACH,SAAS,qCAAqC,CACtC,GAAW,EACX,GAAe,EACf,CAAW;IAEf,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IAEvB,IAAI,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC3C,IAAI,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAE3C,sCAAsC;IACtC,KAAK,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACpE;;;;;;;;UAQE;QAEF,qEAAqE;QACrE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,sEAAsE;QACtE,kCAAkC;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,EAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAE,gBAAgB;QAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAErB,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,CAAC,IAAE,GAAG,GAAC,GAAG,CAAC,CAAC,CAAE,2BAA2B;QACjE,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,CAAC,IAAE,GAAG,GAAC,GAAG,CAAC,CAAC,CAAE,0BAA0B;QAEhE,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;QAED,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,CAAC,WAAW,EAAC,WAAW,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,qCAAqC,EAAE,CAAA"}
1
+ {"version":3,"file":"root-interval-to-distance-squared-interval.js","sourceRoot":"","sources":["../../src/closest-boundary-point/root-interval-to-distance-squared-interval.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAE3D,MAAM,EAAE,GAAG,OAAO,CAAC;AACnB,MAAM,GAAG,GAAG,QAAQ,CAAC;AACrB,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;AAG3B;;;;;;;;;;GAUG;AACH,SAAS,qCAAqC,CACtC,GAAe,EACf,CAAW;IAEf,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IAEvB,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAE5B,sCAAsC;IACtC,KAAK,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACpE;;;;;;;;UAQE;QAEF,qEAAqE;QACrE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,sEAAsE;QACtE,kCAAkC;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,EAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAE,gBAAgB;QAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAErB,iFAAiF;QACjF,gFAAgF;QAChF,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,2BAA2B;QAC1D,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,0BAA0B;QAEzD,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;QAED,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,CAAC,WAAW,EAAC,WAAW,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,qCAAqC,EAAE,CAAA"}
@@ -7,7 +7,7 @@
7
7
  * Precondition: The point psI evaluated at zero must === the point psO
8
8
  * evaluated at zero.
9
9
  *
10
- * // TODO - is this correct?
10
+ * // FUTURE - is this correct?
11
11
  * Exact: Returns the exact result if the bithlength of all
12
12
  * coordinates <= 53 - 5 === 48 and are bit-aligned.
13
13
  *