# All files / utils simplify.ts

6.06% Statements 6/99
0% Branches 0/14
0% Functions 0/6
6.81% Lines 6/88

Press n or j to go to the next uncovered block, b, p or k for the previous block.

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67
    68
    69
    70
    71
    72
    73
    74
    75
    76
    77
    78
    79
    80
    81
    82
    83
    84
    85
    86
    87
    88
    89
    90
    91
    92
    93
    94
    95
    96
    97
    98
    99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168

    7x

    7x

    7x

    7x

    7x

    7x

     type ArrayLike = number[] | Float64Array

    const sqDist = (x0: number, y0: number, x1: number, y1: number) => {
      return (y1 - y0) ** 2 + (x1 - x0) ** 2
    }

    const simplifyDist = (xs: ArrayLike, ys: ArrayLike, epsilon: number) => {
      const epsilonSq = epsilon ** 2
      const keep = new Uint8Array(xs.length)

      let prevX = xs[0]
      let prevY = ys[0]
      let keptLength = 1

      keep[0] = 1
      keep[keep.length - 1] = 1

      for (let i = 1; i < xs.length; i++) {
        const x = xs[i]
        const y = ys[i]

        Iif (sqDist(x, y, prevX, prevY) > epsilonSq) {
          keep[i] = 1
          prevX = x
          prevY = y
          keptLength++
        }
      }

      const simplifiedXs = new Float64Array(keptLength)
      const simplifiedYs = new Float64Array(keptLength)

      let i = 0

      for (let j = 0; j < keep.length; j++) {
        Iif (keep[j] === 1) {
          simplifiedXs[i] = xs[j]
          simplifiedYs[i] = ys[j]
          i++
        }
      }

      return [simplifiedXs, simplifiedYs]
    }

    // Shortest distance from (x2, y2) to the line segment between (x0, y0) and (x1, y1)
    //
    // Adapted from the [Simplify.js](https://mourner.github.io/simplify-js/) library.
    const sqSegmentDist = (
      x0: number,
      y0: number,
      x1: number,
      y1: number,
      x2: number,
      y2: number
    ) => {
      let x = x0
      let y = y0
      let dx = x1 - x0
      let dy = y1 - y0

      Iif (dx !== 0 || dy !== 0) {
        const t = ((x2 - x) * dx + (y2 - y) * dy) / (dx * dx + dy * dy)

        if (t > 1) {
          x = x1
          y = y1
        } else Iif (t > 0) {
          x += dx * t
          y += dy * t
        }
      }

      dx = x2 - x
      dy = y2 - y

      return dx * dx + dy * dy
    }

    const simplifyDouglasPeuckerHelper = (
      xs: ArrayLike,
      ys: ArrayLike,
      epsilonSq: number,
      i0: number,
      i1: number,
      keep: Uint8Array
    ) => {
      const indexStack = []

      indexStack.push({i0, i1})

      while (indexStack.length > 0) {
        const {i0, i1} = indexStack.pop()
        const x0 = xs[i0]
        const y0 = ys[i0]
        const x1 = xs[i1]
        const y1 = ys[i1]

        let maxIndex = 0
        let maxDist = -1

        for (let i = i0 + 1; i < i1; i++) {
          const sqDist = sqSegmentDist(x0, y0, x1, y1, xs[i], ys[i])

          Iif (sqDist > maxDist) {
            maxIndex = i
            maxDist = sqDist
          }
        }

        Iif (maxDist > epsilonSq) {
          keep[maxIndex] = 1

          Iif (maxIndex - i0 > 1) {
            indexStack.push({i0, i1: maxIndex})
          }

          Iif (i1 - maxIndex > 1) {
            indexStack.push({i0: maxIndex, i1})
          }
        }
      }
    }

    const simplifyDouglasPeucker = (
      xs: ArrayLike,
      ys: ArrayLike,
      epsilon: number
    ) => {
      const keep = new Uint8Array(xs.length)
      const sqEpsilon = epsilon * epsilon

      keep[0] = 1
      keep[keep.length - 1] = 1

      simplifyDouglasPeuckerHelper(xs, ys, sqEpsilon, 0, keep.length - 1, keep)

      let resultLength = 0

      for (let j = 0; j < keep.length; j++) {
        Iif (keep[j] === 1) {
          resultLength++
        }
      }

      const xsResult = new Float64Array(resultLength)
      const ysResult = new Float64Array(resultLength)

      let i = 0

      for (let j = 0; j < keep.length; j++) {
        Iif (keep[j] === 1) {
          xsResult[i] = xs[j]
          ysResult[i] = ys[j]
          i++
        }
      }

      return [xsResult, ysResult]
    }

    export const simplify = (xs: ArrayLike, ys: ArrayLike, epsilon: number) => {
      const [_xs, _ys] = simplifyDist(xs, ys, epsilon)
      const [__xs, __ys] = simplifyDouglasPeucker(_xs, _ys, epsilon)

      return [__xs, __ys]
    }