Metadata-Version: 2.4
Name: crdp-gcr
Version: 0.1
Summary: A fast Ramer-Douglas-Peucker algorithm implementation. Updated for GCP cloud run
Home-page: https://github.com/vtecftwy/crdp-gcp
Author: Fabien PFAENDER
Author-email: fabien.pfaender@utc.fr
License: MIT
Keywords: rdp ramer douglas peucker line simplification cython
Classifier: Programming Language :: Python :: 3
Classifier: Operating System :: OS Independent
Requires-Python: >=3.10, <4
Description-Content-Type: text/markdown
License-File: LICENSE.txt
Requires-Dist: cython
Provides-Extra: dev
Requires-Dist: cython; extra == "dev"
Dynamic: author
Dynamic: author-email
Dynamic: classifier
Dynamic: description
Dynamic: description-content-type
Dynamic: home-page
Dynamic: keywords
Dynamic: license
Dynamic: license-file
Dynamic: provides-extra
Dynamic: requires-dist
Dynamic: requires-python
Dynamic: summary

# crdp-gcr

Cython implementation of Ramer-Douglas-Peucker algorithm, identical to [crdp](https://pypi.org/project/crdp/0.0.2/) but modified to run as a google cloud function.

## Usage
```
pip instal crdp-gcr
```

```python
In [1]: from crdp import rdp

In [2]: rdp([[1,1],[2,3],[3,3],[4,4]], 0.8)
Out[2]: [[1, 1], [4, 4]]

In [3]: rdp([[1,1],[2,3],[3,3],[4,4]], 0.7)
Out[3]: [[1, 1], [2, 3], [4, 4]]
```

All credit to [Bi Ran](https://github.com/biran0079), author of the original code
