Skip to main content
 首页 » 编程设计

python之获取位于 Shapely 多边形内的所有格点

2025年02月15日8shihaiming

我需要找到多边形内部和多边形上的所有格点。

输入:

from shapely.geometry import Polygon, mapping 
sh_polygon = Polygon(((0,0), (2,0), (2,2), (0,2))) 

输出:

(0, 0), (1, 0), (2, 0), (0, 1), (1, 1), (2, 1), (0, 2), (1, 2), (2, 2) 

请建议是否有办法在使用或不使用 Shapely 的情况下获得预期的结果。

我写了这段代码,它给出了多边形内部的点,但没有给出上面的点。还有没有更好的方法来做同样的事情:

from shapely.geometry import Polygon, Point 
 
def get_random_point_in_polygon(poly): 
    (minx, miny, maxx, maxy) = poly.bounds 
    minx = int(minx) 
    miny = int(miny) 
    maxx = int(maxx) 
    maxy = int(maxy) 
    print("poly.bounds:", poly.bounds) 
    a = [] 
    for x in range(minx, maxx+1): 
        for y in range(miny, maxy+1): 
            p = Point(x, y) 
            if poly.contains(p): 
                a.append([x, y]) 
    return a 
 
 
p = Polygon([(0,0), (2,0), (2,2), (0,2)]) 
point_in_poly = get_random_point_in_polygon(p) 
 
print(len(point_in_poly)) 
print(point_in_poly) 

输出:

poly.bounds: (0.0, 0.0, 2.0, 2.0) 
1 
[[1, 1]] 

我已经简化了我的问题。实际上,我需要找到一个带角正方形内部和上面的所有点:(77,97)、(141,101)、(136,165)、(73,160)。

请您参考如下方法:

我会按如下方式处理这个问题。

首先,定义格点网格。例如,可以使用 itertools.product :

from itertools import product 
from shapely.geometry import MultiPoint 
 
points = MultiPoint(list(product(range(5), repeat=2))) 

points = MultiPoint(list(product(range(10), range(5)))) 

或来自 Cartesian product of x and y array points into single array of 2D points 的任何 NumPy 解决方案:

import numpy as np 
 
x = np.linspace(0, 1, 5) 
y = np.linspace(0, 1, 10) 
points = MultiPoint(np.transpose([np.tile(x, len(y)), np.repeat(y, len(x))])) 

然后,使用 intersection Shapely 的方法,我们可以得到那些位于给定多边形内部和边界上的格点。

对于你给出的例子:

p = Polygon([(0, 0), (2, 0), (2, 2), (0, 2)]) 
xmin, ymin, xmax, ymax = p.bounds 
x = np.arange(np.floor(xmin), np.ceil(xmax) + 1)  # array([0., 1., 2.]) 
y = np.arange(np.floor(ymin), np.ceil(ymax) + 1)  # array([0., 1., 2.]) 
points = MultiPoint(np.transpose([np.tile(x, len(y)), np.repeat(y, len(x))])) 
result = points.intersection(p) 

还有一个更复杂的例子:

p = Polygon([(-4.85571368308564, 37.1753007358263),  
             (-4.85520937147867, 37.174925051829),  
             (-4.85259349198842, 37.1783463712614), 
             (-4.85258684662671, 37.1799609243756), 
             (-4.85347524651836, 37.1804461589773), 
             (-4.85343407576431, 37.182006629169), 
             (-4.85516283166052, 37.1842384372115), 
             (-4.85624511894443, 37.1837967179202), 
             (-4.85533824429553, 37.1783762575331), 
             (-4.85674599573635, 37.177038261295), 
             (-4.85571368308564, 37.1753007358263)]) 
xmin, ymin, xmax, ymax = p.bounds  # -4.85674599573635, 37.174925051829, -4.85258684662671, 37.1842384372115 
n = 1e3 
x = np.arange(np.floor(xmin * n) / n, np.ceil(xmax * n) / n, 1 / n)  # array([-4.857, -4.856, -4.855, -4.854, -4.853]) 
y = np.arange(np.floor(ymin * n) / n, np.ceil(ymax * n) / n, 1 / n)  # array([37.174, 37.175, 37.176, 37.177, 37.178, 37.179, 37.18 , 37.181, 37.182, 37.183, 37.184, 37.185]) 
points = MultiPoint(np.transpose([np.tile(x, len(y)), np.repeat(y, len(x))])) 
result = points.intersection(p)