simplify-path - GitLite

KO | EN

gitlite — search

#javascript #python #hacktoberfest #ai #llm #go #android #machine-learning #linux #macos #vue #awesome-list #pytorch #openai

simplify-path

(★ 94)

simplify 2D polyline of arrays

File Explorer

Download Latest Version (.zip)

.gitignore
.npmignore
douglas-peucker.js
index.js
LICENSE.md
package.json
radial-distance.js
README.md
test.js

# Installation Guide

1. Get the code

git clone https://github.com/mattdesl/simplify-path

Downloads the entire project code from GitHub to your computer.

cd simplify-path

Moves into the project folder you just downloaded.

2. Node.js

Easy Recommended

Prerequisites

Git Needed to download the project code from GitHub.
Node.js Node.js must be installed to use npm. The LTS version is recommended.

npm install

Downloads and installs the libraries listed in package.json.

npm start

Starts the development/run server.

✅ After running the command, open the address shown in the terminal (usually something like http://localhost:3000) in your browser.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# simplify-path

[![stable](http://badges.github.io/stability-badges/dist/stable.svg)](http://github.com/badges/stability-badges)

Simplifies a 2D polyline, first using a radial distance check, and then a recursive Douglas-Peucker algorithm. The code is from [simplify-js](https://github.com/mourner/simplify-js), but uses arrays for better interoperability with npm modules like stack.gl, parse-svg-path, [chaikin-smooth](https://www.npmjs.org/package/chaikin-smooth), ndarray, etc.

```js
var simplify = require('simplify-path')

//our input polyline
var path = [ [250, 150], [250, 150], [25, 25], [24, 25], [10, 10] ]
var tolerance = 10

//result
path = simplify(path, tolerance)
```

Result:

```
[ [ 250, 150 ], [ 25, 25 ], [ 10, 10 ] ]
```

Or you can use the algorithms individually:

```js
var path2 = simplify.radialDistance(path, tolerance)
var path3 = simplify.douglasPeucker(path, tolerance)
```

You can also require each algorithm separately:

```js
var simplify1 = require('simplify-path/radial-distance')
var simplify2 = require('simplify-path/douglas-peucker')
```

*Note:* For performance, this does not produce a deep copy of the input.

## Usage

[![NPM](https://nodei.co/npm/simplify-path.png)](https://nodei.co/npm/simplify-path/)

#### `simplify(path, tolerance)`

Simplifies the input path with the specified tolerance, removing redundant points first using radial distance, then Douglas-Peucker algorithm. Returns an array of simplified points.

#### `simplify.radialDistance(path, tolerance)`

Like above, but using only the Radial Distance algorithm.

#### `simplify.douglasPeucker(path, tolerance)`

Like above, but using only the Douglas-Peucker algorithm.

## License

MIT, see [LICENSE.md](http://github.com/mattdesl/simplify-path/blob/master/LICENSE.md) for details.