https://github.com/koda7/point-in-polygon-detection
Developed an optimized solution to the point-polygon query program mentioned by the ACM SIGSPATIAL CUP 2013. Showed differences between naive solution and my solution. Achieved 100% accuracy for both 'INSIDE' and 'WITHIN n' queries.
https://github.com/koda7/point-in-polygon-detection
point-in-polygon sigspatial spatial-analysis within
Last synced: 4 months ago
JSON representation
Developed an optimized solution to the point-polygon query program mentioned by the ACM SIGSPATIAL CUP 2013. Showed differences between naive solution and my solution. Achieved 100% accuracy for both 'INSIDE' and 'WITHIN n' queries.
- Host: GitHub
- URL: https://github.com/koda7/point-in-polygon-detection
- Owner: Koda7
- Created: 2023-06-18T17:20:22.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2025-01-03T15:09:20.000Z (6 months ago)
- Last Synced: 2025-01-16T10:07:30.784Z (6 months ago)
- Topics: point-in-polygon, sigspatial, spatial-analysis, within
- Language: Jupyter Notebook
- Homepage:
- Size: 7.99 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Point-in-Polygon-Detection
## Description
- The codes provided are an optimized solution to the point-polygon query program mentioned by the **ACM SIGSPATIAL CUP
2013**, guaranteeing a high absolute accuracy rate
- The efficient algorithm that accelerates **’inside’** and **’within n’** relationship queries by at 5
seconds utilizing hierarchical indices
- The final report for the project is also attached for further details
## How to Run Code
- Run `python3 inside.py` to get the results for INSIDE query on the testing data
- Run `python3 within.py` to get the results for 'within n' query on the testing data