flo-mat 3.0.15 → 4.0.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 (572) hide show
  1. package/__tests__/cp-node/compare-cp-nodes-by-value.ts +5 -3
  2. package/__tests__/cp-node/compare-poss-by-value.ts +7 -7
  3. package/__tests__/cp-node/fs/get-all-on-circle.spec.ts +8 -8
  4. package/__tests__/cp-node/fs/is-one-prong.spec.ts +3 -3
  5. package/__tests__/cp-node/fs/is-sharp.spec.ts +1 -1
  6. package/__tests__/get-mats1.ts +29 -32
  7. package/__tests__/helpers/close-to.ts +71 -0
  8. package/__tests__/helpers/jest-extend-nearly.ts +39 -0
  9. package/__tests__/helpers/jest.setup.ts +6 -0
  10. package/__tests__/helpers/obj-or-array.ts +8 -0
  11. package/__tests__/jest-extensions.d.ts +26 -0
  12. package/__tests__/lib-load.spec.ts +1 -1
  13. package/browser/index.js +14846 -12124
  14. package/browser/index.min.js +1 -1
  15. package/jest.config.cjs +1 -0
  16. package/node/add-n-prong.ts/join-spokes.d.ts +2 -2
  17. package/node/add-n-prong.ts/join-spokes.js +5 -4
  18. package/node/add-n-prong.ts/join-spokes.js.map +1 -1
  19. package/node/closest-boundary-point/cull-bezier-pieces-1.d.ts +9 -0
  20. package/node/closest-boundary-point/{cull-bezier-pieces.js → cull-bezier-pieces-1.js} +6 -7
  21. package/node/closest-boundary-point/cull-bezier-pieces-1.js.map +1 -0
  22. package/node/closest-boundary-point/cull-by-loose-bounding-box.d.ts +7 -5
  23. package/node/closest-boundary-point/cull-by-loose-bounding-box.js +12 -10
  24. package/node/closest-boundary-point/cull-by-loose-bounding-box.js.map +1 -1
  25. package/node/closest-boundary-point/cull-by-tight-boundary-box.js +2 -2
  26. package/node/closest-boundary-point/foot-and-endpoint-info.d.ts +9 -9
  27. package/node/closest-boundary-point/get-best-distance-squared.d.ts +4 -3
  28. package/node/closest-boundary-point/get-best-distance-squared.js +11 -11
  29. package/node/closest-boundary-point/get-best-distance-squared.js.map +1 -1
  30. package/node/closest-boundary-point/get-close-boundary-points-certified.d.ts +5 -9
  31. package/node/closest-boundary-point/get-close-boundary-points-certified.js +22 -18
  32. package/node/closest-boundary-point/get-close-boundary-points-certified.js.map +1 -1
  33. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.d.ts +4 -8
  34. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js +12 -79
  35. package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js.map +1 -1
  36. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.d.ts +1 -1
  37. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js +5 -5
  38. package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js.map +1 -1
  39. package/node/corner/compare-curvatures-at-interface.d.ts +1 -1
  40. package/node/corner/compare-curvatures-at-interface.js +1 -1
  41. package/node/corner/corner.d.ts +7 -6
  42. package/node/corner/get-corner.d.ts +1 -6
  43. package/node/corner/get-corner.js +2 -9
  44. package/node/corner/get-corner.js.map +1 -1
  45. package/node/corner/get-interface-ccw.d.ts +2 -2
  46. package/node/corner/get-interface-ccw.js +4 -5
  47. package/node/corner/get-interface-ccw.js.map +1 -1
  48. package/node/cp-node/cp-node-fs.d.ts +0 -15
  49. package/node/cp-node/cp-node-fs.js +0 -4
  50. package/node/cp-node/cp-node-fs.js.map +1 -1
  51. package/node/cp-node/cp-node.d.ts +10 -10
  52. package/node/cp-node/fs/clone.js.map +1 -1
  53. package/node/cp-node/fs/cp-node-comparator.js +2 -2
  54. package/node/cp-node/fs/cp-node-comparator.js.map +1 -1
  55. package/node/cp-node/fs/enhance-cp-node.d.ts +1 -1
  56. package/node/cp-node/fs/enhance-cp-node.js +5 -5
  57. package/node/cp-node/fs/enhance-cp-node.js.map +1 -1
  58. package/node/cp-node/fs/get-boundary-bezier-parts-to-next.js +2 -2
  59. package/node/cp-node/fs/get-boundary-bezier-parts-to-next.js.map +1 -1
  60. package/node/cp-node/fs/get-cp-node-ordering.js +4 -4
  61. package/node/cp-node/fs/get-cp-node-ordering.js.map +1 -1
  62. package/node/cp-node/fs/get-edge-direction.js +3 -3
  63. package/node/cp-node/fs/get-edge-direction.js.map +1 -1
  64. package/node/cp-node/fs/get-hole-closers.d.ts +1 -1
  65. package/node/cp-node/fs/get-implied-boundary-bezier-between.js +2 -2
  66. package/node/cp-node/fs/get-implied-boundary-bezier-between.js.map +1 -1
  67. package/node/cp-node/fs/get-mat-curve-between.d.ts +1 -1
  68. package/node/cp-node/fs/get-mat-curve-between.js +6 -5
  69. package/node/cp-node/fs/get-mat-curve-between.js.map +1 -1
  70. package/node/cp-node/fs/get-salience.d.ts +1 -1
  71. package/node/cp-node/fs/get-salience.js +3 -3
  72. package/node/cp-node/fs/get-salience.js.map +1 -1
  73. package/node/cp-node/fs/insert-cp-node.d.ts +3 -3
  74. package/node/cp-node/fs/insert-cp-node.js +3 -4
  75. package/node/cp-node/fs/insert-cp-node.js.map +1 -1
  76. package/node/cp-node/fs/is-one-prong.d.ts +1 -1
  77. package/node/cp-node/fs/is-one-prong.js +2 -9
  78. package/node/cp-node/fs/is-one-prong.js.map +1 -1
  79. package/node/cp-node/fs/is-order-correct.d.ts +2 -2
  80. package/node/cp-node/fs/is-order-correct.js +5 -8
  81. package/node/cp-node/fs/is-order-correct.js.map +1 -1
  82. package/node/cp-node/fs/is-sharp.js +1 -1
  83. package/node/cp-node/fs/is-sharp.js.map +1 -1
  84. package/node/cp-node/fs/remove-cp-node.js +1 -2
  85. package/node/cp-node/fs/remove-cp-node.js.map +1 -1
  86. package/node/debug/debug-elem-types.d.ts +1 -2
  87. package/node/debug/debug-elem-types.js +1 -2
  88. package/node/debug/debug-elem-types.js.map +1 -1
  89. package/node/debug/functions/draw-elem/draw-cp-node.js +2 -2
  90. package/node/debug/functions/draw-elem/draw-cp-node.js.map +1 -1
  91. package/node/debug/functions/draw-elem/draw-elem.js +1 -5
  92. package/node/debug/functions/draw-elem/draw-elem.js.map +1 -1
  93. package/node/debug/functions/draw-elem/draw-leaves.js +2 -2
  94. package/node/debug/functions/draw-elem/draw-leaves.js.map +1 -1
  95. package/node/debug/functions/draw-elem/draw-max-vertex.d.ts +1 -1
  96. package/node/debug/functions/draw-elem/draw-max-vertex.js +1 -1
  97. package/node/debug/functions/draw-elem/draw-max-vertex.js.map +1 -1
  98. package/node/debug/functions/draw-elem/draw-one-prong-at-dull-corner.js +12 -3
  99. package/node/debug/functions/draw-elem/draw-one-prong-at-dull-corner.js.map +1 -1
  100. package/node/debug/functions/draw-elem/draw-one-prong.d.ts +2 -2
  101. package/node/debug/functions/draw-elem/draw-one-prong.js +8 -7
  102. package/node/debug/functions/draw-elem/draw-one-prong.js.map +1 -1
  103. package/node/debug/functions/draw-elem/draw-three-prong.js +2 -2
  104. package/node/debug/functions/draw-elem/draw-three-prong.js.map +1 -1
  105. package/node/debug/functions/draw-elem/draw-two-prong.js +4 -3
  106. package/node/debug/functions/draw-elem/draw-two-prong.js.map +1 -1
  107. package/node/debug/functions/draw-elem/draw-vertex.js +1 -1
  108. package/node/debug/functions/draw-elem/draw-vertex.js.map +1 -1
  109. package/node/debug/functions/general.js +1 -1
  110. package/node/debug/functions/general.js.map +1 -1
  111. package/node/find-2-prong/add-1-prong.d.ts +3 -3
  112. package/node/find-2-prong/add-1-prong.js +4 -4
  113. package/node/find-2-prong/add-1-prong.js.map +1 -1
  114. package/node/find-2-prong/add-2-prong.d.ts +10 -11
  115. package/node/find-2-prong/add-2-prong.js +42 -37
  116. package/node/find-2-prong/add-2-prong.js.map +1 -1
  117. package/node/find-2-prong/calc-seperation-tolerance.js +4 -7
  118. package/node/find-2-prong/calc-seperation-tolerance.js.map +1 -1
  119. package/node/find-2-prong/cull-bezier-pieces.d.ts +9 -7
  120. package/node/find-2-prong/cull-bezier-pieces.js +30 -15
  121. package/node/find-2-prong/cull-bezier-pieces.js.map +1 -1
  122. package/node/find-2-prong/find-2-prong.d.ts +12 -13
  123. package/node/find-2-prong/find-2-prong.js +73 -116
  124. package/node/find-2-prong/find-2-prong.js.map +1 -1
  125. package/node/find-2-prong/find-and-add-2-prongs-on-all-loops.d.ts +4 -4
  126. package/node/find-2-prong/find-and-add-2-prongs-on-all-loops.js.map +1 -1
  127. package/node/find-2-prong/find-and-add-2-prongs.d.ts +5 -4
  128. package/node/find-2-prong/find-and-add-2-prongs.js +28 -24
  129. package/node/find-2-prong/find-and-add-2-prongs.js.map +1 -1
  130. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.d.ts +6 -8
  131. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js +11 -12
  132. package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js.map +1 -1
  133. package/node/find-2-prong/get-initial-bezier-pieces.d.ts +5 -6
  134. package/node/find-2-prong/get-initial-bezier-pieces.js +8 -11
  135. package/node/find-2-prong/get-initial-bezier-pieces.js.map +1 -1
  136. package/node/find-2-prong/get-initial-x.d.ts +12 -0
  137. package/node/find-2-prong/get-initial-x.js +35 -0
  138. package/node/find-2-prong/get-initial-x.js.map +1 -0
  139. package/node/find-2-prong/get-medial/antipodal-point.d.ts +8 -0
  140. package/node/find-2-prong/get-medial/antipodal-point.js +2 -0
  141. package/node/find-2-prong/get-medial/antipodal-point.js.map +1 -0
  142. package/node/find-2-prong/get-medial/get-antipodal-points.d.ts +18 -0
  143. package/node/find-2-prong/get-medial/get-antipodal-points.js +41 -0
  144. package/node/find-2-prong/get-medial/get-antipodal-points.js.map +1 -0
  145. package/node/find-2-prong/get-medial/get-closest-points.d.ts +15 -0
  146. package/node/find-2-prong/get-medial/get-closest-points.js +163 -0
  147. package/node/find-2-prong/get-medial/get-closest-points.js.map +1 -0
  148. package/node/find-2-prong/reduce-radius.d.ts +4 -4
  149. package/node/find-2-prong/reduce-radius.js +30 -50
  150. package/node/find-2-prong/reduce-radius.js.map +1 -1
  151. package/node/find-3-prong/calc-better-x.d.ts +22 -0
  152. package/node/{find-3-prong.ts → find-3-prong}/calc-better-x.js +8 -5
  153. package/node/find-3-prong/calc-better-x.js.map +1 -0
  154. package/node/find-3-prong/calc-initial-3-prong-center.d.ts +15 -0
  155. package/node/find-3-prong/calc-initial-3-prong-center.js +26 -0
  156. package/node/find-3-prong/calc-initial-3-prong-center.js.map +1 -0
  157. package/node/find-3-prong/find-3-prong-for-delta3s.d.ts +19 -0
  158. package/node/{find-3-prong.ts → find-3-prong}/find-3-prong-for-delta3s.js +32 -34
  159. package/node/find-3-prong/find-3-prong-for-delta3s.js.map +1 -0
  160. package/node/find-3-prong/find-3-prong.d.ts +13 -0
  161. package/node/{find-3-prong.ts → find-3-prong}/find-3-prong.js +14 -9
  162. package/node/find-3-prong/find-3-prong.js.map +1 -0
  163. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.js +2 -2
  164. package/node/find-3-prong/find-and-add-3-prong.js.map +1 -0
  165. package/node/find-3-prong/find-and-add-3-prongs-on-loop.js.map +1 -0
  166. package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.js +1 -1
  167. package/node/find-3-prong/find-and-add-3-prongs.js.map +1 -0
  168. package/node/find-3-prong/get-closest-points.d.ts +10 -0
  169. package/node/{find-3-prong.ts → find-3-prong}/get-closest-points.js +5 -5
  170. package/node/find-3-prong/get-closest-points.js.map +1 -0
  171. package/node/find-3-prong/three-prong-info.d.ts +9 -0
  172. package/node/find-3-prong/three-prong-info.js +2 -0
  173. package/node/find-3-prong/three-prong-info.js.map +1 -0
  174. package/node/find-mat/clip-options.d.ts +2 -2
  175. package/node/find-mat/clip-options.js +7 -14
  176. package/node/find-mat/clip-options.js.map +1 -1
  177. package/node/find-mat/create-initial-cp-tree.d.ts +8 -7
  178. package/node/find-mat/create-initial-cp-tree.js +16 -19
  179. package/node/find-mat/create-initial-cp-tree.js.map +1 -1
  180. package/node/find-mat/find-mat.d.ts +1 -1
  181. package/node/find-mat/find-mat.js +6 -12
  182. package/node/find-mat/find-mat.js.map +1 -1
  183. package/node/find-mat/find-mats.js +7 -12
  184. package/node/find-mat/find-mats.js.map +1 -1
  185. package/node/find-mat/get-dull-corners-on-loop.d.ts +3 -3
  186. package/node/find-mat/get-dull-corners-on-loop.js +5 -4
  187. package/node/find-mat/get-dull-corners-on-loop.js.map +1 -1
  188. package/node/find-mat/get-for-1-prongs-on-loop.d.ts +7 -7
  189. package/node/find-mat/get-for-1-prongs-on-loop.js +9 -21
  190. package/node/find-mat/get-for-1-prongs-on-loop.js.map +1 -1
  191. package/node/find-mat/get-for-2-prongs-on-loop.d.ts +5 -4
  192. package/node/find-mat/get-for-2-prongs-on-loop.js +4 -6
  193. package/node/find-mat/get-for-2-prongs-on-loop.js.map +1 -1
  194. package/node/find-mat/get-meta.d.ts +1 -1
  195. package/node/find-mat/get-meta.js +12 -12
  196. package/node/find-mat/get-meta.js.map +1 -1
  197. package/node/find-mat/get-sharp-corners.d.ts +3 -3
  198. package/node/find-mat/get-sharp-corners.js +2 -3
  199. package/node/find-mat/get-sharp-corners.js.map +1 -1
  200. package/node/find-mat/mat-options.d.ts +15 -15
  201. package/node/find-mat/mat-options.js +7 -4
  202. package/node/find-mat/mat-options.js.map +1 -1
  203. package/node/floyd-warshall/floyd-warshall.js +1 -1
  204. package/node/floyd-warshall/floyd-warshall.js.map +1 -1
  205. package/node/floyd-warshall/get-graph.js +2 -2
  206. package/node/floyd-warshall/get-graph.js.map +1 -1
  207. package/node/floyd-warshall/get-hole-closer-pairs.js +6 -6
  208. package/node/floyd-warshall/get-hole-closer-pairs.js.map +1 -1
  209. package/node/geometry/circle.d.ts +1 -0
  210. package/node/geometry/circle.js +1 -0
  211. package/node/geometry/circle.js.map +1 -1
  212. package/node/geometry/get-closest-square-distance-to-rect.js +1 -4
  213. package/node/geometry/get-closest-square-distance-to-rect.js.map +1 -1
  214. package/node/geometry/get-closest-squared-distance-to-rotated-rect.js +2 -1
  215. package/node/geometry/get-closest-squared-distance-to-rotated-rect.js.map +1 -1
  216. package/node/index.d.ts +0 -7
  217. package/node/index.js +0 -5
  218. package/node/index.js.map +1 -1
  219. package/node/loop/get-max-coordinate.d.ts +2 -1
  220. package/node/loop/get-max-coordinate.js +6 -8
  221. package/node/loop/get-max-coordinate.js.map +1 -1
  222. package/node/mat/add-to-cp-tree.d.ts +3 -3
  223. package/node/mat/add-to-cp-tree.js +5 -5
  224. package/node/mat/add-to-cp-tree.js.map +1 -1
  225. package/node/mat/create-new-cp-trees.d.ts +10 -0
  226. package/node/mat/create-new-cp-trees.js +24 -0
  227. package/node/mat/create-new-cp-trees.js.map +1 -0
  228. package/node/mat/curve-piece.d.ts +1 -1
  229. package/node/mat/get-boundary-piece-beziers.d.ts +3 -3
  230. package/node/mat/get-boundary-piece-beziers.js +125 -20
  231. package/node/mat/get-boundary-piece-beziers.js.map +1 -1
  232. package/node/mat/get-branches.d.ts +1 -1
  233. package/node/mat/get-closeby-cp-if-exist.d.ts +5 -5
  234. package/node/mat/get-closeby-cp-if-exist.js +6 -5
  235. package/node/mat/get-closeby-cp-if-exist.js.map +1 -1
  236. package/node/mat/get-cp-node-to-left-or-same.d.ts +3 -3
  237. package/node/mat/get-cp-node-to-left-or-same.js +2 -2
  238. package/node/mat/get-cp-node-to-left-or-same.js.map +1 -1
  239. package/node/mat/get-largest-vertex.d.ts +1 -1
  240. package/node/mat/get-largest-vertex.js +1 -1
  241. package/node/mat/get-largest-vertex.js.map +1 -1
  242. package/node/mat/mat-meta.d.ts +2 -3
  243. package/node/mat/mat.d.ts +5 -5
  244. package/node/mat/simplify-mat.js +5 -4
  245. package/node/mat/simplify-mat.js.map +1 -1
  246. package/node/mat/trim-mat.d.ts +3 -2
  247. package/node/mat/trim-mat.js +5 -3
  248. package/node/mat/trim-mat.js.map +1 -1
  249. package/node/point-on-shape/calc-pos-order.d.ts +8 -5
  250. package/node/point-on-shape/calc-pos-order.js +7 -7
  251. package/node/point-on-shape/calc-pos-order.js.map +1 -1
  252. package/node/point-on-shape/compare-poss.d.ts +4 -0
  253. package/node/point-on-shape/compare-poss.js +12 -0
  254. package/node/point-on-shape/compare-poss.js.map +1 -1
  255. package/node/point-on-shape/get-osculating-circle.d.ts +5 -6
  256. package/node/point-on-shape/get-osculating-circle.js +17 -20
  257. package/node/point-on-shape/get-osculating-circle.js.map +1 -1
  258. package/node/point-on-shape/get-pos-corner.d.ts +18 -4
  259. package/node/point-on-shape/get-pos-corner.js +6 -6
  260. package/node/point-on-shape/get-pos-corner.js.map +1 -1
  261. package/node/point-on-shape/is-pos-corner.d.ts +3 -2
  262. package/node/point-on-shape/is-pos-corner.js.map +1 -1
  263. package/node/point-on-shape/is-pos-sharp-corner.d.ts +1 -12
  264. package/node/point-on-shape/is-pos-sharp-corner.js +4 -5
  265. package/node/point-on-shape/is-pos-sharp-corner.js.map +1 -1
  266. package/node/point-on-shape/point-on-shape.d.ts +39 -6
  267. package/node/point-on-shape/pos-to-human-string.d.ts +1 -1
  268. package/node/point-on-shape/pos-to-human-string.js.map +1 -1
  269. package/node/point-on-shape/to-p.d.ts +9 -0
  270. package/node/point-on-shape/to-p.js +13 -0
  271. package/node/point-on-shape/to-p.js.map +1 -0
  272. package/node/sat/add-debug-info.d.ts +2 -1
  273. package/node/sat/add-debug-info.js +2 -1
  274. package/node/sat/add-debug-info.js.map +1 -1
  275. package/node/sat/cull-non-cycles.d.ts +2 -1
  276. package/node/sat/cull-non-cycles.js +5 -3
  277. package/node/sat/cull-non-cycles.js.map +1 -1
  278. package/node/sat/cull.js +3 -4
  279. package/node/sat/cull.js.map +1 -1
  280. package/node/sat/get-leaves.d.ts +1 -1
  281. package/node/sat/get-leaves.js +1 -2
  282. package/node/sat/get-leaves.js.map +1 -1
  283. package/node/sat/get-sat-culls.d.ts +2 -2
  284. package/node/sat/get-sat-culls.js +3 -3
  285. package/node/sat/get-sat-culls.js.map +1 -1
  286. package/node/sat/to-scale-axis.d.ts +1 -1
  287. package/node/sat/to-scale-axis.js +2 -2
  288. package/node/sat/to-scale-axis.js.map +1 -1
  289. package/node/svg/get-loop-bounds.d.ts +7 -7
  290. package/node/svg/get-loop-bounds.js +33 -70
  291. package/node/svg/get-loop-bounds.js.map +1 -1
  292. package/node/svg/get-min-y-pos.d.ts +2 -3
  293. package/node/svg/get-min-y-pos.js +2 -2
  294. package/node/svg/get-min-y-pos.js.map +1 -1
  295. package/node/svg/get-shape-bounds.d.ts +6 -6
  296. package/node/svg/get-shape-bounds.js +6 -6
  297. package/node/svg/get-shape-bounds.js.map +1 -1
  298. package/node/utils/mutable.d.ts +4 -0
  299. package/node/utils/mutable.js +2 -0
  300. package/node/utils/mutable.js.map +1 -0
  301. package/node/utils/sum.js.map +1 -1
  302. package/node/utils/time-function-call.d.ts +14 -0
  303. package/node/utils/time-function-call.js +32 -0
  304. package/node/utils/time-function-call.js.map +1 -0
  305. package/node/vertex/remove-vertex.d.ts +1 -0
  306. package/node/vertex/remove-vertex.js +1 -1
  307. package/node/vertex/remove-vertex.js.map +1 -1
  308. package/package.json +3 -5
  309. package/src/add-n-prong.ts/join-spokes.ts +8 -6
  310. package/src/closest-boundary-point/{cull-bezier-pieces.ts → cull-bezier-pieces-1.ts} +7 -7
  311. package/src/closest-boundary-point/cull-by-loose-bounding-box.ts +15 -14
  312. package/src/closest-boundary-point/cull-by-tight-boundary-box.ts +2 -2
  313. package/src/closest-boundary-point/foot-and-endpoint-info.ts +8 -10
  314. package/src/closest-boundary-point/get-best-distance-squared.ts +18 -15
  315. package/src/closest-boundary-point/get-close-boundary-points-certified.ts +27 -31
  316. package/src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts +13 -88
  317. package/src/closest-boundary-point/root-interval-to-distance-squared-interval.ts +5 -5
  318. package/src/corner/compare-curvatures-at-interface.ts +1 -1
  319. package/src/corner/corner.ts +7 -6
  320. package/src/corner/get-corner.ts +4 -11
  321. package/src/corner/get-interface-ccw.ts +5 -5
  322. package/src/cp-node/cp-node-fs.ts +0 -5
  323. package/src/cp-node/cp-node.ts +12 -10
  324. package/src/cp-node/fs/add-distance-from.ts +1 -2
  325. package/src/cp-node/fs/clone.ts +2 -1
  326. package/src/cp-node/fs/cp-node-comparator.ts +2 -2
  327. package/src/cp-node/fs/enhance-cp-node.ts +5 -5
  328. package/src/cp-node/fs/get-boundary-bezier-parts-to-next.ts +2 -2
  329. package/src/cp-node/fs/get-cp-node-ordering.ts +4 -4
  330. package/src/cp-node/fs/get-edge-direction.ts +3 -3
  331. package/src/cp-node/fs/get-hole-closers.ts +1 -1
  332. package/src/cp-node/fs/get-implied-boundary-bezier-between.ts +2 -2
  333. package/src/cp-node/fs/get-mat-curve-between.ts +8 -6
  334. package/src/cp-node/fs/get-salience.ts +4 -4
  335. package/src/cp-node/fs/insert-cp-node.ts +10 -10
  336. package/src/cp-node/fs/is-one-prong.ts +3 -14
  337. package/src/cp-node/fs/is-order-correct.ts +6 -8
  338. package/src/cp-node/fs/is-sharp.ts +1 -1
  339. package/src/cp-node/fs/remove-cp-node.ts +4 -6
  340. package/src/cp-node/stringification/cp-node-stringifyable.ts +7 -16
  341. package/src/cp-node/stringification/from-stringifyable.ts +6 -6
  342. package/src/cp-node/stringification/to-stringifyable.ts +5 -9
  343. package/src/debug/debug-elem-types.ts +2 -3
  344. package/src/{mat → debug}/elem-type-two-prong.ts +1 -1
  345. package/src/debug/functions/check-ordering.ts +13 -16
  346. package/src/debug/functions/cmp-cp-on-delta.ts +3 -3
  347. package/src/debug/functions/draw-elem/draw-cp-node.ts +2 -2
  348. package/src/debug/functions/draw-elem/draw-elem.ts +1 -5
  349. package/src/debug/functions/draw-elem/draw-leaves.ts +2 -2
  350. package/src/debug/functions/draw-elem/draw-max-vertex.ts +3 -3
  351. package/src/debug/functions/draw-elem/draw-one-prong-at-dull-corner.ts +17 -3
  352. package/src/debug/functions/draw-elem/draw-one-prong.ts +10 -8
  353. package/src/debug/functions/draw-elem/draw-three-prong.ts +2 -2
  354. package/src/debug/functions/draw-elem/draw-two-prong.ts +4 -3
  355. package/src/debug/functions/draw-elem/draw-vertex.ts +1 -1
  356. package/src/debug/functions/draw-elem/one-prong-at-dull-corner.ts +2 -2
  357. package/src/debug/functions/general.ts +1 -1
  358. package/src/debug/functions/three-prong.ts +220 -220
  359. package/src/find-2-prong/add-1-prong.ts +8 -8
  360. package/src/find-2-prong/add-2-prong.ts +64 -58
  361. package/src/find-2-prong/calc-seperation-tolerance.ts +4 -8
  362. package/src/find-2-prong/cull-bezier-pieces.ts +41 -21
  363. package/src/find-2-prong/find-2-prong.ts +102 -151
  364. package/src/find-2-prong/find-and-add-2-prong.ts +23 -23
  365. package/src/find-2-prong/find-and-add-2-prongs-on-all-loops.ts +4 -6
  366. package/src/find-2-prong/find-and-add-2-prongs.ts +44 -29
  367. package/src/find-2-prong/find-and-add-hole-closing-2-prongs.ts +15 -15
  368. package/src/find-2-prong/get-initial-bezier-pieces.ts +21 -24
  369. package/src/find-2-prong/get-initial-x.ts +52 -0
  370. package/src/find-2-prong/get-medial/antipodal-point.ts +12 -0
  371. package/src/find-2-prong/get-medial/get-antipodal-points.ts +63 -0
  372. package/src/find-2-prong/get-medial/get-closest-points.ts +213 -0
  373. package/src/find-2-prong/reduce-radius.ts +38 -61
  374. package/src/find-2-prong/x-for-debugging.ts +9 -9
  375. package/src/{find-3-prong.ts → find-3-prong}/calc-better-x.ts +18 -11
  376. package/src/{find-3-prong.ts → find-3-prong}/calc-initial-3-prong-center.ts +12 -14
  377. package/src/{find-3-prong.ts → find-3-prong}/find-3-prong-for-delta3s.ts +46 -51
  378. package/src/find-3-prong/find-3-prong.ts +52 -0
  379. package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.ts +2 -2
  380. package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.ts +1 -1
  381. package/src/{find-3-prong.ts → find-3-prong}/get-closest-points.ts +8 -5
  382. package/src/find-3-prong/three-prong-info.ts +13 -0
  383. package/src/find-mat/clip-options.ts +11 -16
  384. package/src/find-mat/create-initial-cp-tree.ts +28 -33
  385. package/src/find-mat/find-mat.ts +10 -17
  386. package/src/find-mat/find-mats.ts +9 -13
  387. package/src/find-mat/fix-ordering.ts +58 -58
  388. package/src/find-mat/get-dull-corners-on-loop.ts +12 -10
  389. package/src/find-mat/get-for-1-prongs-on-loop.ts +11 -33
  390. package/src/find-mat/get-for-2-prongs-on-loop.ts +9 -12
  391. package/src/find-mat/get-meta.ts +16 -14
  392. package/src/find-mat/get-sharp-corners.ts +7 -8
  393. package/src/find-mat/mat-options.ts +22 -19
  394. package/src/floyd-warshall/floyd-warshall.ts +1 -1
  395. package/src/floyd-warshall/get-graph.ts +2 -2
  396. package/src/floyd-warshall/get-hole-closer-pairs.ts +6 -6
  397. package/src/geometry/circle.ts +1 -0
  398. package/src/geometry/get-closest-square-distance-to-rect.ts +3 -8
  399. package/src/geometry/get-closest-squared-distance-to-rotated-rect.ts +3 -2
  400. package/src/index.ts +0 -7
  401. package/src/loop/get-max-coordinate.ts +8 -9
  402. package/src/mat/add-to-cp-tree.ts +10 -11
  403. package/src/mat/clone-mat.ts +8 -4
  404. package/src/mat/clone-meta.ts +22 -10
  405. package/src/mat/create-new-cp-trees.ts +35 -0
  406. package/src/mat/curve-piece.ts +1 -1
  407. package/src/mat/get-boundary-piece-beziers.ts +153 -37
  408. package/src/mat/get-branches.ts +1 -1
  409. package/src/mat/get-closeby-cp-if-exist.ts +11 -12
  410. package/src/mat/get-cp-node-to-left-or-same.ts +5 -5
  411. package/src/mat/get-largest-3-prong.ts +2 -2
  412. package/src/mat/get-largest-vertex.ts +2 -2
  413. package/src/mat/mat-meta.ts +3 -2
  414. package/src/mat/mat.ts +5 -5
  415. package/src/mat/simplify-mat.ts +5 -4
  416. package/src/mat/trim-mat.ts +6 -4
  417. package/src/point-on-shape/calc-pos-order.ts +10 -11
  418. package/src/point-on-shape/compare-poss.ts +11 -1
  419. package/src/point-on-shape/get-osculating-circle.ts +25 -28
  420. package/src/point-on-shape/get-pos-corner.ts +14 -12
  421. package/src/point-on-shape/is-pos-corner.ts +1 -4
  422. package/src/point-on-shape/is-pos-dull-corner.ts +9 -9
  423. package/src/point-on-shape/is-pos-quite-dull-corner.ts +7 -6
  424. package/src/point-on-shape/is-pos-quite-sharp-corner.ts +7 -6
  425. package/src/point-on-shape/is-pos-sharp-corner.ts +6 -5
  426. package/src/point-on-shape/point-on-shape.ts +44 -6
  427. package/src/point-on-shape/pos-to-human-string.ts +4 -2
  428. package/src/point-on-shape/to-p.ts +19 -0
  429. package/src/sat/add-debug-info.ts +3 -3
  430. package/src/sat/cull-non-cycles.ts +8 -6
  431. package/src/sat/cull.ts +7 -8
  432. package/src/sat/get-leaves.ts +2 -4
  433. package/src/sat/get-sat-culls.ts +6 -5
  434. package/src/sat/to-scale-axis.ts +4 -5
  435. package/src/svg/get-loop-bounds.ts +61 -86
  436. package/src/svg/get-min-y-pos.ts +3 -4
  437. package/src/svg/get-shape-bounds.ts +12 -12
  438. package/src/sweep-line/are-boxes-intersecting.ts +3 -2
  439. package/src/utils/mutable.ts +7 -0
  440. package/src/utils/rad-to-deg.ts +1 -1
  441. package/src/utils/smart-log.ts +20 -0
  442. package/src/utils/sum.ts +3 -1
  443. package/src/utils/time-function-call.ts +53 -0
  444. package/src/vertex/remove-vertex.ts +1 -3
  445. package/.eslintrc.cjs +0 -69
  446. package/__tests__/cp-node/fs/get-avg-speed.spec.ts +0 -7
  447. package/__tests__/cp-node/fs/get-smoothed-speed.spec.ts +0 -7
  448. package/__tests__/cp-node/fs/get-smoothed.spec.ts +0 -7
  449. package/__tests__/cp-node/fs/get-speed.spec.ts +0 -7
  450. package/__tests__/cp-node/fs/is-order-correct.spec.ts +0 -7
  451. package/node/bezier/fit-quads-to-cubic.d.ts +0 -19
  452. package/node/bezier/fit-quads-to-cubic.js +0 -83
  453. package/node/bezier/fit-quads-to-cubic.js.map +0 -1
  454. package/node/bezier/total-curvature.d.ts +0 -14
  455. package/node/bezier/total-curvature.js +0 -5
  456. package/node/bezier/total-curvature.js.map +0 -1
  457. package/node/bezier/total-length.d.ts +0 -14
  458. package/node/bezier/total-length.js +0 -5
  459. package/node/bezier/total-length.js.map +0 -1
  460. package/node/closest-boundary-point/cull-bezier-pieces.d.ts +0 -10
  461. package/node/closest-boundary-point/cull-bezier-pieces.js.map +0 -1
  462. package/node/closest-boundary-point/dd-deflate-with-running-error.d.ts +0 -25
  463. package/node/closest-boundary-point/dd-deflate-with-running-error.js +0 -68
  464. package/node/closest-boundary-point/dd-deflate-with-running-error.js.map +0 -1
  465. package/node/contact-point/contact-point.d.ts +0 -26
  466. package/node/contact-point/contact-point.js +0 -22
  467. package/node/contact-point/contact-point.js.map +0 -1
  468. package/node/cp-node/fs/get-smoothed-speed.d.ts +0 -14
  469. package/node/cp-node/fs/get-smoothed-speed.js +0 -75
  470. package/node/cp-node/fs/get-smoothed-speed.js.map +0 -1
  471. package/node/cp-node/fs/get-speed.d.ts +0 -15
  472. package/node/cp-node/fs/get-speed.js +0 -39
  473. package/node/cp-node/fs/get-speed.js.map +0 -1
  474. package/node/debug/cp-node-for-debugging.d.ts +0 -11
  475. package/node/debug/cp-node-for-debugging.js +0 -2
  476. package/node/debug/cp-node-for-debugging.js.map +0 -1
  477. package/node/debug/functions/draw-elem/draw-speed.d.ts +0 -4
  478. package/node/debug/functions/draw-elem/draw-speed.js +0 -21
  479. package/node/debug/functions/draw-elem/draw-speed.js.map +0 -1
  480. package/node/error-analysis/gamma.d.ts +0 -26
  481. package/node/error-analysis/gamma.js +0 -35
  482. package/node/error-analysis/gamma.js.map +0 -1
  483. package/node/find-2-prong/find-and-add-2-prong.d.ts +0 -11
  484. package/node/find-2-prong/find-and-add-2-prong.js +0 -19
  485. package/node/find-2-prong/find-and-add-2-prong.js.map +0 -1
  486. package/node/find-2-prong/find-equidistant-point-on-line-dd.d.ts +0 -10
  487. package/node/find-2-prong/find-equidistant-point-on-line-dd.js +0 -56
  488. package/node/find-2-prong/find-equidistant-point-on-line-dd.js.map +0 -1
  489. package/node/find-3-prong.ts/calc-better-x.d.ts +0 -19
  490. package/node/find-3-prong.ts/calc-better-x.js.map +0 -1
  491. package/node/find-3-prong.ts/calc-initial-3-prong-center.d.ts +0 -13
  492. package/node/find-3-prong.ts/calc-initial-3-prong-center.js +0 -27
  493. package/node/find-3-prong.ts/calc-initial-3-prong-center.js.map +0 -1
  494. package/node/find-3-prong.ts/find-3-prong-for-delta3s.d.ts +0 -22
  495. package/node/find-3-prong.ts/find-3-prong-for-delta3s.js.map +0 -1
  496. package/node/find-3-prong.ts/find-3-prong.d.ts +0 -16
  497. package/node/find-3-prong.ts/find-3-prong.js.map +0 -1
  498. package/node/find-3-prong.ts/find-and-add-3-prong.js.map +0 -1
  499. package/node/find-3-prong.ts/find-and-add-3-prongs-on-loop.js.map +0 -1
  500. package/node/find-3-prong.ts/find-and-add-3-prongs.js.map +0 -1
  501. package/node/find-3-prong.ts/get-closest-points.d.ts +0 -9
  502. package/node/find-3-prong.ts/get-closest-points.js.map +0 -1
  503. package/node/mat/connect-hole-closers.d.ts +0 -3
  504. package/node/mat/connect-hole-closers.js +0 -5
  505. package/node/mat/connect-hole-closers.js.map +0 -1
  506. package/node/mat/create-new-cp-tree.d.ts +0 -9
  507. package/node/mat/create-new-cp-tree.js +0 -23
  508. package/node/mat/create-new-cp-tree.js.map +0 -1
  509. package/node/memoize-primitive.d.ts +0 -11
  510. package/node/memoize-primitive.js +0 -25
  511. package/node/memoize-primitive.js.map +0 -1
  512. package/node/point-on-shape/create-pos.d.ts +0 -4
  513. package/node/point-on-shape/create-pos.js +0 -11
  514. package/node/point-on-shape/create-pos.js.map +0 -1
  515. package/node/point-on-shape/is-pos-quite-sharp-corner.d.ts +0 -17
  516. package/node/point-on-shape/is-pos-quite-sharp-corner.js +0 -14
  517. package/node/point-on-shape/is-pos-quite-sharp-corner.js.map +0 -1
  518. package/src/bezier/fit-quads-to-cubic.ts +0 -103
  519. package/src/bezier/total-curvature.ts +0 -8
  520. package/src/bezier/total-length.ts +0 -8
  521. package/src/closest-boundary-point/closest-points-on-curve-precise.ts +0 -75
  522. package/src/closest-boundary-point/closest-points-on-curve.ts +0 -72
  523. package/src/closest-boundary-point/dd-deflate-with-running-error.ts +0 -88
  524. package/src/contact-point/contact-point.ts +0 -42
  525. package/src/cp-node/fs/get-avg-speed.ts +0 -31
  526. package/src/cp-node/fs/get-smoothed-speed.ts +0 -97
  527. package/src/cp-node/fs/get-smoothed.ts +0 -62
  528. package/src/cp-node/fs/get-speed.ts +0 -56
  529. package/src/curve/curve.ts +0 -35
  530. package/src/dbscan/dbscan.ts +0 -91
  531. package/src/debug/cp-node-for-debugging.ts +0 -15
  532. package/src/debug/functions/draw-elem/draw-speed.ts +0 -35
  533. package/src/debug/three-prong-for-debugging.ts +0 -58
  534. package/src/debug/two-prong-for-debugging.ts +0 -30
  535. package/src/dijkstra/dijkstra.ts +0 -418
  536. package/src/find-2-prong/find-and-add-2-prongs-on-all-paths.ts +0 -38
  537. package/src/find-2-prong/find-equidistant-point-on-line-dd.ts +0 -77
  538. package/src/find-2-prong/find-equidistant-point-on-line.ts +0 -40
  539. package/src/find-2-prong/pyth-trips.ts +0 -146
  540. package/src/find-3-prong.ts/add-3-prong.ts +0 -113
  541. package/src/find-3-prong.ts/array-set.ts +0 -47
  542. package/src/find-3-prong.ts/find-3-prong.ts +0 -48
  543. package/src/find-3-prong.ts/find-and-add-all-3-prongs.ts +0 -109
  544. package/src/find-mat/add-2-prongs-by-error.ts +0 -122
  545. package/src/find-mat/add-debug-info.ts +0 -93
  546. package/src/find-mat/cp-node-for-insertion.ts +0 -13
  547. package/src/find-mat/get-dull-corners.ts +0 -34
  548. package/src/find-mat/get-half-angles.ts +0 -95
  549. package/src/find-mat/get-size-params.ts +0 -34
  550. package/src/find-mat/get-total-by.ts +0 -27
  551. package/src/get-curve/get-curve-between.ts +0 -80
  552. package/src/get-curve/get-edge-direction.ts +0 -70
  553. package/src/mat/add-to-cp-graph.ts +0 -60
  554. package/src/mat/cmp-cp-on-delta.ts +0 -56
  555. package/src/mat/connect-hole-closers.ts +0 -9
  556. package/src/mat/create-new-cp-tree.ts +0 -32
  557. package/src/mat/get-edges-as-array.ts +0 -18
  558. package/src/mat/get-largest-three-prong.ts +0 -14
  559. package/src/mat/get-neighboring-cps.ts +0 -49
  560. package/src/mat/is-another-cp-closeby.ts +0 -69
  561. package/src/mat/simplify-mat-map-only.ts +0 -110
  562. package/src/memoize-primitive.ts +0 -31
  563. package/src/point-on-shape/create-pos.ts +0 -20
  564. package/src/sat/cull-by-salience.ts +0 -115
  565. package/src/svg/get-extreme.ts +0 -23
  566. package/src/utils/bezier-piece-to-bezier.ts +0 -13
  567. package/src/utils/sleep.ts +0 -7
  568. /package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prong.d.ts +0 -0
  569. /package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.d.ts +0 -0
  570. /package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.js +0 -0
  571. /package/node/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs.d.ts +0 -0
  572. /package/src/{find-3-prong.ts → find-3-prong}/find-and-add-3-prongs-on-loop.ts +0 -0
