FINDPOLY: A fast points-in-polygons test
A fast test to determine generalised points-in-polygons queries for arbitrary collections of polygons.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
A fast INPOLYGON for multiple polygons.
Given a collection of polygons and a set of query points, FINDPOLY determines the set of enclosing polygons for each point. Arbitrary collections of polygons and query points are supported, and general non-convex and multiply-connected inputs can be handled. FINDPOLY employs various spatial indexing + sorting techniques, and is reasonably fast for large problems.
See POLYDEMO to get started with an example problem.
Cite As
Darren Engwirda (2026). FINDPOLY: A fast points-in-polygons test (https://github.com/dengwirda/find-poly), GitHub. Retrieved .
Acknowledgements
Inspired by: INPOLY: A fast points-in-polygon test, AABBTREE - A d-dimensional bounding-box tree.
General Information
- Version 1.0.0 (1.63 MB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
