FINDPOLY: A fast points-in-polygons test

版本 1.0.0 (1.6 MB) 作者: Darren Engwirda
A fast test to determine generalised points-in-polygons queries for arbitrary collections of polygons.
5.0
(1)
165.0 次下载
更新时间 2021/3/27
在 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.

引用格式

Darren Engwirda (2024). FINDPOLY: A fast points-in-polygons test (https://github.com/dengwirda/find-poly), GitHub. 检索时间: .

MATLAB 版本兼容性
创建方式 R2020a
兼容任何版本
平台兼容性
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

aabb-tree

mesh-file

poly-test

无法下载基于 GitHub 默认分支的版本

版本 已发布 发行说明
1.0.0

要查看或报告此来自 GitHub 的附加功能中的问题，请访问其 GitHub 仓库。
要查看或报告此来自 GitHub 的附加功能中的问题，请访问其 GitHub 仓库。