FINDPOLY: A fast points-in-polygons test

Version 1.0.0 (1.63 MB) by Darren Engwirda
A fast test to determine generalised points-in-polygons queries for arbitrary collections of polygons.
5.0
(1)
174 Downloads
Updated 27 Mar 2021
View License on GitHub

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 .

MATLAB Release Compatibility
Created with R2020a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

aabb-tree

mesh-file

poly-test

Versions that use the GitHub default branch cannot be downloaded

Version Published Release Notes
1.0.0

To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.