Skip to content

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.

Notifications You must be signed in to change notification settings

Koda7/Point-in-Polygon-Detection

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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 an absolute accuracy rate of 100%
  • 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

About

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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published