@@ -9,6 +9,7 @@ function scaleCircle(circle, s) {
9
9
  }
10
10
  /**
11
11
  * Returns true if the first circle engulfs the second.
12
+ *
12
13
  * @param c1
13
14
  * @param c2
14
15
  */
@@ -1 +1 @@
1
- {"version":3,"file":"circle.js","sourceRoot":"","sources":["../../src/geometry/circle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAYtD;;;;GAIG;AACH,SAAS,WAAW,CAAC,MAAc,EAAE,CAAS;IAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;AAChE,CAAC;AAGD;;;;GAIG;AACH,SAAS,aAAa,CAAC,EAAU,EAAE,EAAU;IACzC,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;IACjC,MAAM,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC;IAEhB,OAAO,CAAC,GAAG,CAAC,CAAC;AACjB,CAAC;AAID,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAA"}
1
+ {"version":3,"file":"circle.js","sourceRoot":"","sources":["../../src/geometry/circle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAYtD;;;;GAIG;AACH,SAAS,WAAW,CAAC,MAAc,EAAE,CAAS;IAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;AAChE,CAAC;AAGD;;;;;GAKG;AACH,SAAS,aAAa,CAAC,EAAU,EAAE,EAAU;IACzC,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;IACjC,MAAM,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC;IAEhB,OAAO,CAAC,GAAG,CAAC,CAAC;AACjB,CAAC;AAID,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAA"}
@@ -1,5 +1,4 @@
1
- import { squaredDistanceBetween as squaredDistanceBetween_ } from 'flo-vector2d';
2
- const squaredDistanceBetween = squaredDistanceBetween_;
1
+ import { squaredDistanceBetween } from 'flo-vector2d';
3
2
  /**
4
3
  * @internal
5
4
  */
@@ -12,8 +11,6 @@ function getClosestSquareDistanceToRect(box, p) {
12
11
  const y1 = p1[1];
13
12
  const xp = p[0];
14
13
  const yp = p[1];
15
- //let [[x0,y0],[x1,y1]] = box;
16
- //let [xp,yp] = p;
17
14
  if (xp < x0) {
18
15
  if (yp < y0) {
19
16
  return squaredDistanceBetween(box[0], p);
@@ -1 +1 @@
1
- {"version":3,"file":"get-closest-square-distance-to-rect.js","sourceRoot":"","sources":["../../src/geometry/get-closest-square-distance-to-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,IAAI,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAEjF,MAAM,sBAAsB,GAAG,uBAAuB,CAAC;AAGvD;;GAEG;AACH,SAAS,8BAA8B,CAC/B,GAAe,EAAE,CAAW;IAEhC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhB,8BAA8B;IAC9B,kBAAkB;IAElB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACV,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,sBAAsB,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;SAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,sBAAsB,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,CAAC,CAAC;IACb,CAAC;AACL,CAAC;AAGD,OAAO,EAAE,8BAA8B,EAAE,CAAA"}
1
+ {"version":3,"file":"get-closest-square-distance-to-rect.js","sourceRoot":"","sources":["../../src/geometry/get-closest-square-distance-to-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAGtD;;GAEG;AACH,SAAS,8BAA8B,CAC/B,GAAe,EAAE,CAAW;IAEhC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACV,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,sBAAsB,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;SAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,sBAAsB,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACV,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACjB,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,CAAC,CAAC;IACb,CAAC;AACL,CAAC;AAGD,OAAO,EAAE,8BAA8B,EAAE,CAAA"}
@@ -3,7 +3,8 @@ import { squaredDistanceBetweenPointAndLineSegment, squaredDistanceBetween } fro
3
3
  * @internal
4
4
  */
5
5
  function getClosestSquaredDistanceToRotatedRect(ps, p) {
6
- const ds = [0, 1, 2, 3].map(i => squaredDistanceBetweenPointAndLineSegment(p, [ps[i], ps[(i + 1) % 4]]));
6
+ const ds = [0, 1, 2, 3]
7
+ .map(i => squaredDistanceBetweenPointAndLineSegment(p, [ps[i], ps[(i + 1) % 4]]));
7
8
  const width = squaredDistanceBetween(ps[0], ps[1]);
8
9
  const height = squaredDistanceBetween(ps[0], ps[3]);
9
10
  if (ds[0] <= height && ds[2] <= height &&
@@ -1 +1 @@
1
- {"version":3,"file":"get-closest-squared-distance-to-rotated-rect.js","sourceRoot":"","sources":["../../src/geometry/get-closest-squared-distance-to-rotated-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,yCAAyC,EAAE,sBAAsB,EACpE,MAAM,cAAc,CAAC;AAGtB;;GAEG;AACH,SAAS,sCAAsC,CAAC,EAAc,EAAE,CAAW;IACvE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,yCAAyC,CAC/D,CAAC,EACD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAC3B,CACJ,CAAC;IAEF,MAAM,KAAK,GAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM;QAClC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAEpC,OAAO,CAAC,CAAC,CAAC,sBAAsB;IACpC,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,sCAAsC,EAAE,CAAA"}
1
+ {"version":3,"file":"get-closest-squared-distance-to-rotated-rect.js","sourceRoot":"","sources":["../../src/geometry/get-closest-squared-distance-to-rotated-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,yCAAyC,EAAE,sBAAsB,EACpE,MAAM,cAAc,CAAC;AAGtB;;GAEG;AACH,SAAS,sCAAsC,CAAC,EAAc,EAAE,CAAW;IACvE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,yCAAyC,CAC3C,CAAC,EACD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAC3B,CACJ,CAAC;IAEF,MAAM,KAAK,GAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM;QAClC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAEpC,OAAO,CAAC,CAAC,CAAC,sBAAsB;IACpC,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,sCAAsC,EAAE,CAAA"}
package/node/index.d.ts CHANGED
@@ -5,10 +5,8 @@ export type { Mat } from './mat/mat.js';
5
5
  export type { CpNode } from './cp-node/cp-node.js';
6
6
  export type { PointOnShape } from './point-on-shape/point-on-shape.js';
7
7
  export type { Circle } from './geometry/circle.js';
8
- export type { ContactPoint } from './contact-point/contact-point.js';
9
8
  export type { CurvePiece } from './mat/curve-piece.js';
10
9
  export type { DrawElemFunctions } from './debug/functions/draw-elem/draw-elem.js';
11
- export type { ICpNodeForDebugging } from './debug/cp-node-for-debugging.js';
12
10
  export type { ITiming } from './debug/debug.js';
13
11
  export type { DebugElems } from './debug/debug-elem-types.js';
14
12
  export type { Debug } from './debug/debug.js';
@@ -18,7 +16,6 @@ export { drawBeziersAsSinglePath } from './debug/functions/draw/draw-beziers-as-
18
16
  export { floydWarshall } from './floyd-warshall/floyd-warshall.js';
19
17
  export { CpNodeFs } from './cp-node/cp-node-fs.js';
20
18
  export { isVertexSpecial } from './cp-node/fs/is-vertex-special.js';
21
- export { createPos } from './point-on-shape/create-pos.js';
22
19
  export { findMats } from './find-mat/find-mats.js';
23
20
  export { trimMat } from './mat/trim-mat.js';
24
21
  export { toScaleAxis } from './sat/to-scale-axis.js';
@@ -33,8 +30,6 @@ export { simplifyMat } from './mat/simplify-mat.js';
33
30
  export { drawElemFs, drawElemFsDetailed } from './debug/functions/draw-elem/draw-elem.js';
34
31
  export { sweepLine } from './sweep-line/sweep-line.js';
35
32
  export { getClosestSquareDistanceToRect } from './geometry/get-closest-square-distance-to-rect.js';
36
- export { connectHoleClosers } from './mat/connect-hole-closers.js';
37
- export { findAndAdd2Prong } from './find-2-prong/find-and-add-2-prong.js';
38
33
  export { getImpliedBoundaryBezierBetween } from './cp-node/fs/get-implied-boundary-bezier-between.js';
39
34
  export { getSatCulls } from './sat/get-sat-culls.js';
40
35
  export { getGraph } from './floyd-warshall/get-graph.js';
@@ -77,8 +72,6 @@ export { getEdgeDirection } from './cp-node/fs/get-edge-direction.js';
77
72
  export { getBoundaryBeziersBetween } from './cp-node/fs/get-boundary-beziers-between.js';
78
73
  export { getMatCurvesBetween } from './cp-node/fs/get-mat-curves-between.js';
79
74
  export { getHoleClosers } from './cp-node/fs/get-hole-closers.js';
80
- export { getSpeed } from './cp-node/fs/get-speed.js';
81
- export { getSmoothedSpeed$ } from './cp-node/fs/get-smoothed-speed.js';
82
75
  export { getInitialDegAngleBetweenMatCurves } from './cp-node/fs/get-angle-between-mat-curves.js';
83
76
  export { getAllVertices } from './cp-node/fs/get-all-vertices.js';
84
77
  export { isTrivial } from './cp-node/fs/is-trivial.js';
package/node/index.js CHANGED
@@ -3,7 +3,6 @@ export { drawBeziersAsSinglePath } from './debug/functions/draw/draw-beziers-as-
3
3
  export { floydWarshall } from './floyd-warshall/floyd-warshall.js';
4
4
  export { CpNodeFs } from './cp-node/cp-node-fs.js';
5
5
  export { isVertexSpecial } from './cp-node/fs/is-vertex-special.js';
6
- export { createPos } from './point-on-shape/create-pos.js';
7
6
  export { findMats } from './find-mat/find-mats.js';
8
7
  export { trimMat } from './mat/trim-mat.js';
9
8
  export { toScaleAxis } from './sat/to-scale-axis.js';
@@ -18,8 +17,6 @@ export { simplifyMat } from './mat/simplify-mat.js';
18
17
  export { drawElemFs, drawElemFsDetailed } from './debug/functions/draw-elem/draw-elem.js';
19
18
  export { sweepLine } from './sweep-line/sweep-line.js';
20
19
  export { getClosestSquareDistanceToRect } from './geometry/get-closest-square-distance-to-rect.js';
21
- export { connectHoleClosers } from './mat/connect-hole-closers.js';
22
- export { findAndAdd2Prong } from './find-2-prong/find-and-add-2-prong.js';
23
20
  export { getImpliedBoundaryBezierBetween } from './cp-node/fs/get-implied-boundary-bezier-between.js';
24
21
  export { getSatCulls } from './sat/get-sat-culls.js';
25
22
  export { getGraph } from './floyd-warshall/get-graph.js';
@@ -63,8 +60,6 @@ export { getEdgeDirection } from './cp-node/fs/get-edge-direction.js';
63
60
  export { getBoundaryBeziersBetween } from './cp-node/fs/get-boundary-beziers-between.js';
64
61
  export { getMatCurvesBetween } from './cp-node/fs/get-mat-curves-between.js';
65
62
  export { getHoleClosers } from './cp-node/fs/get-hole-closers.js';
66
- export { getSpeed } from './cp-node/fs/get-speed.js';
67
- export { getSmoothedSpeed$ } from './cp-node/fs/get-smoothed-speed.js';
68
63
  export { getInitialDegAngleBetweenMatCurves } from './cp-node/fs/get-angle-between-mat-curves.js';
69
64
  export { getAllVertices } from './cp-node/fs/get-all-vertices.js';
70
65
  export { isTrivial } from './cp-node/fs/is-trivial.js';
package/node/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAiBpF,OAAO,EAAE,uBAAuB,EAAE,MAAM,uDAAuD,CAAC;AAChG,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAC;AACpE,OAAO,EAAE,SAAS,EAAE,MAAM,gCAAgC,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,4CAA4C,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAC9E,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,0CAA0C,CAAC;AAC1F,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,wCAAwC,CAAC;AAC1E,OAAO,EAAE,+BAA+B,EAAE,MAAM,qDAAqD,CAAC;AACtG,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,yCAAyC,EAAE,MAAM,6EAA6E,CAAC;AACxI,OAAO,EAAE,+BAA+B,EAAE,MAAM,iEAAiE,CAAC;AAClH,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,sDAAsD,CAAC;AAGpG,qBAAqB;AACrB,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,6CAA6C,CAAC;AACvF,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sCAAsC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AACzE,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,4BAA4B,EAAE,MAAM,mDAAmD,CAAC;AACjG,OAAO,EAAE,wBAAwB,EAAE,MAAM,8CAA8C,CAAC;AACxF,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,uCAAuC,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AACvE,OAAO,EAAE,kCAAkC,EAAE,MAAM,8CAA8C,CAAC;AAClG,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC"}
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAepF,OAAO,EAAE,uBAAuB,EAAE,MAAM,uDAAuD,CAAC;AAChG,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,4CAA4C,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAC9E,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,0CAA0C,CAAC;AAC1F,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,+BAA+B,EAAE,MAAM,qDAAqD,CAAC;AACtG,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,yCAAyC,EAAE,MAAM,6EAA6E,CAAC;AACxI,OAAO,EAAE,+BAA+B,EAAE,MAAM,iEAAiE,CAAC;AAClH,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,sDAAsD,CAAC;AAGpG,qBAAqB;AACrB,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,6CAA6C,CAAC;AACvF,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sCAAsC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AACzE,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,4BAA4B,EAAE,MAAM,mDAAmD,CAAC;AACjG,OAAO,EAAE,wBAAwB,EAAE,MAAM,8CAA8C,CAAC;AACxF,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,uCAAuC,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,kCAAkC,EAAE,MAAM,8CAA8C,CAAC;AAClG,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC"}
@@ -5,6 +5,7 @@
5
5
  */
6
6
  declare function getLoopsMetrics(loops: number[][][][]): {
7
7
  maxCoordinate: number;
8
- maxRadius: number;
8
+ width: number;
9
+ height: number;
9
10
  };
10
11
  export { getLoopsMetrics };
@@ -1,5 +1,4 @@
1
- const max = Math.max;
2
- const abs = Math.abs;
1
+ const { max, abs } = Math;
3
2
  /**
4
3
  * @internal
5
4
  * Returns the maximum control point coordinate value (x or y) within any loop.
@@ -7,10 +6,10 @@ const abs = Math.abs;
7
6
  */
8
7
  function getLoopsMetrics(loops) {
9
8
  let maxCoordinate = 0;
10
- let minX = Number.POSITIVE_INFINITY;
11
- let maxX = Number.NEGATIVE_INFINITY;
12
- let minY = Number.POSITIVE_INFINITY;
13
- let maxY = Number.NEGATIVE_INFINITY;
9
+ let minX = +Infinity;
10
+ let maxX = -Infinity;
11
+ let minY = +Infinity;
12
+ let maxY = -Infinity;
14
13
  for (const loop of loops) {
15
14
  for (const ps of loop) {
16
15
  for (const p of ps) {
@@ -37,8 +36,7 @@ function getLoopsMetrics(loops) {
37
36
  }
38
37
  const width = maxX - minX;
39
38
  const height = maxY - minY;
40
- const maxRadius = max(width, height);
41
- return { maxCoordinate, maxRadius };
39
+ return { maxCoordinate, width, height };
42
40
  }
43
41
  export { getLoopsMetrics };
44
42
  //# sourceMappingURL=get-max-coordinate.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"get-max-coordinate.js","sourceRoot":"","sources":["../../src/loop/get-max-coordinate.ts"],"names":[],"mappings":"AAAA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AAGrB;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB;IAI1C,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAAC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YAAC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;oBAAC,aAAa,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC7C,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YAC/B,CAAC;QAAC,CAAC;IAAC,CAAC;IAEL,MAAM,KAAK,GAAI,IAAI,GAAG,IAAI,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAErC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACxC,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
1
+ {"version":3,"file":"get-max-coordinate.js","sourceRoot":"","sources":["../../src/loop/get-max-coordinate.ts"],"names":[],"mappings":"AAAA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAG1B;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB;IAK1C,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAAC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YAAC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;oBAAC,aAAa,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC7C,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YAC/B,CAAC;QAAC,CAAC;IAAC,CAAC;IAEL,MAAM,KAAK,GAAI,IAAI,GAAG,IAAI,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IAE3B,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC5C,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
@@ -1,7 +1,7 @@
1
1
  import type { Circle } from '../geometry/circle.js';
2
- import type { PointOnShape } from '../point-on-shape/point-on-shape.js';
2
+ import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
3
3
  import type { CpNode } from '../cp-node/cp-node.js';
4
- import type { MatMeta } from '../index.js';
4
+ import type { MatMeta } from '../mat/mat-meta.js';
5
5
  /**
6
6
  * @param circle
7
7
  * @param orders
@@ -11,7 +11,7 @@ import type { MatMeta } from '../index.js';
11
11
  *
12
12
  * @internal
13
13
  */
14
- declare function addToCpTree(insertIfOrderIsWrong: boolean, isHoleClosing: boolean, circle: Circle, orders: number[], meta: MatMeta, poss: PointOnShape[], neighbors?: CpNode[]): {
14
+ declare function addToCpTree(insertIfOrderIsWrong: boolean, isHoleClosing: boolean, circle: Circle, orders: number[], meta: MatMeta, poss: PrePointOnShape[], neighbors?: CpNode[]): {
15
15
  anyFailed: boolean;
16
16
  cpNodes: (CpNode | undefined)[];
17
17
  };
@@ -13,14 +13,14 @@ import { joinSpokes } from '../add-n-prong.ts/join-spokes.js';
13
13
  function addToCpTree(insertIfOrderIsWrong, isHoleClosing, circle, orders, meta, poss, neighbors) {
14
14
  const { cpTrees } = meta;
15
15
  let anyFailed = false;
16
- const cpNodes = poss.map((pos, i) => {
16
+ const cpNodes = poss.map((ppos, i) => {
17
17
  const order = orders[i];
18
- const cpTree = cpTrees.get(pos.curve.loop);
19
- const cp = { pointOnShape: pos, circle, order, order2: 0 };
18
+ const cpTree = cpTrees.get(ppos.curve.loop);
19
+ const pos = { ...ppos, circle, order, order2: 0 };
20
20
  const pred = neighbors === undefined
21
- ? getCpNodeToLeftOrSame(cpTree, pos, order, 0)
21
+ ? getCpNodeToLeftOrSame(cpTree, ppos, order, 0)
22
22
  : neighbors[i];
23
- const cpNode = insertCpNode(insertIfOrderIsWrong, isHoleClosing, false, cpTree, cp, pred, meta.lastInsertId);
23
+ const cpNode = insertCpNode(insertIfOrderIsWrong, isHoleClosing, false, cpTree, pos, pred, meta.lastInsertId);
24
24
  if (cpNode === undefined) {
25
25
  anyFailed = true;
26
26
  }
@@ -1 +1 @@
1
- {"version":3,"file":"add-to-cp-tree.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-tree.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AAG9D;;;;;;;;GAQG;AACH,SAAS,WAAW,CACZ,oBAA6B,EAC7B,aAAsB,EACtB,MAAc,EACd,MAAgB,EAChB,IAAa,EACb,IAAoB,EACpB,SAAoB;IAExB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEzB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;QAC5C,MAAM,EAAE,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEzE,MAAM,IAAI,GAAG,SAAS,KAAK,SAAS;YAChC,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9C,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAEnB,MAAM,MAAM,GAAG,YAAY,CACvB,oBAAoB,EACpB,aAAa,EACb,KAAK,EACL,MAAM,EACN,EAAE,EACF,IAAI,EACJ,IAAI,CAAC,YAAY,CACpB,CAAC;QAEF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAAC,SAAS,GAAG,IAAI,CAAC;QAAC,CAAC;QAE/C,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,SAAS,EAAE,CAAC;QACb,UAAU,CAAC,MAAM,EAAE,OAAmB,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAClC,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
1
+ {"version":3,"file":"add-to-cp-tree.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-tree.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AAG9D;;;;;;;;GAQG;AACH,SAAS,WAAW,CACZ,oBAA6B,EAC7B,aAAsB,EACtB,MAAc,EACd,MAAgB,EAChB,IAAa,EACb,IAAuB,EACvB,SAAoB;IAExB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEzB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAC,CAAC,EAAE,EAAE;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;QAC7C,MAAM,GAAG,GAAiB,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEhE,MAAM,IAAI,GAAG,SAAS,KAAK,SAAS;YAChC,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAEnB,MAAM,MAAM,GAAG,YAAY,CACvB,oBAAoB,EACpB,aAAa,EACb,KAAK,EACL,MAAM,EACN,GAAG,EACH,IAAI,EACJ,IAAI,CAAC,YAAY,CACpB,CAAC;QAEF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAAC,SAAS,GAAG,IAAI,CAAC;QAAC,CAAC;QAE/C,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,SAAS,EAAE,CAAC;QACb,UAAU,CAAC,MAAM,EAAE,OAAmB,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAClC,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
@@ -0,0 +1,10 @@
1
+ import type { Loop } from 'flo-boolean';
2
+ import type { CpNode } from '../cp-node/cp-node.js';
3
+ import { LlRbTree } from 'flo-ll-rb-tree';
4
+ /**
5
+ * @param cpNode
6
+ *
7
+ * @internal
8
+ */
9
+ declare function createNewCpTrees(cpNode: CpNode): Map<Loop, LlRbTree<CpNode>>;
10
+ export { createNewCpTrees };
@@ -0,0 +1,24 @@
1
+ import { LlRbTree } from 'flo-ll-rb-tree';
2
+ import { cpNodeComparator } from '../cp-node/fs/cp-node-comparator.js';
3
+ import { getAllOnLoop } from '../cp-node/fs/get-all-on-loop.js';
4
+ /**
5
+ * @param cpNode
6
+ *
7
+ * @internal
8
+ */
9
+ function createNewCpTrees(cpNode) {
10
+ const cpTrees_ = new Map();
11
+ getAllOnLoop(cpNode).forEach(createNewCpTree_);
12
+ function createNewCpTree_(cpNode) {
13
+ const loop = cpNode.pointOnShape.curve.loop;
14
+ let cpTree = cpTrees_.get(loop);
15
+ if (!cpTree) {
16
+ cpTree = new LlRbTree(cpNodeComparator, false);
17
+ cpTrees_.set(loop, cpTree);
18
+ }
19
+ cpTree.insert(cpNode);
20
+ }
21
+ return cpTrees_;
22
+ }
23
+ export { createNewCpTrees };
24
+ //# sourceMappingURL=create-new-cp-trees.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"create-new-cp-trees.js","sourceRoot":"","sources":["../../src/mat/create-new-cp-trees.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAIhE;;;;GAIG;AACH,SAAS,gBAAgB,CACjB,MAAc;IAElB,MAAM,QAAQ,GAA+B,IAAI,GAAG,EAAE,CAAC;IAEvD,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAE/C,SAAS,gBAAgB,CAAC,MAAc;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAC5C,IAAI,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,GAAG,IAAI,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YAC/C,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}
@@ -9,4 +9,4 @@ interface CurvePiece {
9
9
  /** The start and end t parameter values of the bezier curve. */
10
10
  readonly ts: number[];
11
11
  }
12
- export { CurvePiece };
12
+ export type { CurvePiece };
@@ -1,12 +1,12 @@
1
1
  import type { CpNode } from '../cp-node/cp-node.js';
2
2
  import type { CurvePiece } from './curve-piece.js';
3
3
  /**
4
- * @internal
5
- * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
6
- * from the given boundary piece.
4
+ * Returns the ordered bezier pieces between from the given boundary piece.
7
5
  *
8
6
  * @param cpNodes - An ordered pair that represents the start and end points of
9
7
  * the boundary piece
8
+ *
9
+ * @internal
10
10
  */
11
11
  declare function getBoundaryPieceBeziers(cpNodes: CpNode[]): CurvePiece[];
12
12
  export { getBoundaryPieceBeziers };
@@ -1,45 +1,149 @@
1
- import { isPosQuiteSharpCorner } from '../point-on-shape/is-pos-quite-sharp-corner.js';
2
- import { compareCps } from '../contact-point/contact-point.js';
1
+ import { comparePoss } from '../point-on-shape/compare-poss.js';
3
2
  /**
4
- * @internal
5
- * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
6
- * from the given boundary piece.
3
+ * Returns the ordered bezier pieces between from the given boundary piece.
7
4
  *
8
5
  * @param cpNodes - An ordered pair that represents the start and end points of
9
6
  * the boundary piece
7
+ *
8
+ * @internal
10
9
  */
11
10
  function getBoundaryPieceBeziers(cpNodes) {
12
11
  let cpThis = cpNodes[0];
13
12
  const cpEnd = cpNodes[1];
14
13
  const curvePieces = [];
14
+ // NOTE❗ Currently removed stichables; we're just checking for duplicates
15
+ // later in `find2Prong`; KEEP for possible future use.
16
+ // We have to stich curves together if they're at a hole closer or at the
17
+ // endpoints of a loop to avoid duplicates later within the code; the map
18
+ // is from curves
19
+ // const stichables: Map<Curve, number[]> = new Map();
15
20
  // As opposed to going around the circle and taking the last exit
16
21
  let goStraight = true;
17
22
  do {
23
+ const posThis = cpThis.pointOnShape;
24
+ const posNext = cpThis.next.pointOnShape;
25
+ const curveThis = posThis.curve;
26
+ const curveNext = posNext.curve;
18
27
  if (!goStraight) {
19
28
  goStraight = true;
29
+ // NOTE❗ Currently removed stichables; we're just checking for duplicates
30
+ // later in `find2Prong`; KEEP for possible future use.
31
+ // const { loop: loopThis } = curveThis;
32
+ // const cpPrevOnCircle = cpThis.prevOnCircle;
33
+ // const curvePrevOnCircle = cpPrevOnCircle.pointOnShape.curve;
34
+ // const { loop: loopNext } = cpPrevOnCircle.pointOnShape.curve;
35
+ // if (loopThis !== loopNext) {
36
+ // let idxsThis = stichables.get(curveThis);
37
+ // if (idxsThis === undefined) {
38
+ // idxsThis = [];
39
+ // stichables.set(curveThis, idxsThis);
40
+ // }
41
+ // idxsThis.push(curvePieces.length - 1); // last `CurvePiece` idx
42
+ // let idxsNext = stichables.get(curvePrevOnCircle);
43
+ // if (idxsNext === undefined) {
44
+ // idxsNext = [];
45
+ // stichables.set(curvePrevOnCircle, idxsNext);
46
+ // }
47
+ // idxsNext.push(curvePieces.length); // upcoming `CurvePiece` idx
48
+ // }
49
+ // cpThis = cpPrevOnCircle; // take last exit
20
50
  cpThis = cpThis.prevOnCircle; // take last exit
21
51
  continue;
22
52
  }
23
53
  goStraight = false;
24
- const posThis = cpThis.cp.pointOnShape;
25
- const posNext = cpThis.next.cp.pointOnShape;
26
- if (posNext.curve === posThis.curve &&
27
- isPosQuiteSharpCorner(posThis) &&
28
- isPosQuiteSharpCorner(posNext)) {
29
- // Do nothing
30
- }
31
- else if (posNext.curve === posThis.curve &&
32
- compareCps(cpThis.next.cp, cpThis.cp) > 0) {
33
- curvePieces.push({ curve: posThis.curve, ts: [posThis.t, posNext.t] });
54
+ if (curveNext === curveThis &&
55
+ comparePoss(posNext, posThis) > 0) {
56
+ // The boundary stays on the same curve segment *and* the next pos
57
+ // is further along the *linear* boundary. If it is *not* further
58
+ // on the *linear* boundary then this pos precedes the abrupt break
59
+ // in the ordering and next pos comes after the break so the code in
60
+ // the next `else` statement is called to skip over the break.
61
+ // The other case in which `comparePoss(posNext, posThis) <= 0` is
62
+ // possible for hole closers where the oderering of this and next
63
+ // are the same except for `order2`
64
+ curvePieces.push({
65
+ curve: curveThis, ts: [posThis.t, posNext.t]
66
+ });
67
+ cpThis = cpThis.next;
68
+ continue;
34
69
  }
35
- else {
36
- curvePieces.push({ curve: posThis.curve, ts: [posThis.t, 1] });
37
- if (posThis.curve.loop === posNext.curve.loop) {
38
- addSkippedBeziers(curvePieces, posThis.curve, posNext.curve, posNext.t);
39
- }
70
+ // The segment crosses a curve boundary because either:
71
+ // 1. `this` and `next` are not on the same curve OR
72
+ // 2. `this` comes after `next` by ordering
73
+ // so split at t = 1.
74
+ if (curveThis.loop === curveNext.loop) {
75
+ const initialCurvePiece = {
76
+ curve: curveThis, ts: [posThis.t, 1]
77
+ };
78
+ curvePieces.push(initialCurvePiece);
79
+ // Fill in any curves skipped between the two points.
80
+ addSkippedBeziers(curvePieces, curveThis, curveNext, posNext.t);
81
+ // NOTE❗ Currently removed stichables; we're just checking for duplicates
82
+ // later in `find2Prong`; KEEP for possible future use.
83
+ // const finalCurvePiece = curvePieces[curvePieces.length - 1];
84
+ // if (initialCurvePiece.curve === finalCurvePiece!.curve) {
85
+ // const { ts: tsS } = initialCurvePiece;
86
+ // const { ts: tsE } = finalCurvePiece!;
87
+ // // If it is a closed loop we must join the endpoints to prevent duplicate
88
+ // // antipodal points later
89
+ // if (tsS[0] === tsE[1]) {
90
+ // initialCurvePiece.ts[0] = tsE[0];
91
+ // if (curvePieces.length > 1) {
92
+ // curvePieces.pop();
93
+ // }
94
+ // // console.log('was inner closed loop')
95
+ // }
96
+ // }
40
97
  }
41
98
  cpThis = cpThis.next;
42
99
  } while (cpThis !== cpEnd);
100
+ // NOTE❗ Currently removed stichables; we're just checking for duplicates
101
+ // later in `find2Prong`; KEEP for possible future use.
102
+ // if (stichables.size > 0) {
103
+ // for (const [loop,idxs] of stichables.entries()) {
104
+ // if (idxs.length === 2) {
105
+ // const curvePieceS = curvePieces[idxs[0]]!;
106
+ // const curvePieceE = curvePieces[idxs[1]]!;
107
+ // if (curvePieceS === undefined || curvePieceE === undefined) {
108
+ // console.log(curvePieceS);
109
+ // console.log(curvePieceE);
110
+ // continue;
111
+ // }
112
+ // const { curve: curveS, ts: tsS } = curvePieceS;
113
+ // const { curve: curveE, ts: tsE } = curvePieceE;
114
+ // if (curveS !== curveE) {
115
+ // continue;
116
+ // }
117
+ // // If it is a closed loop we must join the endpoints to prevent duplicate
118
+ // // antipodal points later
119
+ // if (tsS[0] === tsE[1]) {
120
+ // curvePieceS.ts[0] = tsE[0];
121
+ // // console.log('was closed loop 1')
122
+ // } else if (tsE[0] === tsS[1]) {
123
+ // curvePieceS.ts[1] = tsE[1];
124
+ // // console.log('was closed loop 2')
125
+ // }
126
+ // if (idxs[0] !== idxs[1]) {
127
+ // curvePieces[idxs[1]] = undefined;
128
+ // }
129
+ // }
130
+ // }
131
+ // }
132
+ // NOTE❗ The below endcurve check is not enough for specific cases involving
133
+ // multiple hole closers; KEEP for now but must use stichables instead
134
+ // if (curvePieces[0]!.curve === curvePieces[curvePieces.length - 1]!.curve) {
135
+ // const { ts: tsS } = curvePieces[0]!;
136
+ // const { ts: tsE } = curvePieces[curvePieces.length - 1]!;
137
+ // // If it is a closed loop we must join the endpoints to prevent duplicate
138
+ // // antipodal points later
139
+ // if (tsS[0] === tsE[1]) {
140
+ // curvePieces[0]!.ts[0] = tsE[0];
141
+ // if (curvePieces.length > 1) {
142
+ // curvePieces.pop();
143
+ // }
144
+ // // console.log('was closed loop')
145
+ // }
146
+ // }
43
147
  return curvePieces;
44
148
  }
45
149
  /**
@@ -47,6 +151,7 @@ function getBoundaryPieceBeziers(cpNodes) {
47
151
  * Adds pieces of skipped beziers
48
152
  */
49
153
  function addSkippedBeziers(curvePieces, curveStart, curveEnd, t1) {
154
+ // Walk forward through the loop until the end curve is reached.
50
155
  let curveThis = curveStart;
51
156
  do {
52
157
  curveThis = curveThis.next;
@@ -1 +1 @@
1
- {"version":3,"file":"get-boundary-piece-beziers.js","sourceRoot":"","sources":["../../src/mat/get-boundary-piece-beziers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,qBAAqB,EAAE,MAAM,gDAAgD,CAAC;AACvF,OAAO,EAAE,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAG/D;;;;;;;GAOG;AACH,SAAS,uBAAuB,CAAC,OAAiB;IAC9C,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,KAAK,GAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAE1B,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,iEAAiE;IACjE,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,GAAG,CAAC;QACA,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,iBAAiB;YAC/C,SAAS;QACb,CAAC;QAED,UAAU,GAAG,KAAK,CAAC;QAEnB,MAAM,OAAO,GAAG,MAAM,CAAM,EAAE,CAAC,YAAY,CAAC;QAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC;QAE5C,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,qBAAqB,CAAC,OAAO,CAAC;YAC9B,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YAEjC,aAAa;QACjB,CAAC;aAAM,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAEnD,WAAW,CAAC,IAAI,CACZ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;QACN,CAAC;aAAM,CAAC;YACJ,WAAW,CAAC,IAAI,CACZ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;YAEF,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC5C,iBAAiB,CACT,WAAW,EACX,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;YACN,CAAC;QACL,CAAC;QAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC,QAAQ,MAAM,KAAK,KAAK,EAAE;IAG3B,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,WAAyB,EACzB,UAAiB,EACjB,QAAe,EACf,EAAU;IAEd,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG,CAAC;QACA,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}
1
+ {"version":3,"file":"get-boundary-piece-beziers.js","sourceRoot":"","sources":["../../src/mat/get-boundary-piece-beziers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AAGhE;;;;;;;GAOG;AACH,SAAS,uBAAuB,CACxB,OAAiB;IAErB,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,KAAK,GAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAE1B,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,yEAAyE;IACzE,uDAAuD;IACvD,yEAAyE;IACzE,yEAAyE;IACzE,iBAAiB;IACjB,sDAAsD;IAEtD,iEAAiE;IACjE,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,GAAG,CAAC;QACA,MAAM,OAAO,GAAG,MAAM,CAAM,YAAY,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;QACzC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;QAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;QAEhC,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,UAAU,GAAG,IAAI,CAAC;YAClB,yEAAyE;YACzE,uDAAuD;YACvD,wCAAwC;YACxC,8CAA8C;YAC9C,+DAA+D;YAC/D,gEAAgE;YAGhE,+BAA+B;YAC/B,gDAAgD;YAChD,oCAAoC;YACpC,yBAAyB;YACzB,+CAA+C;YAC/C,QAAQ;YACR,uEAAuE;YAEvE,wDAAwD;YACxD,oCAAoC;YACpC,yBAAyB;YACzB,uDAAuD;YACvD,QAAQ;YACR,uEAAuE;YACvE,IAAI;YAEJ,8CAA8C;YAC9C,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAE,iBAAiB;YAChD,SAAS;QACb,CAAC;QAED,UAAU,GAAG,KAAK,CAAC;QAEnB,IAAI,SAAS,KAAK,SAAS;YACvB,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAEpC,kEAAkE;YAClE,iEAAiE;YACjE,mEAAmE;YACnE,oEAAoE;YACpE,8DAA8D;YAC9D,kEAAkE;YAClE,iEAAiE;YACjE,mCAAmC;YACnC,WAAW,CAAC,IAAI,CAAC;gBACb,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;aAC/C,CAAC,CAAC;YAEH,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,SAAS;QACb,CAAC;QAED,uDAAuD;QACvD,oDAAoD;QACpD,2CAA2C;QAC3C,qBAAqB;QAErB,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE,CAAC;YACpC,MAAM,iBAAiB,GAAG;gBACtB,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;aACvC,CAAC;YACF,WAAW,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YAEpC,qDAAqD;YACrD,iBAAiB,CAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAEhE,yEAAyE;YACzE,uDAAuD;YACvD,+DAA+D;YAC/D,4DAA4D;YAC5D,6CAA6C;YAC7C,4CAA4C;YAE5C,gFAAgF;YAChF,gCAAgC;YAChC,+BAA+B;YAC/B,4CAA4C;YAE5C,wCAAwC;YACxC,iCAAiC;YACjC,YAAY;YACZ,kDAAkD;YAClD,QAAQ;YACR,IAAI;QACR,CAAC;QAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC,QAAQ,MAAM,KAAK,KAAK,EAAE;IAE3B,yEAAyE;IACzE,uDAAuD;IACvD,6BAA6B;IAC7B,wDAAwD;IACxD,mCAAmC;IACnC,yDAAyD;IACzD,yDAAyD;IAEzD,4EAA4E;IAC5E,4CAA4C;IAC5C,4CAA4C;IAC5C,4BAA4B;IAC5B,gBAAgB;IAEhB,8DAA8D;IAC9D,8DAA8D;IAC9D,uCAAuC;IACvC,4BAA4B;IAC5B,gBAAgB;IAEhB,wFAAwF;IACxF,wCAAwC;IACxC,uCAAuC;IACvC,8CAA8C;IAC9C,sDAAsD;IACtD,8CAA8C;IAC9C,8CAA8C;IAC9C,sDAAsD;IACtD,gBAAgB;IAChB,yCAAyC;IACzC,oDAAoD;IACpD,gBAAgB;IAChB,YAAY;IACZ,QAAQ;IACR,IAAI;IAEJ,4EAA4E;IAC5E,sEAAsE;IACtE,8EAA8E;IAC9E,2CAA2C;IAC3C,gEAAgE;IAEhE,gFAAgF;IAChF,gCAAgC;IAChC,+BAA+B;IAC/B,0CAA0C;IAE1C,wCAAwC;IACxC,iCAAiC;IACjC,YAAY;IACZ,4CAA4C;IAC5C,QAAQ;IACR,IAAI;IAEJ,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,WAAuC,EACvC,UAAiB,EACjB,QAAe,EACf,EAAU;IAEd,gEAAgE;IAChE,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG,CAAC;QACA,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}
@@ -1,4 +1,4 @@
1
- import { CpNode } from '../cp-node/cp-node.js';
1
+ import type { CpNode } from '../cp-node/cp-node.js';
2
2
  /**
3
3
  * Returns all branches associated with the give cpNode.
4
4
  *
@@ -1,7 +1,7 @@
1
- import { CpNode } from '../cp-node/cp-node.js';
2
- import { PointOnShape } from '../point-on-shape/point-on-shape.js';
3
- import { Circle } from '../geometry/circle.js';
4
- import { MatMeta } from './mat-meta.js';
1
+ import type { CpNode } from '../cp-node/cp-node.js';
2
+ import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
3
+ import type { Circle } from '../geometry/circle.js';
4
+ import type { MatMeta } from './mat-meta.js';
5
5
  /**
6
6
  * @internal
7
7
  * If another `CpNode` is close by (to the given implied (via `pos`, `order` and
@@ -13,5 +13,5 @@ import { MatMeta } from './mat-meta.js';
13
13
  * @param order
14
14
  * @param order2
15
15
  */
16
- declare function getCloseByCpIfExist(meta: MatMeta, pos: PointOnShape, circle: Circle, order: number, order2: number, forProngCount?: number): CpNode | undefined;
16
+ declare function getCloseByCpIfExist(meta: MatMeta, pos: PrePointOnShape, circle: Circle, order: number, order2: number, forProngCount?: number): CpNode | undefined;
17
17
  export { getCloseByCpIfExist };
@@ -15,9 +15,9 @@ const ANGLE_THRESHOLD = Math.cos(DEGREES * (Math.PI / 180));
15
15
  * @param order2
16
16
  */
17
17
  function getCloseByCpIfExist(meta, pos, circle, order, order2, forProngCount) {
18
- const { cpTrees, maxCoordinate } = meta;
19
- const DISTANCE_THRESHOLD = maxCoordinate * 2e-14;
20
- const DISTANCE_THRESHOLD_2 = DISTANCE_THRESHOLD * 2e-2;
18
+ const { cpTrees, maxCoordPowerOf2 } = meta;
19
+ const DISTANCE_THRESHOLD = 2 ** (maxCoordPowerOf2 - 40); // approx. 1e-9 for 1024 x 1024 shapes
20
+ const DISTANCE_THRESHOLD_2 = 2 ** (maxCoordPowerOf2 - 46);
21
21
  const cpTree = cpTrees.get(pos.curve.loop);
22
22
  const cur = getCpNodeToLeftOrSame(cpTree, pos, order, order2);
23
23
  if (!cur) {
@@ -26,13 +26,14 @@ function getCloseByCpIfExist(meta, pos, circle, order, order2, forProngCount) {
26
26
  const cpNodes = [cur, cur.next];
27
27
  const { p, t } = pos;
28
28
  for (const cpNode of cpNodes) {
29
- const pos2 = cpNode.cp.pointOnShape;
29
+ const pos2 = cpNode.pointOnShape;
30
30
  const p2 = pos2.p;
31
31
  const d = distanceBetween(p, p2);
32
32
  if (d > DISTANCE_THRESHOLD) {
33
33
  continue;
34
34
  }
35
- const v1 = toUnitVector(fromTo(p2, cpNode.cp.circle.center));
35
+ // return cpNode;
36
+ const v1 = toUnitVector(fromTo(p2, cpNode.pointOnShape.circle.center));
36
37
  const v2 = toUnitVector(fromTo(p, circle.center));
37
38
  const cosTheta = dot(v1, v2);
38
39
  if (cosTheta > ANGLE_THRESHOLD ||
@@ -1 +1 @@
1
- {"version":3,"file":"get-closeby-cp-if-exist.js","sourceRoot":"","sources":["../../src/mat/get-closeby-cp-if-exist.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AAK1E,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AAIzE,gBAAgB;AAChB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAG5D;;;;;;;;;;GAUG;AACH,SAAS,mBAAmB,CACpB,IAAa,EACb,GAAiB,EACjB,MAAc,EACd,KAAa,EACb,MAAc,EACd,aAAsB;IAE1B,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;IAExC,MAAM,kBAAkB,GAAG,aAAa,GAAG,KAAK,CAAC;IACjD,MAAM,oBAAoB,GAAG,kBAAkB,GAAG,IAAI,CAAC;IAEvD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,CAAC,GAAG,EAAE,CAAC;QAAC,OAAO,SAAS,CAAC;IAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAEhC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;QACpC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,kBAAkB,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QAED,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QAE5B,IAAI,QAAQ,GAAG,eAAe;YAC1B,CAAC,CAAC,GAAG,oBAAoB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAEnD,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;gBACtB,4BAA4B;gBAC5B,kBAAkB;gBAClB,uCAAuC;gBACvC,qBAAqB;YACzB,CAAC;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}
1
+ {"version":3,"file":"get-closeby-cp-if-exist.js","sourceRoot":"","sources":["../../src/mat/get-closeby-cp-if-exist.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AAGzE,gBAAgB;AAChB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAG5D;;;;;;;;;;GAUG;AACH,SAAS,mBAAmB,CACpB,IAAa,EACb,GAAoB,EACpB,MAAc,EACd,KAAa,EACb,MAAc,EACd,aAAsB;IAE1B,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,IAAI,CAAC;IAE3C,MAAM,kBAAkB,GAAG,CAAC,IAAE,CAAC,gBAAgB,GAAG,EAAE,CAAC,CAAC,CAAE,sCAAsC;IAC9F,MAAM,oBAAoB,GAAG,CAAC,IAAE,CAAC,gBAAgB,GAAG,EAAE,CAAC,CAAC;IAExD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,CAAC,GAAG,EAAE,CAAC;QAAC,OAAO,SAAS,CAAC;IAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAEhC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,kBAAkB,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QACD,iBAAiB;QAEjB,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACvE,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QAE5B,IAAI,QAAQ,GAAG,eAAe;YAC1B,CAAC,CAAC,GAAG,oBAAoB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAEnD,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;gBACtB,4BAA4B;gBAC5B,kBAAkB;gBAClB,uCAAuC;gBACvC,qBAAqB;YACzB,CAAC;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}
@@ -1,6 +1,6 @@
1
+ import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
2
+ import type { CpNode } from '../cp-node/cp-node.js';
1
3
  import { LlRbTree } from 'flo-ll-rb-tree';
2
- import { PointOnShape } from '../point-on-shape/point-on-shape.js';
3
- import { CpNode } from '../cp-node/cp-node.js';
4
4
  /**
5
5
  * @internal
6
6
  *
@@ -14,5 +14,5 @@ import { CpNode } from '../cp-node/cp-node.js';
14
14
  * @param order
15
15
  * @param order2
16
16
  */
17
- declare function getCpNodeToLeftOrSame(cpTree: LlRbTree<CpNode>, pos: PointOnShape, order: number, order2: number): CpNode | undefined;
17
+ declare function getCpNodeToLeftOrSame(cpTree: LlRbTree<CpNode>, pos: PrePointOnShape, order: number, order2: number): CpNode | undefined;
18
18
  export { getCpNodeToLeftOrSame };
@@ -12,8 +12,8 @@
12
12
  * @param order2
13
13
  */
14
14
  function getCpNodeToLeftOrSame(cpTree, pos, order, order2) {
15
- const cp = { pointOnShape: pos, order, order2 };
16
- const cps = cpTree.findBounds({ cp });
15
+ const pointOnShape = { ...pos, order, order2 };
16
+ const cps = cpTree.findBounds({ pointOnShape });
17
17
  if (cps[0] === undefined && cps[1] === undefined) {
18
18
  // The tree is still empty
19
19
  return undefined;
@@ -1 +1 @@
1
- {"version":3,"file":"get-cp-node-to-left-or-same.js","sourceRoot":"","sources":["../../src/mat/get-cp-node-to-left-or-same.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;GAYG;AACH,SAAS,qBAAqB,CACtB,MAAwB,EACxB,GAAiB,EACjB,KAAa,EACb,MAAc;IAElB,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,EAAuB,CAAC,CAAC;IAE3D,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QAC/C,0BAA0B;QAC1B,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QAC/C,sDAAsD;QACtD,mDAAmD;QACnD,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA"}
1
+ {"version":3,"file":"get-cp-node-to-left-or-same.js","sourceRoot":"","sources":["../../src/mat/get-cp-node-to-left-or-same.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;GAYG;AACH,SAAS,qBAAqB,CACtB,MAAwB,EACxB,GAAoB,EACpB,KAAa,EACb,MAAc;IAElB,MAAM,YAAY,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,YAAY,EAAY,CAAC,CAAC;IAE1D,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QAC/C,0BAA0B;QAC1B,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;QAC/C,sDAAsD;QACtD,mDAAmD;QACnD,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA"}