检查具有纬度和经度的地理点是否在 shapefile 内
如何检查地理点是否在给定 shapefile 的区域内?
我设法在 python 中加载 shapefile,但无法进一步。
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
如何检查地理点是否在给定 shapefile 的区域内?
我设法在 python 中加载 shapefile,但无法进一步。
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
接受
或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论(7)
另一种选择是使用 Shapely(基于 GEOS 的 Python 库,PostGIS 的引擎)和 Fiona(基本上用于读取/写入文件):
请注意,如果多边形很大,则进行多边形中的点测试可能会很昂贵/复杂(例如,某些海岸线极其不规则的国家的形状文件)。在某些情况下,在进行更密集的测试之前,使用边界框可以帮助快速排除问题:
最后,请记住,加载和解析大型/不规则形状文件需要一些时间(不幸的是,这些类型的多边形通常很昂贵)也保留在记忆中)。
Another option is to use Shapely (a Python library based on GEOS, the engine for PostGIS) and Fiona (which is basically for reading/writing files):
Note that doing point-in-polygon tests can be expensive if the polygon is large/complicated (e.g., shapefiles for some countries with extremely irregular coastlines). In some cases it can help to use bounding boxes to quickly rule things out before doing the more intensive test:
Lastly, keep in mind that it takes some time to load and parse large/irregular shapefiles (unfortunately, those types of polygons are often expensive to keep in memory, too).
这是 yosukesabai 答案的改编。
我想确保我正在搜索的点与 shapefile 位于同一投影系统中,因此我为此添加了代码。
我无法理解为什么他要对 ply = feat_in.GetGeometryRef() 进行包含测试(在我的测试中,没有它似乎也能正常工作),所以我删除了它。
我还改进了评论,以更好地解释正在发生的事情(据我所知)。
此网站,此网站,以及 此网站对于投影检查很有帮助。 EPSG:4326
This is an adaptation of yosukesabai's answer.
I wanted to ensure that the point I was searching for was in the same projection system as the shapefile, so I've added code for that.
I couldn't understand why he was doing a contains test on
ply = feat_in.GetGeometryRef()
(in my testing things seemed to work just as well without it), so I removed that.I've also improved the commenting to better explain what's going on (as I understand it).
This site, this site, and this site were helpful regarding the projection check. EPSG:4326
这是一个基于 pyshp 和 匀称。
假设您的 shapefile 仅包含一个多边形(但您可以轻松适应多个多边形):
Here is a simple solution based on pyshp and shapely.
Let's assume that your shapefile only contains one polygon (but you can easily adapt for multiple polygons):
一种方法是使用 OGR 读取 ESRI Shape 文件
库链接,然后使用 GEOS几何学
库 http://trac.osgeo.org/geos/ 执行多边形内的点测试。
这需要一些 C/C++ 编程。
还有一个 GEOS 的 Python 接口,位于 http://sgillies.net/blog/ 14/python-geos-module/ (我从未使用过)。也许这就是你想要的?
另一种解决方案是使用 http://geotools.org/ 库。
那是在Java中。
我也有自己的 Java 软件来执行此操作(您可以下载
来自 http://www.mapyrus.org 以及来自 jts.jar href="http://www.vividsolutions.com/products.asp" rel="nofollow noreferrer">http://www.vividsolutions.com/products.asp )。您只需要一个文本命令
文件
inside.mapyrus
包含以下几行检查一个点是否位于
ESRI Shape 文件中的第一个多边形:
并运行:
如果该点在内部,它将打印 1,否则打印 0。
如果您将此问题发布到
https://gis.stackexchange.com/
One way to do this is to read the ESRI Shape file using the OGR
library Link and then use the GEOS geometry
library http://trac.osgeo.org/geos/ to do the point-in-polygon test.
This requires some C/C++ programming.
There is also a python interface to GEOS at http://sgillies.net/blog/14/python-geos-module/ (which I have never used). Maybe that is what you want?
Another solution is to use the http://geotools.org/ library.
That is in Java.
I also have my own Java software to do this (which you can download
from http://www.mapyrus.org plus
jts.jar
from http://www.vividsolutions.com/products.asp ). You need only a text commandfile
inside.mapyrus
containingthe following lines to check if a point lays inside the
first polygon in the ESRI Shape file:
And run with:
It will print a 1 if the point is inside, 0 otherwise.
You might also get some good answers if you post this question on
https://gis.stackexchange.com/
我使用 gdal 的 ogr 和 python 绑定几乎完成了你昨天所做的事情。看起来像这样。
i did almost exactly what you are doing yesterday using gdal's ogr with python binding. It looked like this.
查看http://geospatialpython.com/2011/01/point-in-polygon。 html 和 http://geospatialpython.com/2011/08/point-in-polygon-2-on-line.html
Checkout http://geospatialpython.com/2011/01/point-in-polygon.html and http://geospatialpython.com/2011/08/point-in-polygon-2-on-line.html
如果你想找出哪个多边形(来自充满多边形的形状文件)包含给定点(并且你也有一堆点),最快的方法是使用 postgis。我实际上实现了一个基于 fiona 的版本,使用了这里的答案,但速度非常慢(我首先使用多重处理并检查边界框)。 400 分钟处理 = 50k 点。使用 postgis,花费了不到 10 秒的时间。 B树索引高效!
这将使用 shapefile 中的信息生成一个 sql 文件,创建一个支持 postgis 的数据库并运行该 sql。在 geom 列上创建要点索引。然后,查找多边形的名称:
If you want to find out which polygon (from a shapefile full of them) contains a given point (and you have a bunch of points as well), the fastest way is using postgis. I actually implemented a fiona based version, using the answers here, but it was painfully slow (I was using multiprocessing and checking bounding box first). 400 minutes of processing = 50k points. Using postgis, that took less than 10seconds. B tree indexes are efficient!
That will generate a sql file with the information from the shapefiles, create a database with postgis support and run that sql. Create a gist index on the geom column. Then, to find the name of the polygon: