Documentation
    Preparing search index...

    Function douglasPeucker

    • Douglas-Peucker path simplification algorithm. Reduces the number of points in a path while preserving its overall shape.

      Parameters

      • points: Point[]

        Input array of points

      • epsilon: number

        Maximum allowed distance from the simplified line (in the same units as points)

      Returns Point[]

      Simplified array of points