|
| 1 | +// Types |
| 2 | +import type { Point } from '../VTrendline' |
| 3 | + |
| 4 | +/** |
| 5 | + * Monotone cubic Hermite interpolation (Fritsch-Carlson) converted to cubic Bezier. |
| 6 | + * Prevents overshoot at local extrema (e.g. consecutive equal min/max values) |
| 7 | + * by zeroing tangents at turning points and applying an alpha-beta constraint. |
| 8 | + * |
| 9 | + * `smooth` controls tension: 0 = straight lines, 8 (default true) = full curve. |
| 10 | + */ |
| 11 | +export function genMonotonePath (points: Point[], smooth: number, fill = false, height = 75) { |
| 12 | + if (points.length === 0) return '' |
| 13 | + |
| 14 | + const start = points[0] |
| 15 | + const end = points[points.length - 1] |
| 16 | + |
| 17 | + const prefix = fill |
| 18 | + ? `M${start.x} ${height - start.x + 2} L${start.x} ${start.y}` |
| 19 | + : `M${start.x} ${start.y}` |
| 20 | + |
| 21 | + const suffix = fill ? `L${end.x} ${height - start.x + 2} Z` : '' |
| 22 | + |
| 23 | + if (smooth === 0 || points.length < 3) { |
| 24 | + return prefix + points.slice(1).map(point => `L${point.x} ${point.y}`).join('') + suffix |
| 25 | + } |
| 26 | + |
| 27 | + const tension = Math.min(smooth / 8, 1) |
| 28 | + const n = points.length |
| 29 | + |
| 30 | + const delta: number[] = [] |
| 31 | + for (let i = 0; i < n - 1; i++) { |
| 32 | + const dx = points[i + 1].x - points[i].x |
| 33 | + delta[i] = dx === 0 ? 0 : (points[i + 1].y - points[i].y) / dx |
| 34 | + } |
| 35 | + |
| 36 | + const tangent: number[] = new Array(n) |
| 37 | + tangent[0] = delta[0] |
| 38 | + tangent[n - 1] = delta[n - 2] |
| 39 | + |
| 40 | + for (let i = 1; i < n - 1; i++) { |
| 41 | + if (delta[i - 1] === 0 || delta[i] === 0 || |
| 42 | + (delta[i - 1] > 0) !== (delta[i] > 0)) { |
| 43 | + tangent[i] = 0 |
| 44 | + } else { |
| 45 | + tangent[i] = (delta[i - 1] + delta[i]) / 2 |
| 46 | + } |
| 47 | + } |
| 48 | + |
| 49 | + for (let i = 0; i < n - 1; i++) { |
| 50 | + if (delta[i] === 0) { |
| 51 | + tangent[i] = 0 |
| 52 | + tangent[i + 1] = 0 |
| 53 | + } else { |
| 54 | + const alpha = tangent[i] / delta[i] |
| 55 | + const beta = tangent[i + 1] / delta[i] |
| 56 | + const squaredSum = alpha * alpha + beta * beta |
| 57 | + |
| 58 | + if (squaredSum > 9) { |
| 59 | + const tau = 3 / Math.sqrt(squaredSum) |
| 60 | + tangent[i] = tau * alpha * delta[i] |
| 61 | + tangent[i + 1] = tau * beta * delta[i] |
| 62 | + } |
| 63 | + } |
| 64 | + } |
| 65 | + |
| 66 | + const curves = points.slice(1).map((curr, index) => { |
| 67 | + const prev = points[index] |
| 68 | + const dx = curr.x - prev.x |
| 69 | + |
| 70 | + const controlPoint1X = prev.x + dx * tension / 3 |
| 71 | + const controlPoint1Y = prev.y + tangent[index] * dx * tension / 3 |
| 72 | + const controlPoint2X = curr.x - dx * tension / 3 |
| 73 | + const controlPoint2Y = curr.y - tangent[index + 1] * dx * tension / 3 |
| 74 | + |
| 75 | + return `C${controlPoint1X} ${controlPoint1Y} ${controlPoint2X} ${controlPoint2Y} ${curr.x} ${curr.y}` |
| 76 | + }) |
| 77 | + |
| 78 | + return prefix + curves.join('') + suffix |
| 79 | +} |
0 commit comments