flo-mat 2.0.1 → 2.0.3
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.
- package/.eslintrc.cjs +69 -0
- package/README.md +9 -27
- package/browser/index.js +29604 -7008
- package/browser/index.min.js +1 -2
- package/node/circle.d.ts +20 -20
- package/node/circle.js +31 -31
- package/node/circle.js.map +1 -1
- package/node/compare-curvatures-at-interface.d.ts +19 -19
- package/node/compare-curvatures-at-interface.js +124 -124
- package/node/compare-curvatures-at-interface.js.map +1 -1
- package/node/contact-point.d.ts +26 -26
- package/node/contact-point.js +25 -25
- package/node/cp-node/clone.d.ts +8 -8
- package/node/cp-node/clone.js +31 -31
- package/node/cp-node/clone.js.map +1 -1
- package/node/cp-node/remove.d.ts +9 -9
- package/node/cp-node/remove.js +19 -19
- package/node/cp-node/remove.js.map +1 -1
- package/node/cp-node.d.ts +202 -202
- package/node/cp-node.js +320 -320
- package/node/cp-node.js.map +1 -1
- package/node/curve.d.ts +46 -46
- package/node/curve.js +88 -88
- package/node/curve.js.map +1 -1
- package/node/debug/cp-node-for-debugging.d.ts +11 -11
- package/node/debug/cp-node-for-debugging.js +1 -1
- package/node/debug/debug-elem-types.d.ts +32 -32
- package/node/debug/debug-elem-types.js +1 -1
- package/node/debug/debug.d.ts +50 -50
- package/node/debug/debug.js +75 -75
- package/node/debug/functions/draw-elem/bounding-hull.d.ts +3 -3
- package/node/debug/functions/draw-elem/bounding-hull.js +7 -7
- package/node/debug/functions/draw-elem/bounding-hull.js.map +1 -1
- package/node/debug/functions/draw-elem/branch.d.ts +4 -4
- package/node/debug/functions/draw-elem/branch.js +22 -22
- package/node/debug/functions/draw-elem/branch.js.map +1 -1
- package/node/debug/functions/draw-elem/culls.d.ts +4 -4
- package/node/debug/functions/draw-elem/culls.js +21 -21
- package/node/debug/functions/draw-elem/culls.js.map +1 -1
- package/node/debug/functions/draw-elem/draw-circle-percent.d.ts +3 -3
- package/node/debug/functions/draw-elem/draw-circle-percent.js +12 -12
- package/node/debug/functions/draw-elem/draw-circle-percent.js.map +1 -1
- package/node/debug/functions/draw-elem/draw-elem.d.ts +8 -8
- package/node/debug/functions/draw-elem/draw-elem.js +45 -45
- package/node/debug/functions/draw-elem/draw-elem.js.map +1 -1
- package/node/debug/functions/draw-elem/dull-corner.d.ts +4 -4
- package/node/debug/functions/draw-elem/dull-corner.js +10 -10
- package/node/debug/functions/draw-elem/dull-corner.js.map +1 -1
- package/node/debug/functions/draw-elem/leaves.d.ts +4 -4
- package/node/debug/functions/draw-elem/leaves.js +12 -12
- package/node/debug/functions/draw-elem/leaves.js.map +1 -1
- package/node/debug/functions/draw-elem/loop.d.ts +4 -4
- package/node/debug/functions/draw-elem/loop.js +11 -11
- package/node/debug/functions/draw-elem/loops.d.ts +4 -4
- package/node/debug/functions/draw-elem/loops.js +6 -6
- package/node/debug/functions/draw-elem/loose-bounding-box.d.ts +3 -3
- package/node/debug/functions/draw-elem/loose-bounding-box.js +9 -9
- package/node/debug/functions/draw-elem/loose-bounding-box.js.map +1 -1
- package/node/debug/functions/draw-elem/mat.d.ts +4 -4
- package/node/debug/functions/draw-elem/mat.js +30 -30
- package/node/debug/functions/draw-elem/mat.js.map +1 -1
- package/node/debug/functions/draw-elem/max-vertex.d.ts +4 -4
- package/node/debug/functions/draw-elem/max-vertex.js +8 -8
- package/node/debug/functions/draw-elem/max-vertex.js.map +1 -1
- package/node/debug/functions/draw-elem/min-y.d.ts +4 -4
- package/node/debug/functions/draw-elem/min-y.js +13 -13
- package/node/debug/functions/draw-elem/min-y.js.map +1 -1
- package/node/debug/functions/draw-elem/one-prong-at-dull-corner.d.ts +4 -4
- package/node/debug/functions/draw-elem/one-prong-at-dull-corner.js +12 -12
- package/node/debug/functions/draw-elem/one-prong-at-dull-corner.js.map +1 -1
- package/node/debug/functions/draw-elem/one-prong.d.ts +4 -4
- package/node/debug/functions/draw-elem/one-prong.js +16 -16
- package/node/debug/functions/draw-elem/one-prong.js.map +1 -1
- package/node/debug/functions/draw-elem/sharp-corner.d.ts +4 -4
- package/node/debug/functions/draw-elem/sharp-corner.js +9 -9
- package/node/debug/functions/draw-elem/sharp-corner.js.map +1 -1
- package/node/debug/functions/draw-elem/three-prong.d.ts +4 -4
- package/node/debug/functions/draw-elem/three-prong.js +16 -16
- package/node/debug/functions/draw-elem/three-prong.js.map +1 -1
- package/node/debug/functions/draw-elem/tight-bounding-box.d.ts +3 -3
- package/node/debug/functions/draw-elem/tight-bounding-box.js +7 -7
- package/node/debug/functions/draw-elem/tight-bounding-box.js.map +1 -1
- package/node/debug/functions/draw-elem/two-prong.d.ts +4 -4
- package/node/debug/functions/draw-elem/two-prong.js +36 -36
- package/node/debug/functions/draw-elem/two-prong.js.map +1 -1
- package/node/debug/functions/draw-elem/vertex.d.ts +4 -4
- package/node/debug/functions/draw-elem/vertex.js +27 -27
- package/node/debug/functions/draw-elem/vertex.js.map +1 -1
- package/node/debug/functions/general.d.ts +48 -48
- package/node/debug/functions/general.js +52 -52
- package/node/debug/functions/general.js.map +1 -1
- package/node/debug/functions/three-prong.d.ts +11 -11
- package/node/debug/functions/three-prong.js +184 -184
- package/node/debug/functions/three-prong.js.map +1 -1
- package/node/debug/functions/two-prong.d.ts +13 -13
- package/node/debug/functions/two-prong.js +117 -117
- package/node/debug/functions/two-prong.js.map +1 -1
- package/node/debug/three-prong-for-debugging.d.ts +31 -31
- package/node/debug/three-prong-for-debugging.js +20 -20
- package/node/debug/two-prong-for-debugging.d.ts +26 -26
- package/node/debug/two-prong-for-debugging.js +1 -1
- package/node/find-mats.d.ts +26 -26
- package/node/find-mats.js +122 -125
- package/node/find-mats.js.map +1 -1
- package/node/get-boundary-bezier-parts-to-next.d.ts +9 -9
- package/node/get-boundary-bezier-parts-to-next.js +42 -42
- package/node/get-boundary-bezier-parts-to-next.js.map +1 -1
- package/node/get-boundary-beziers-to-next.d.ts +8 -8
- package/node/get-boundary-beziers-to-next.js +44 -44
- package/node/get-boundary-beziers-to-next.js.map +1 -1
- package/node/get-bounding-box-.d.ts +2 -2
- package/node/get-bounding-box-.js +4 -4
- package/node/get-branches.d.ts +12 -12
- package/node/get-branches.js +68 -68
- package/node/get-branches.js.map +1 -1
- package/node/get-curve/get-curve-between.d.ts +9 -9
- package/node/get-curve/get-curve-between.js +56 -56
- package/node/get-curve/get-curve-between.js.map +1 -1
- package/node/get-curve/get-edge-direction.d.ts +9 -9
- package/node/get-curve/get-edge-direction.js +53 -53
- package/node/get-curve/get-edge-direction.js.map +1 -1
- package/node/get-curve-to-next.d.ts +9 -9
- package/node/get-curve-to-next.js +11 -11
- package/node/get-interface-ccw.d.ts +24 -24
- package/node/get-interface-ccw.js +97 -97
- package/node/get-interface-ccw.js.map +1 -1
- package/node/index.d.ts +36 -36
- package/node/index.js +32 -32
- package/node/loop/get-max-coordinate.d.ts +10 -10
- package/node/loop/get-max-coordinate.js +43 -43
- package/node/loop/get-max-coordinate.js.map +1 -1
- package/node/loop.d.ts +16 -16
- package/node/loop.js +34 -34
- package/node/loop.js.map +1 -1
- package/node/mat/add-to-cp-graph.d.ts +16 -16
- package/node/mat/add-to-cp-graph.js +30 -30
- package/node/mat/add-to-cp-graph.js.map +1 -1
- package/node/mat/bezier-piece.d.ts +12 -12
- package/node/mat/bezier-piece.js +1 -1
- package/node/mat/closest-boundary-point/closest-points-on-curve.d.ts +14 -14
- package/node/mat/closest-boundary-point/closest-points-on-curve.js +72 -73
- package/node/mat/closest-boundary-point/closest-points-on-curve.js.map +1 -1
- package/node/mat/closest-boundary-point/cull-bezier-pieces.d.ts +9 -9
- package/node/mat/closest-boundary-point/cull-bezier-pieces.js +19 -19
- package/node/mat/closest-boundary-point/cull-bezier-pieces.js.map +1 -1
- package/node/mat/closest-boundary-point/cull-by-loose-bounding-box.d.ts +11 -11
- package/node/mat/closest-boundary-point/cull-by-loose-bounding-box.js +24 -24
- package/node/mat/closest-boundary-point/cull-by-loose-bounding-box.js.map +1 -1
- package/node/mat/closest-boundary-point/cull-by-tight-boundary-box.d.ts +11 -11
- package/node/mat/closest-boundary-point/cull-by-tight-boundary-box.js +26 -26
- package/node/mat/closest-boundary-point/cull-by-tight-boundary-box.js.map +1 -1
- package/node/mat/closest-boundary-point/get-best-distance-squared.d.ts +8 -8
- package/node/mat/closest-boundary-point/get-best-distance-squared.js +24 -24
- package/node/mat/closest-boundary-point/get-best-distance-squared.js.map +1 -1
- package/node/mat/closest-boundary-point/get-close-boundary-points.d.ts +17 -17
- package/node/mat/closest-boundary-point/get-close-boundary-points.js +80 -80
- package/node/mat/closest-boundary-point/get-close-boundary-points.js.map +1 -1
- package/node/mat/closest-boundary-point/get-closest-boundary-point.d.ts +18 -18
- package/node/mat/closest-boundary-point/get-closest-boundary-point.js +40 -40
- package/node/mat/closest-boundary-point/get-closest-boundary-point.js.map +1 -1
- package/node/mat/corner.d.ts +37 -37
- package/node/mat/corner.js +1 -1
- package/node/mat/create-new-cp-tree.d.ts +9 -9
- package/node/mat/create-new-cp-tree.js +23 -23
- package/node/mat/create-new-cp-tree.js.map +1 -1
- package/node/mat/elem-type-two-prong.d.ts +3 -3
- package/node/mat/elem-type-two-prong.js +1 -1
- package/node/mat/find-mat/add-1-prong.d.ts +12 -12
- package/node/mat/find-mat/add-1-prong.js +42 -42
- package/node/mat/find-mat/add-1-prong.js.map +1 -1
- package/node/mat/find-mat/add-2-prong.d.ts +21 -21
- package/node/mat/find-mat/add-2-prong.js +192 -192
- package/node/mat/find-mat/add-2-prong.js.map +1 -1
- package/node/mat/find-mat/add-3-prong.d.ts +19 -19
- package/node/mat/find-mat/add-3-prong.js +54 -54
- package/node/mat/find-mat/add-3-prong.js.map +1 -1
- package/node/mat/find-mat/add-debug-info.d.ts +9 -9
- package/node/mat/find-mat/add-debug-info.js +67 -69
- package/node/mat/find-mat/add-debug-info.js.map +1 -1
- package/node/mat/find-mat/create-get-interesting-points-on-loop.d.ts +11 -11
- package/node/mat/find-mat/create-get-interesting-points-on-loop.js +51 -51
- package/node/mat/find-mat/create-get-interesting-points-on-loop.js.map +1 -1
- package/node/mat/find-mat/create-initial-cp-graph.d.ts +12 -12
- package/node/mat/find-mat/create-initial-cp-graph.js +40 -40
- package/node/mat/find-mat/create-initial-cp-graph.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/add-debug-info.d.ts +8 -8
- package/node/mat/find-mat/find-2-prong/add-debug-info.js +21 -21
- package/node/mat/find-mat/find-2-prong/add-debug-info.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/cull-bezier-pieces.d.ts +11 -11
- package/node/mat/find-mat/find-2-prong/cull-bezier-pieces.js +29 -29
- package/node/mat/find-mat/find-2-prong/cull-bezier-pieces.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/find-2-prong.d.ts +37 -37
- package/node/mat/find-mat/find-2-prong/find-2-prong.js +232 -232
- package/node/mat/find-mat/find-2-prong/find-2-prong.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/find-equidistant-point-on-line.d.ts +9 -9
- package/node/mat/find-mat/find-2-prong/find-equidistant-point-on-line.js +39 -39
- package/node/mat/find-mat/find-2-prong/find-equidistant-point-on-line.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.d.ts +11 -11
- package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.js +37 -37
- package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.js.map +1 -1
- package/node/mat/find-mat/find-2-prong/x-for-debugging.d.ts +9 -9
- package/node/mat/find-mat/find-2-prong/x-for-debugging.js +1 -1
- package/node/mat/find-mat/find-3-prong/calc-better-x.d.ts +19 -19
- package/node/mat/find-mat/find-3-prong/calc-better-x.js +36 -36
- package/node/mat/find-mat/find-3-prong/calc-better-x.js.map +1 -1
- package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.d.ts +13 -13
- package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.js +25 -25
- package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.js.map +1 -1
- package/node/mat/find-mat/find-3-prong/find-3-prong-for-delta3s.d.ts +22 -22
- package/node/mat/find-mat/find-3-prong/find-3-prong-for-delta3s.js +159 -159
- package/node/mat/find-mat/find-3-prong/find-3-prong-for-delta3s.js.map +1 -1
- package/node/mat/find-mat/find-3-prong/find-3-prong.d.ts +16 -16
- package/node/mat/find-mat/find-3-prong/find-3-prong.js +76 -76
- package/node/mat/find-mat/find-3-prong/find-3-prong.js.map +1 -1
- package/node/mat/find-mat/find-3-prong/get-closest-points.d.ts +9 -9
- package/node/mat/find-mat/find-3-prong/get-closest-points.js +16 -16
- package/node/mat/find-mat/find-3-prong/get-closest-points.js.map +1 -1
- package/node/mat/find-mat/find-and-add-2-prongs-on-all-paths.d.ts +15 -15
- package/node/mat/find-mat/find-and-add-2-prongs-on-all-paths.js +20 -20
- package/node/mat/find-mat/find-and-add-2-prongs-on-all-paths.js.map +1 -1
- package/node/mat/find-mat/find-and-add-2-prongs.d.ts +16 -16
- package/node/mat/find-mat/find-and-add-2-prongs.js +73 -74
- package/node/mat/find-mat/find-and-add-2-prongs.js.map +1 -1
- package/node/mat/find-mat/find-and-add-3-prongs.d.ts +13 -13
- package/node/mat/find-mat/find-and-add-3-prongs.js +146 -147
- package/node/mat/find-mat/find-and-add-3-prongs.js.map +1 -1
- package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.d.ts +14 -14
- package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.js +33 -33
- package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.js.map +1 -1
- package/node/mat/find-mat/get-potential-2-prongs.d.ts +4 -4
- package/node/mat/find-mat/get-potential-2-prongs.js +16 -16
- package/node/mat/find-mat/get-potential-2-prongs.js.map +1 -1
- package/node/mat/find-mat/get-sharp-corners.d.ts +4 -4
- package/node/mat/find-mat/get-sharp-corners.js +17 -17
- package/node/mat/find-mat/get-sharp-corners.js.map +1 -1
- package/node/mat/geometry/get-closest-square-distance-to-rect.d.ts +5 -5
- package/node/mat/geometry/get-closest-square-distance-to-rect.js +49 -49
- package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.d.ts +5 -5
- package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.js +15 -15
- package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.js.map +1 -1
- package/node/mat/get-boundary-piece-beziers.d.ts +11 -11
- package/node/mat/get-boundary-piece-beziers.js +58 -58
- package/node/mat/get-boundary-piece-beziers.js.map +1 -1
- package/node/mat/get-contact-circles-at-interface.d.ts +8 -8
- package/node/mat/get-contact-circles-at-interface.js +20 -20
- package/node/mat/get-contact-circles-at-interface.js.map +1 -1
- package/node/mat/get-largest-vertex.d.ts +4 -4
- package/node/mat/get-largest-vertex.js +9 -9
- package/node/mat/get-leaves.d.ts +4 -4
- package/node/mat/get-leaves.js +12 -12
- package/node/mat/get-leaves.js.map +1 -1
- package/node/mat/get-neighboring-cps.d.ts +14 -14
- package/node/mat/get-neighboring-cps.js +30 -30
- package/node/mat/get-neighboring-cps.js.map +1 -1
- package/node/mat/get-two-prong-type.d.ts +5 -5
- package/node/mat/get-two-prong-type.js +8 -8
- package/node/mat/is-another-cp-closeby.d.ts +20 -20
- package/node/mat/is-another-cp-closeby.js +55 -55
- package/node/mat/is-another-cp-closeby.js.map +1 -1
- package/node/mat/simplify-mat-map-only.d.ts +23 -23
- package/node/mat/simplify-mat-map-only.js +80 -80
- package/node/mat/simplify-mat-map-only.js.map +1 -1
- package/node/mat/to-scale-axis/add-debug-info.d.ts +7 -7
- package/node/mat/to-scale-axis/add-debug-info.js +13 -13
- package/node/mat/to-scale-axis/add-debug-info.js.map +1 -1
- package/node/mat/to-scale-axis/cull-non-cycles.d.ts +9 -9
- package/node/mat/to-scale-axis/cull-non-cycles.js +51 -51
- package/node/mat/to-scale-axis/cull-non-cycles.js.map +1 -1
- package/node/mat/to-scale-axis/cull.d.ts +12 -12
- package/node/mat/to-scale-axis/cull.js +132 -132
- package/node/mat/to-scale-axis/cull.js.map +1 -1
- package/node/mat/trim-mat.d.ts +8 -8
- package/node/mat/trim-mat.js +16 -16
- package/node/mat/trim-mat.js.map +1 -1
- package/node/mat.d.ts +22 -22
- package/node/mat.js +1 -1
- package/node/point-on-shape.d.ts +73 -73
- package/node/point-on-shape.js +167 -167
- package/node/point-on-shape.js.map +1 -1
- package/node/simplify-mat.d.ts +16 -16
- package/node/simplify-mat.js +71 -71
- package/node/simplify-mat.js.map +1 -1
- package/node/svg/get-loop-bounds.d.ts +12 -12
- package/node/svg/get-loop-bounds.js +80 -80
- package/node/svg/get-loop-bounds.js.map +1 -1
- package/node/svg/get-min-y-pos.d.ts +8 -8
- package/node/svg/get-min-y-pos.js +9 -9
- package/node/svg/get-shape-bounds.d.ts +9 -9
- package/node/svg/get-shape-bounds.js +35 -35
- package/node/svg/get-shape-bounds.js.map +1 -1
- package/node/sweep-line/sweep-line.d.ts +18 -18
- package/node/sweep-line/sweep-line.js +72 -72
- package/node/sweep-line/sweep-line.js.map +1 -1
- package/node/to-scale-axis.d.ts +16 -16
- package/node/to-scale-axis.js +74 -73
- package/node/to-scale-axis.js.map +1 -1
- package/node/traverse-edges.d.ts +10 -10
- package/node/traverse-edges.js +21 -21
- package/node/traverse-edges.js.map +1 -1
- package/node/traverse-vertices.d.ts +12 -12
- package/node/traverse-vertices.js +27 -27
- package/node/traverse-vertices.js.map +1 -1
- package/package.json +29 -24
- package/src/circle.ts +3 -3
- package/src/compare-curvatures-at-interface.ts +36 -36
- package/src/cp-node/clone.ts +6 -6
- package/src/cp-node/remove.ts +4 -4
- package/src/cp-node.ts +20 -20
- package/src/curve.ts +19 -19
- package/src/debug/functions/draw-elem/bounding-hull.ts +2 -2
- package/src/debug/functions/draw-elem/branch.ts +4 -4
- package/src/debug/functions/draw-elem/culls.ts +4 -4
- package/src/debug/functions/draw-elem/draw-circle-percent.ts +2 -2
- package/src/debug/functions/draw-elem/draw-elem.ts +1 -1
- package/src/debug/functions/draw-elem/dull-corner.ts +3 -3
- package/src/debug/functions/draw-elem/leaves.ts +4 -4
- package/src/debug/functions/draw-elem/loose-bounding-box.ts +2 -2
- package/src/debug/functions/draw-elem/mat.ts +4 -4
- package/src/debug/functions/draw-elem/max-vertex.ts +2 -2
- package/src/debug/functions/draw-elem/min-y.ts +3 -3
- package/src/debug/functions/draw-elem/one-prong-at-dull-corner.ts +4 -4
- package/src/debug/functions/draw-elem/one-prong.ts +4 -4
- package/src/debug/functions/draw-elem/sharp-corner.ts +2 -2
- package/src/debug/functions/draw-elem/three-prong.ts +7 -7
- package/src/debug/functions/draw-elem/tight-bounding-box.ts +1 -1
- package/src/debug/functions/draw-elem/two-prong.ts +1 -1
- package/src/debug/functions/draw-elem/vertex.ts +20 -14
- package/src/debug/functions/general.ts +3 -3
- package/src/debug/functions/three-prong.ts +37 -37
- package/src/debug/functions/two-prong.ts +15 -15
- package/src/find-mats.ts +19 -19
- package/src/get-boundary-bezier-parts-to-next.ts +8 -8
- package/src/get-boundary-beziers-to-next.ts +8 -8
- package/src/get-branches.ts +7 -7
- package/src/get-curve/get-curve-between.ts +21 -21
- package/src/get-curve/get-edge-direction.ts +13 -14
- package/src/get-interface-ccw.ts +12 -12
- package/src/loop/get-max-coordinate.ts +7 -7
- package/src/loop.ts +4 -4
- package/src/mat/add-to-cp-graph.ts +8 -8
- package/src/mat/closest-boundary-point/closest-points-on-curve.ts +5 -6
- package/src/mat/closest-boundary-point/cull-bezier-pieces.ts +1 -1
- package/src/mat/closest-boundary-point/cull-by-loose-bounding-box.ts +5 -5
- package/src/mat/closest-boundary-point/cull-by-tight-boundary-box.ts +5 -5
- package/src/mat/closest-boundary-point/get-best-distance-squared.ts +5 -5
- package/src/mat/closest-boundary-point/get-close-boundary-points.ts +15 -15
- package/src/mat/closest-boundary-point/get-closest-boundary-point.ts +4 -4
- package/src/mat/cmp-cp-on-delta.ts +5 -5
- package/src/mat/create-new-cp-tree.ts +3 -3
- package/src/mat/find-mat/add-1-prong.ts +5 -5
- package/src/mat/find-mat/add-2-prong.ts +42 -42
- package/src/mat/find-mat/add-3-prong.ts +1 -1
- package/src/mat/find-mat/add-debug-info.ts +18 -20
- package/src/mat/find-mat/create-get-interesting-points-on-loop.ts +4 -4
- package/src/mat/find-mat/create-initial-cp-graph.ts +11 -11
- package/src/mat/find-mat/find-2-prong/add-debug-info.ts +4 -4
- package/src/mat/find-mat/find-2-prong/cull-bezier-pieces.ts +5 -5
- package/src/mat/find-mat/find-2-prong/find-2-prong.ts +27 -27
- package/src/mat/find-mat/find-2-prong/find-equidistant-point-on-line.ts +7 -7
- package/src/mat/find-mat/find-2-prong/get-initial-bezier-pieces.ts +4 -4
- package/src/mat/find-mat/find-3-prong/calc-better-x.ts +4 -4
- package/src/mat/find-mat/find-3-prong/calc-initial-3-prong-center.ts +3 -3
- package/src/mat/find-mat/find-3-prong/find-3-prong-for-delta3s.ts +37 -37
- package/src/mat/find-mat/find-3-prong/find-3-prong.ts +16 -16
- package/src/mat/find-mat/find-3-prong/get-closest-points.ts +1 -1
- package/src/mat/find-mat/find-and-add-2-prongs-on-all-paths.ts +2 -2
- package/src/mat/find-mat/find-and-add-2-prongs.ts +14 -16
- package/src/mat/find-mat/find-and-add-3-prongs.ts +19 -19
- package/src/mat/find-mat/find-and-add-hole-closing-2-prongs.ts +6 -6
- package/src/mat/find-mat/get-potential-2-prongs.ts +4 -4
- package/src/mat/find-mat/get-sharp-corners.ts +4 -4
- package/src/mat/find-mat/get-total-abs-curvature.ts +1 -1
- package/src/mat/geometry/get-closest-squared-distance-to-rotated-rect.ts +3 -3
- package/src/mat/get-boundary-piece-beziers.ts +5 -5
- package/src/mat/get-contact-circles-at-interface.ts +1 -1
- package/src/mat/get-edges-as-array.ts +2 -2
- package/src/mat/get-leaves.ts +2 -2
- package/src/mat/get-neighboring-cps.ts +1 -1
- package/src/mat/is-another-cp-closeby.ts +9 -9
- package/src/mat/simplify-mat-map-only.ts +15 -15
- package/src/mat/to-scale-axis/add-debug-info.ts +6 -3
- package/src/mat/to-scale-axis/add-to-tree.ts +10 -10
- package/src/mat/to-scale-axis/calc-groups.ts +19 -19
- package/src/mat/to-scale-axis/create-spacial-tree.ts +4 -4
- package/src/mat/to-scale-axis/cull-non-cycles.ts +5 -5
- package/src/mat/to-scale-axis/cull.ts +5 -5
- package/src/mat/to-scale-axis/get-engulfed-vertices.ts +18 -18
- package/src/mat/trim-mat.ts +1 -1
- package/src/point-on-shape.ts +16 -16
- package/src/simplify-mat.ts +10 -10
- package/src/svg/get-curvature-at-interface.ts +6 -8
- package/src/svg/get-extreme.ts +1 -1
- package/src/svg/get-loop-bounds.ts +13 -13
- package/src/svg/get-shape-bounds.ts +4 -4
- package/src/sweep-line/are-boxes-intersecting.ts +4 -4
- package/src/sweep-line/sweep-line.ts +8 -8
- package/src/to-scale-axis.ts +18 -17
- package/src/traverse-edges.ts +2 -2
- package/src/traverse-vertices.ts +2 -2
- package/tsconfig.json +0 -1
- package/webpack.config.cjs +12 -63
- package/browser/index.min.js.LICENSE.txt +0 -2819
- package/browser/index.module.js +0 -7149
- package/browser/index.module.min.js +0 -2
- package/browser/index.module.min.js.LICENSE.txt +0 -2819
|
@@ -1,13 +1,13 @@
|
|
|
1
|
-
import { ElemType_TwoProng } from '../../mat/elem-type-two-prong.js';
|
|
2
|
-
/** @hidden */
|
|
3
|
-
interface ITwoProngDebugFunctions {
|
|
4
|
-
logδ: (n: number, type?: ElemType_TwoProng) => void;
|
|
5
|
-
log: (n: number, type?: ElemType_TwoProng) => void;
|
|
6
|
-
drawNormal: (g: SVGGElement, n: number, showDelay?: number) => void;
|
|
7
|
-
logδBasic: (n: number) => void;
|
|
8
|
-
logNearest: (g: SVGGElement, p: number[], showDelay?: number) => void;
|
|
9
|
-
traceConvergence: (g: SVGGElement, n: number, finalOnly?: boolean, showDelay?: number, range?: number[], type?: ElemType_TwoProng) => void;
|
|
10
|
-
}
|
|
11
|
-
/** @hidden */
|
|
12
|
-
declare
|
|
13
|
-
export { ITwoProngDebugFunctions, twoProngDebugFunctions };
|
|
1
|
+
import { ElemType_TwoProng } from '../../mat/elem-type-two-prong.js';
|
|
2
|
+
/** @hidden */
|
|
3
|
+
interface ITwoProngDebugFunctions {
|
|
4
|
+
logδ: (n: number, type?: ElemType_TwoProng) => void;
|
|
5
|
+
log: (n: number, type?: ElemType_TwoProng) => void;
|
|
6
|
+
drawNormal: (g: SVGGElement, n: number, showDelay?: number) => void;
|
|
7
|
+
logδBasic: (n: number) => void;
|
|
8
|
+
logNearest: (g: SVGGElement, p: number[], showDelay?: number) => void;
|
|
9
|
+
traceConvergence: (g: SVGGElement, n: number, finalOnly?: boolean, showDelay?: number, range?: number[], type?: ElemType_TwoProng) => void;
|
|
10
|
+
}
|
|
11
|
+
/** @hidden */
|
|
12
|
+
declare const twoProngDebugFunctions: ITwoProngDebugFunctions;
|
|
13
|
+
export { ITwoProngDebugFunctions, twoProngDebugFunctions };
|
|
@@ -1,118 +1,118 @@
|
|
|
1
|
-
import { drawFs } from 'flo-draw';
|
|
2
|
-
import { getObjClosestTo, distanceBetween, squaredDistanceBetween } from 'flo-vector2d';
|
|
3
|
-
/**
|
|
4
|
-
* @hidden
|
|
5
|
-
*/
|
|
6
|
-
function logδ(n, type = 'twoProng_regular') {
|
|
7
|
-
|
|
8
|
-
console.log(δ);
|
|
9
|
-
}
|
|
10
|
-
/**
|
|
11
|
-
* @hidden
|
|
12
|
-
*/
|
|
13
|
-
function log(n, type = 'twoProng_regular') {
|
|
14
|
-
|
|
15
|
-
console.log(twoProng);
|
|
16
|
-
}
|
|
17
|
-
/**
|
|
18
|
-
* @hidden
|
|
19
|
-
*/
|
|
20
|
-
function drawNormal(g, n, showDelay = 1000, type = 'twoProng_regular') {
|
|
21
|
-
|
|
22
|
-
// If not specified which, draw all
|
|
23
|
-
if (n === undefined) {
|
|
24
|
-
for (let i = 0; i < twoProngs.length; i++) {
|
|
25
|
-
drawNormal(g, i);
|
|
26
|
-
}
|
|
27
|
-
}
|
|
28
|
-
|
|
29
|
-
//let g = twoProng.generated.g;
|
|
30
|
-
if (!twoProng) {
|
|
31
|
-
return;
|
|
32
|
-
}
|
|
33
|
-
drawFs.line(g, [twoProng.pos.p, twoProng.circle.center], 'thin10 blue', showDelay);
|
|
34
|
-
}
|
|
35
|
-
/**
|
|
36
|
-
* @hidden
|
|
37
|
-
*/
|
|
38
|
-
function logδBasic(n, type = 'twoProng_regular') {
|
|
39
|
-
|
|
40
|
-
function f(x) {
|
|
41
|
-
|
|
42
|
-
return {
|
|
43
|
-
bez: pos.curve.ps,
|
|
44
|
-
t: pos.t
|
|
45
|
-
};
|
|
46
|
-
}
|
|
47
|
-
console.log(f(delta[0]));
|
|
48
|
-
console.log(f(delta[1]));
|
|
49
|
-
}
|
|
50
|
-
/**
|
|
51
|
-
* @hidden
|
|
52
|
-
*/
|
|
53
|
-
function logNearest(g, p, showDelay = 1000, type = 'twoProng_regular') {
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
closestPerLoops.push(twoProng);
|
|
58
|
-
console.log(twoProng);
|
|
59
|
-
let n;
|
|
60
|
-
for (let i = 0; i < _debug_.generated.elems[type].length; i++) {
|
|
61
|
-
|
|
62
|
-
if (twoProng_ === twoProng) {
|
|
63
|
-
n = i;
|
|
64
|
-
break;
|
|
65
|
-
}
|
|
66
|
-
}
|
|
67
|
-
if (n !== undefined) {
|
|
68
|
-
traceConvergence(g, n, true, showDelay);
|
|
69
|
-
}
|
|
70
|
-
}
|
|
71
|
-
/**
|
|
72
|
-
* @hidden
|
|
73
|
-
* @param n - The 2-prong's zero-based index.
|
|
74
|
-
* @param range
|
|
75
|
-
*/
|
|
76
|
-
function traceConvergence(g, n, finalOnly, showDelay = 1000, range = undefined, type = 'twoProng_regular') {
|
|
77
|
-
if (n === undefined) {
|
|
78
|
-
return;
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
//let g = twoProngInfo.generated.g;
|
|
83
|
-
console.log(twoProngInfo);
|
|
84
|
-
console.log(twoProngInfo.xs.map(x => ({
|
|
85
|
-
x: x.x,
|
|
86
|
-
y: x.y,
|
|
87
|
-
z: x.z,
|
|
88
|
-
d: x.z ? squaredDistanceBetween(x.y.p, x.z.p) : 0,
|
|
89
|
-
t: x.t,
|
|
90
|
-
})));
|
|
91
|
-
for (let i = 0; i < xs.length; i++) {
|
|
92
|
-
if (range && (i < range[0] || i >= range[1])) {
|
|
93
|
-
continue;
|
|
94
|
-
}
|
|
95
|
-
if (finalOnly && i !== xs.length - 1) {
|
|
96
|
-
continue;
|
|
97
|
-
}
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
drawFs.crossHair(g, x.x, 'red thin10 nofill', undefined, showDelay);
|
|
101
|
-
drawFs.circle(g, circle, 'blue thin10 nofill', showDelay);
|
|
102
|
-
if (x.z !== undefined) {
|
|
103
|
-
drawFs.crossHair(g, x.z.p, 'yellow thin10 nofill', 2, showDelay);
|
|
104
|
-
}
|
|
105
|
-
}
|
|
106
|
-
twoProngDebugFunctions.drawNormal(g, n, showDelay);
|
|
107
|
-
}
|
|
108
|
-
/** @hidden */
|
|
109
|
-
|
|
110
|
-
logδ,
|
|
111
|
-
log,
|
|
112
|
-
drawNormal,
|
|
113
|
-
logδBasic,
|
|
114
|
-
traceConvergence,
|
|
115
|
-
logNearest,
|
|
116
|
-
};
|
|
117
|
-
export { twoProngDebugFunctions };
|
|
1
|
+
import { drawFs } from 'flo-draw';
|
|
2
|
+
import { getObjClosestTo, distanceBetween, squaredDistanceBetween } from 'flo-vector2d';
|
|
3
|
+
/**
|
|
4
|
+
* @hidden
|
|
5
|
+
*/
|
|
6
|
+
function logδ(n, type = 'twoProng_regular') {
|
|
7
|
+
const δ = _debug_.generated.elems[type][n].δ;
|
|
8
|
+
console.log(δ);
|
|
9
|
+
}
|
|
10
|
+
/**
|
|
11
|
+
* @hidden
|
|
12
|
+
*/
|
|
13
|
+
function log(n, type = 'twoProng_regular') {
|
|
14
|
+
const twoProng = _debug_.generated.elems[type][n];
|
|
15
|
+
console.log(twoProng);
|
|
16
|
+
}
|
|
17
|
+
/**
|
|
18
|
+
* @hidden
|
|
19
|
+
*/
|
|
20
|
+
function drawNormal(g, n, showDelay = 1000, type = 'twoProng_regular') {
|
|
21
|
+
const twoProngs = _debug_.generated.elems[type];
|
|
22
|
+
// If not specified which, draw all
|
|
23
|
+
if (n === undefined) {
|
|
24
|
+
for (let i = 0; i < twoProngs.length; i++) {
|
|
25
|
+
drawNormal(g, i);
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
const twoProng = twoProngs[n];
|
|
29
|
+
//let g = twoProng.generated.g;
|
|
30
|
+
if (!twoProng) {
|
|
31
|
+
return;
|
|
32
|
+
}
|
|
33
|
+
drawFs.line(g, [twoProng.pos.p, twoProng.circle.center], 'thin10 blue', showDelay);
|
|
34
|
+
}
|
|
35
|
+
/**
|
|
36
|
+
* @hidden
|
|
37
|
+
*/
|
|
38
|
+
function logδBasic(n, type = 'twoProng_regular') {
|
|
39
|
+
const delta = _debug_.generated.elems[type][n].δ;
|
|
40
|
+
function f(x) {
|
|
41
|
+
const pos = x.cp.pointOnShape;
|
|
42
|
+
return {
|
|
43
|
+
bez: pos.curve.ps,
|
|
44
|
+
t: pos.t
|
|
45
|
+
};
|
|
46
|
+
}
|
|
47
|
+
console.log(f(delta[0]));
|
|
48
|
+
console.log(f(delta[1]));
|
|
49
|
+
}
|
|
50
|
+
/**
|
|
51
|
+
* @hidden
|
|
52
|
+
*/
|
|
53
|
+
function logNearest(g, p, showDelay = 1000, type = 'twoProng_regular') {
|
|
54
|
+
const closestPerLoops = [];
|
|
55
|
+
const generated = _debug_.generated;
|
|
56
|
+
const twoProng = getObjClosestTo(p, generated.elems[type], twoProng => twoProng.circle.center);
|
|
57
|
+
closestPerLoops.push(twoProng);
|
|
58
|
+
console.log(twoProng);
|
|
59
|
+
let n;
|
|
60
|
+
for (let i = 0; i < _debug_.generated.elems[type].length; i++) {
|
|
61
|
+
const twoProng_ = _debug_.generated.elems[type][i];
|
|
62
|
+
if (twoProng_ === twoProng) {
|
|
63
|
+
n = i;
|
|
64
|
+
break;
|
|
65
|
+
}
|
|
66
|
+
}
|
|
67
|
+
if (n !== undefined) {
|
|
68
|
+
traceConvergence(g, n, true, showDelay);
|
|
69
|
+
}
|
|
70
|
+
}
|
|
71
|
+
/**
|
|
72
|
+
* @hidden
|
|
73
|
+
* @param n - The 2-prong's zero-based index.
|
|
74
|
+
* @param range
|
|
75
|
+
*/
|
|
76
|
+
function traceConvergence(g, n, finalOnly, showDelay = 1000, range = undefined, type = 'twoProng_regular') {
|
|
77
|
+
if (n === undefined) {
|
|
78
|
+
return;
|
|
79
|
+
}
|
|
80
|
+
const twoProngInfo = _debug_.generated.elems[type][n];
|
|
81
|
+
const xs = twoProngInfo.xs;
|
|
82
|
+
//let g = twoProngInfo.generated.g;
|
|
83
|
+
console.log(twoProngInfo);
|
|
84
|
+
console.log(twoProngInfo.xs.map(x => ({
|
|
85
|
+
x: x.x,
|
|
86
|
+
y: x.y,
|
|
87
|
+
z: x.z,
|
|
88
|
+
d: x.z ? squaredDistanceBetween(x.y.p, x.z.p) : 0,
|
|
89
|
+
t: x.t,
|
|
90
|
+
})));
|
|
91
|
+
for (let i = 0; i < xs.length; i++) {
|
|
92
|
+
if (range && (i < range[0] || i >= range[1])) {
|
|
93
|
+
continue;
|
|
94
|
+
}
|
|
95
|
+
if (finalOnly && i !== xs.length - 1) {
|
|
96
|
+
continue;
|
|
97
|
+
}
|
|
98
|
+
const x = twoProngInfo.xs[i];
|
|
99
|
+
const circle = { center: x.x, radius: distanceBetween(x.x, x.y.p) };
|
|
100
|
+
drawFs.crossHair(g, x.x, 'red thin10 nofill', undefined, showDelay);
|
|
101
|
+
drawFs.circle(g, circle, 'blue thin10 nofill', showDelay);
|
|
102
|
+
if (x.z !== undefined) {
|
|
103
|
+
drawFs.crossHair(g, x.z.p, 'yellow thin10 nofill', 2, showDelay);
|
|
104
|
+
}
|
|
105
|
+
}
|
|
106
|
+
twoProngDebugFunctions.drawNormal(g, n, showDelay);
|
|
107
|
+
}
|
|
108
|
+
/** @hidden */
|
|
109
|
+
const twoProngDebugFunctions = {
|
|
110
|
+
logδ,
|
|
111
|
+
log,
|
|
112
|
+
drawNormal,
|
|
113
|
+
logδBasic,
|
|
114
|
+
traceConvergence,
|
|
115
|
+
logNearest,
|
|
116
|
+
};
|
|
117
|
+
export { twoProngDebugFunctions };
|
|
118
118
|
//# sourceMappingURL=two-prong.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"two-prong.js","sourceRoot":"","sources":["../../../src/debug/functions/two-prong.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAoBxF;;GAEG;AACH,SAAS,IAAI,CAAC,CAAS,EAAE,OAA0B,kBAAkB;IACpE,
|
|
1
|
+
{"version":3,"file":"two-prong.js","sourceRoot":"","sources":["../../../src/debug/functions/two-prong.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAoBxF;;GAEG;AACH,SAAS,IAAI,CAAC,CAAS,EAAE,OAA0B,kBAAkB;IACpE,MAAM,CAAC,GAAE,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC;AAGD;;GAEG;AACH,SAAS,GAAG,CAAC,CAAS,EAAE,OAA0B,kBAAkB;IACnE,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AACvB,CAAC;AAGD;;GAEG;AACH,SAAS,UAAU,CACjB,CAAc,EACd,CAAS,EACT,SAAS,GAAG,IAAI,EAChB,OAA0B,kBAAkB;IAE7C,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEhD,mCAAmC;IACnC,IAAI,CAAC,KAAK,SAAS,EAAE;QACpB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACjB;KACD;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAE9B,+BAA+B;IAE/B,IAAI,CAAC,QAAQ,EAAE;QAAE,OAAO;KAAE;IAE1B,MAAM,CAAC,IAAI,CACV,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,aAAa,EAAE,SAAS,CACrE,CAAC;AACH,CAAC;AAGD;;GAEG;AACH,SAAS,SAAS,CAChB,CAAS,EACT,OAA0B,kBAAkB;IAE7C,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjD,SAAS,CAAC,CAAC,CAAS;QACnB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC;QAC9B,OAAO;YACN,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;YACjB,CAAC,EAAE,GAAG,CAAC,CAAC;SACR,CAAA;IACF,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAGD;;GAEG;AACH,SAAS,UAAU,CAAC,CAAc,EAAE,CAAW,EAAE,SAAS,GAAG,IAAI,EAAE,OAA0B,kBAAkB;IAC9G,MAAM,eAAe,GAA2B,EAAE,CAAC;IAEnD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IACpC,MAAM,QAAQ,GAAG,eAAe,CAC/B,CAAC,EACD,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EACrB,QAAQ,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAClC,CAAC;IACF,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAE/B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEtB,IAAI,CAAC,CAAC;IACN,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC1D,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,QAAQ,EAAE;YAC3B,CAAC,GAAG,CAAC,CAAC;YACN,MAAM;SACN;KACD;IAED,IAAI,CAAC,KAAK,SAAS,EAAE;QAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;KAAE;AAClE,CAAC;AAGD;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,CAAc,EACd,CAAkB,EAClB,SAAmB,EACnB,SAAS,GAAG,IAAI,EAChB,QAAuB,SAAS,EAChC,OAAgC,kBAAkB;IAEnD,IAAI,CAAC,KAAK,SAAS,EAAE;QAAE,OAAO;KAAE;IAEhC,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,CAAC;IAC3B,mCAAmC;IAEnC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC1B,OAAO,CAAC,GAAG,CACV,YAAY,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC,EAAE,CAAC,CAAC,CAAC;QACN,CAAC,EAAE,CAAC,CAAC,CAAC;QACN,CAAC,EAAE,CAAC,CAAC,CAAC;QACN,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,EAAE,CAAC,CAAC,CAAC;KACN,CAAC,CACF,CACD,CAAC;IAEF,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YAC7C,SAAS;SACT;QACD,IAAI,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC,MAAM,GAAC,CAAC,EAAE;YACnC,SAAS;SACT;QAED,MAAM,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE7B,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,oBAAoB,EAAE,SAAS,CAAC,CAAC;QAC1D,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;YACtB,MAAM,CAAC,SAAS,CACf,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,sBAAsB,EAAE,CAAC,EAAE,SAAS,CAC9C,CAAC;SACF;KACD;IAED,sBAAsB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AACpD,CAAC;AAGD,cAAc;AACd,MAAM,sBAAsB,GAA4B;IACvD,IAAI;IACJ,GAAG;IACH,UAAU;IACV,SAAS;IACT,gBAAgB;IAChB,UAAU;CACV,CAAA;AAGD,OAAO,EAA2B,sBAAsB,EAAE,CAAC"}
|
|
@@ -1,31 +1,31 @@
|
|
|
1
|
-
import { CpNode } from '../cp-node.js';
|
|
2
|
-
import { IPointOnShape } from '../point-on-shape.js';
|
|
3
|
-
import { Circle } from '../circle.js';
|
|
4
|
-
import { Generated } from './debug.js';
|
|
5
|
-
/**
|
|
6
|
-
* @hidden
|
|
7
|
-
* Used for debugging only. A three-prong is a maximally inscribed circle that
|
|
8
|
-
* touches the shape boundary (tangentially) at 3 points.
|
|
9
|
-
*/
|
|
10
|
-
interface ThreeProngForDebugging {
|
|
11
|
-
generated: Generated;
|
|
12
|
-
/** The best fit circle found for the 3-prong. */
|
|
13
|
-
circle: Circle;
|
|
14
|
-
/** The best fit 3 points found for the 3-prong. */
|
|
15
|
-
poss: IPointOnShape[];
|
|
16
|
-
/** The 3 boundary pieces on which the three prong points were found. */
|
|
17
|
-
cp3ss: CpNode[][];
|
|
18
|
-
/** The boundary pieces that were used to search the three prong on. */
|
|
19
|
-
cpss: CpNode[][];
|
|
20
|
-
bestIndx: number;
|
|
21
|
-
/** An array of 3-prongs, each of which may be a best fit 3-prong. */
|
|
22
|
-
candidateThreeProngs: {
|
|
23
|
-
circle: Circle;
|
|
24
|
-
ps: IPointOnShape[];
|
|
25
|
-
}[];
|
|
26
|
-
visitedCps: CpNode[];
|
|
27
|
-
boundaries: number[][][][];
|
|
28
|
-
traces: number[][][];
|
|
29
|
-
}
|
|
30
|
-
declare function createEmptyThreeProngForDebugging(): ThreeProngForDebugging;
|
|
31
|
-
export { ThreeProngForDebugging, createEmptyThreeProngForDebugging };
|
|
1
|
+
import { CpNode } from '../cp-node.js';
|
|
2
|
+
import { IPointOnShape } from '../point-on-shape.js';
|
|
3
|
+
import { Circle } from '../circle.js';
|
|
4
|
+
import { Generated } from './debug.js';
|
|
5
|
+
/**
|
|
6
|
+
* @hidden
|
|
7
|
+
* Used for debugging only. A three-prong is a maximally inscribed circle that
|
|
8
|
+
* touches the shape boundary (tangentially) at 3 points.
|
|
9
|
+
*/
|
|
10
|
+
interface ThreeProngForDebugging {
|
|
11
|
+
generated: Generated;
|
|
12
|
+
/** The best fit circle found for the 3-prong. */
|
|
13
|
+
circle: Circle;
|
|
14
|
+
/** The best fit 3 points found for the 3-prong. */
|
|
15
|
+
poss: IPointOnShape[];
|
|
16
|
+
/** The 3 boundary pieces on which the three prong points were found. */
|
|
17
|
+
cp3ss: CpNode[][];
|
|
18
|
+
/** The boundary pieces that were used to search the three prong on. */
|
|
19
|
+
cpss: CpNode[][];
|
|
20
|
+
bestIndx: number;
|
|
21
|
+
/** An array of 3-prongs, each of which may be a best fit 3-prong. */
|
|
22
|
+
candidateThreeProngs: {
|
|
23
|
+
circle: Circle;
|
|
24
|
+
ps: IPointOnShape[];
|
|
25
|
+
}[];
|
|
26
|
+
visitedCps: CpNode[];
|
|
27
|
+
boundaries: number[][][][];
|
|
28
|
+
traces: number[][][];
|
|
29
|
+
}
|
|
30
|
+
declare function createEmptyThreeProngForDebugging(): ThreeProngForDebugging;
|
|
31
|
+
export { ThreeProngForDebugging, createEmptyThreeProngForDebugging };
|
|
@@ -1,21 +1,21 @@
|
|
|
1
|
-
import { posToHumanString } from '../point-on-shape.js';
|
|
2
|
-
function createEmptyThreeProngForDebugging() {
|
|
3
|
-
return {
|
|
4
|
-
generated: undefined,
|
|
5
|
-
circle: undefined,
|
|
6
|
-
poss: undefined,
|
|
7
|
-
cp3ss: undefined,
|
|
8
|
-
cpss: undefined,
|
|
9
|
-
bestIndx: undefined,
|
|
10
|
-
candidateThreeProngs: undefined,
|
|
11
|
-
visitedCps: undefined,
|
|
12
|
-
boundaries: undefined,
|
|
13
|
-
traces: undefined,
|
|
14
|
-
};
|
|
15
|
-
}
|
|
16
|
-
function cpsSimple(threeProngForDebugging) {
|
|
17
|
-
return threeProngForDebugging.cpss.map(δ => [posToHumanString(δ[0].cp.pointOnShape),
|
|
18
|
-
posToHumanString(δ[1].cp.pointOnShape)]);
|
|
19
|
-
}
|
|
20
|
-
export { createEmptyThreeProngForDebugging };
|
|
1
|
+
import { posToHumanString } from '../point-on-shape.js';
|
|
2
|
+
function createEmptyThreeProngForDebugging() {
|
|
3
|
+
return {
|
|
4
|
+
generated: undefined,
|
|
5
|
+
circle: undefined,
|
|
6
|
+
poss: undefined,
|
|
7
|
+
cp3ss: undefined,
|
|
8
|
+
cpss: undefined,
|
|
9
|
+
bestIndx: undefined,
|
|
10
|
+
candidateThreeProngs: undefined,
|
|
11
|
+
visitedCps: undefined,
|
|
12
|
+
boundaries: undefined,
|
|
13
|
+
traces: undefined,
|
|
14
|
+
};
|
|
15
|
+
}
|
|
16
|
+
function cpsSimple(threeProngForDebugging) {
|
|
17
|
+
return threeProngForDebugging.cpss.map(δ => [posToHumanString(δ[0].cp.pointOnShape),
|
|
18
|
+
posToHumanString(δ[1].cp.pointOnShape)]);
|
|
19
|
+
}
|
|
20
|
+
export { createEmptyThreeProngForDebugging };
|
|
21
21
|
//# sourceMappingURL=three-prong-for-debugging.js.map
|
|
@@ -1,26 +1,26 @@
|
|
|
1
|
-
import { CpNode } from '../cp-node.js';
|
|
2
|
-
import { IPointOnShape } from '../point-on-shape.js';
|
|
3
|
-
import { Circle } from '../circle.js';
|
|
4
|
-
import { BezierPiece } from '../mat/bezier-piece.js';
|
|
5
|
-
import { Generated } from './debug.js';
|
|
6
|
-
/** @hidden */
|
|
7
|
-
interface TwoProngForDebugging {
|
|
8
|
-
generated: Generated;
|
|
9
|
-
bezierPieces: BezierPiece[];
|
|
10
|
-
pos: IPointOnShape;
|
|
11
|
-
δ: CpNode[];
|
|
12
|
-
z: number[];
|
|
13
|
-
circle: Circle;
|
|
14
|
-
xs: {
|
|
15
|
-
x: number[];
|
|
16
|
-
y: IPointOnShape;
|
|
17
|
-
z: IPointOnShape;
|
|
18
|
-
t: number;
|
|
19
|
-
}[];
|
|
20
|
-
failed: boolean;
|
|
21
|
-
holeClosing: boolean;
|
|
22
|
-
notAdded: boolean;
|
|
23
|
-
deleted: boolean;
|
|
24
|
-
cpNode: CpNode;
|
|
25
|
-
}
|
|
26
|
-
export { TwoProngForDebugging };
|
|
1
|
+
import { CpNode } from '../cp-node.js';
|
|
2
|
+
import { IPointOnShape } from '../point-on-shape.js';
|
|
3
|
+
import { Circle } from '../circle.js';
|
|
4
|
+
import { BezierPiece } from '../mat/bezier-piece.js';
|
|
5
|
+
import { Generated } from './debug.js';
|
|
6
|
+
/** @hidden */
|
|
7
|
+
interface TwoProngForDebugging {
|
|
8
|
+
generated: Generated;
|
|
9
|
+
bezierPieces: BezierPiece[];
|
|
10
|
+
pos: IPointOnShape;
|
|
11
|
+
δ: CpNode[];
|
|
12
|
+
z: number[];
|
|
13
|
+
circle: Circle;
|
|
14
|
+
xs: {
|
|
15
|
+
x: number[];
|
|
16
|
+
y: IPointOnShape;
|
|
17
|
+
z: IPointOnShape;
|
|
18
|
+
t: number;
|
|
19
|
+
}[];
|
|
20
|
+
failed: boolean;
|
|
21
|
+
holeClosing: boolean;
|
|
22
|
+
notAdded: boolean;
|
|
23
|
+
deleted: boolean;
|
|
24
|
+
cpNode: CpNode;
|
|
25
|
+
}
|
|
26
|
+
export { TwoProngForDebugging };
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
export {};
|
|
1
|
+
export {};
|
|
2
2
|
//# sourceMappingURL=two-prong-for-debugging.js.map
|
package/node/find-mats.d.ts
CHANGED
|
@@ -1,26 +1,26 @@
|
|
|
1
|
-
import { Mat } from './mat.js';
|
|
2
|
-
/**
|
|
3
|
-
* Finds and returns the Medial Axis Transforms (MATs) from the given array of
|
|
4
|
-
* bezier loops representing shape boundaries.
|
|
5
|
-
*
|
|
6
|
-
* @param bezierLoops An array of (possibly intersecting) loops with each loop
|
|
7
|
-
* representing one or more piecewise smooth closed curves (i.e. shapes). Each
|
|
8
|
-
* loop consists of an array of beziers represented by an array of control
|
|
9
|
-
* points with 2,3 or 4 elements corresponding to linear, quadratic and cubic
|
|
10
|
-
* beziers respectively. Each point is a two-element array (ordered pair), the
|
|
11
|
-
* first of which is the x-coordinate and the second the y-coordinate.
|
|
12
|
-
*
|
|
13
|
-
* @param maxCurviness The maximum value the 'curviness' of a curve can have
|
|
14
|
-
* before an additional MAT point is inserted in between. Defaults to 0.4.
|
|
15
|
-
* (Curviness is measured as the total angle in radians between the consecutive
|
|
16
|
-
* vectors formed by the ordered control points of th bezier curve). The value
|
|
17
|
-
* is clipped in the range `[0.05,3]`.
|
|
18
|
-
* @param maxLength The maximum length a curve can have before an additional MAT
|
|
19
|
-
* point is inserted. This value is scaled to a reference 1024 x 1024
|
|
20
|
-
* grid (e.g. if the shape fits in a 512 x 512 axis-aligned box the value will be
|
|
21
|
-
* halved, e.g. from 10 to 5). Together with maxCurviness it represents a
|
|
22
|
-
* tolerance for the accuracy of the MAT. Defaults to 4. The value is clipped
|
|
23
|
-
* in [1,100].
|
|
24
|
-
*/
|
|
25
|
-
declare function findMats(bezierLoops: number[][][][], maxCurviness?: number, maxLength?: number): Mat[];
|
|
26
|
-
export { findMats };
|
|
1
|
+
import { Mat } from './mat.js';
|
|
2
|
+
/**
|
|
3
|
+
* Finds and returns the Medial Axis Transforms (MATs) from the given array of
|
|
4
|
+
* bezier loops representing shape boundaries.
|
|
5
|
+
*
|
|
6
|
+
* @param bezierLoops An array of (possibly intersecting) loops with each loop
|
|
7
|
+
* representing one or more piecewise smooth closed curves (i.e. shapes). Each
|
|
8
|
+
* loop consists of an array of beziers represented by an array of control
|
|
9
|
+
* points with 2,3 or 4 elements corresponding to linear, quadratic and cubic
|
|
10
|
+
* beziers respectively. Each point is a two-element array (ordered pair), the
|
|
11
|
+
* first of which is the x-coordinate and the second the y-coordinate.
|
|
12
|
+
*
|
|
13
|
+
* @param maxCurviness The maximum value the 'curviness' of a curve can have
|
|
14
|
+
* before an additional MAT point is inserted in between. Defaults to 0.4.
|
|
15
|
+
* (Curviness is measured as the total angle in radians between the consecutive
|
|
16
|
+
* vectors formed by the ordered control points of th bezier curve). The value
|
|
17
|
+
* is clipped in the range `[0.05,3]`.
|
|
18
|
+
* @param maxLength The maximum length a curve can have before an additional MAT
|
|
19
|
+
* point is inserted. This value is scaled to a reference 1024 x 1024
|
|
20
|
+
* grid (e.g. if the shape fits in a 512 x 512 axis-aligned box the value will be
|
|
21
|
+
* halved, e.g. from 10 to 5). Together with maxCurviness it represents a
|
|
22
|
+
* tolerance for the accuracy of the MAT. Defaults to 4. The value is clipped
|
|
23
|
+
* in [1,100].
|
|
24
|
+
*/
|
|
25
|
+
declare function findMats(bezierLoops: number[][][][], maxCurviness?: number, maxLength?: number): Mat[];
|
|
26
|
+
export { findMats };
|