Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ntut-xuan/polygondust
PolygonDust is an application to measure the area size of polygon.
https://github.com/ntut-xuan/polygondust
Last synced: 21 days ago
JSON representation
PolygonDust is an application to measure the area size of polygon.
- Host: GitHub
- URL: https://github.com/ntut-xuan/polygondust
- Owner: ntut-xuan
- License: mit
- Created: 2024-09-08T18:58:15.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2024-12-05T13:58:33.000Z (29 days ago)
- Last Synced: 2024-12-05T14:33:34.136Z (29 days ago)
- Language: C++
- Homepage:
- Size: 94.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# PolygonDust
[](https://github.com/ntut-xuan/PolygonDust/actions/workflows/build-and-test.yaml) [](https://codecov.io/github/ntut-xuan/PolygonDust)
## Description
PolygonDust is an application to measure the area size of polygon with support complex polygon overlap analysis. You can cut, union, or intersect any two polygon to make a complex ploygon.
PolygonDust use raster-based method to measure the area size of polygon instead of vector-based method. We use *adjustable error-rate* [1] to strive for the fast process of overlap analysis, cause vector-based ovelap analysis will not efficient when meet huge amount of vertexs of polygon [2].
PolygonDust accept Shapefile (Should be polygon or multipolygon) or Waveform object file. Please take a look about [Usage](#usage).
* [1] We call it *adjustable error-rate* becasue the user can decide small size of particles and decrease the error-rate. With small particles may increase the accuracy but also increase the process time, large particles may increase the error-rate but faster.
* [2] We reference the view of this paper [Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI](https://ieeexplore.ieee.org/abstract/document/8335249), which declare that vector-based polygon overlap analysis may inefficient on the polygon with huge amount of vertexes.
## Installization
Please make sure that you already have Python environment, C++ compiler, CMake and Make.
```
pip install -r requirements.txt
pip install . -v
```
## Usage
```
usage: main.py [-h] [-i INPUT [INPUT ...]] [-s INPUT_SHPFILE [INPUT_SHPFILE ...]] [-p PARTICLES] [-o OPERATION]
options:
-h, --help show this help message and exit
-i INPUT [INPUT ...], --input INPUT [INPUT ...]
Input a polygon with vertexs.
-s INPUT_SHPFILE [INPUT_SHPFILE ...], --input_shpfile INPUT_SHPFILE [INPUT_SHPFILE ...]
Input a shapefile with vertexs.
-p PARTICLES, --particles PARTICLES
Particles size (in pixel).
-o OPERATION, --operation OPERATION
Polygon Operation (Union=U, Intersect=I, Cut=C), e.g. "UUIC"
```
You can try out with simple-polygon waveform object file we provided.
```
./polygondust/main.py -i simple-polygon1.obj -p 0.1
```
You can also try out with NYCU shapefile we provided.
```
./polygondust/main.py -s ./shapefile/NYCU_Campus.shp -p 1
```
We also provide Zhuhu (Which is the lake in NYCU) shapefile, you can union/cut/intersect with these shapefile.
### printing all polygon
```
./polygondust/main.py -s ./shapefile/NYCU_Campus.shp -s ./shapefile/Zhuhu.shp -p 1
```
### operating with polygons
```
./polygondust/main.py -s ./shapefile/NYCU_Campus.shp -s ./shapefile/Zhuhu.shp -p 1 -o "C"
```