2012-10-25 154 views
2

我一直在试图调试这个问题,但无法做到这一点。我正在尝试找到两个对象Polygon的交集。它大部分时间工作,但对于下列情况,它会产生以下例外情况:多边形交点错误| Python Shapely

P1 area: 13.125721955 
P2 area: 1.0 
Traceback (most recent call last): 
File "geom2d.py", line 235, in <module> 
print p1.intersection(p2) 
File "/usr/local/lib/python2.7/dist-packages/shapely/geometry/base.py", line 334, in  intersection 
return geom_factory(self.impl['intersection'](self, other)) 
    File "/usr/local/lib/python2.7/dist-packages/shapely/topology.py", line 47, in __call__ 
    "The operation '%s' produced a null geometry. Likely cause is invalidity of the geometry %s" % (self.fn.__name__, repr(this))) 
shapely.geos.TopologicalError: The operation 'GEOSIntersection_r' produced a null  geometry. Likely cause is invalidity of the geometry <shapely.geometry.polygon.Polygon  object at 0x8e5ad6c> 

代码如下。

from shapely.geometry import Point,Polygon,MultiPolygon 

poly1 = [(35.0041000000000011, -88.1954999999999956), (34.9917999999999978,   -85.6068000000000069), (32.8404000000000025, -85.1756000000000029), (32.2593000000000032, -84.8927000000000049), (32.1535000000000011, -85.0341999999999985), (31.7946999999999989, -85.1358000000000033), (31.5199999999999996, -85.0438000000000045), (31.3384000000000000, -85.0836000000000041), (31.2092999999999989, -85.1069999999999993), (31.0023000000000017, -84.9943999999999988), (30.9953000000000003, -87.6008999999999958), (30.9422999999999995, -87.5926000000000045), (30.8538999999999994, -87.6256000000000057), (30.6744999999999983, -87.4072000000000031), (30.4404000000000003, -87.3687999999999931), (30.1463000000000001, -87.5240000000000009), (30.1545999999999985, -88.3863999999999947), (31.8938999999999986, -88.4742999999999995), (34.8937999999999988, -88.1020999999999930), (34.9478999999999971, -88.1721000000000004), (34.9106999999999985, -88.1461000000000041)] 
poly2 = [(34.7998910000000024, -88.2202139999999986), (34.7998910000000024, -87.2202139999999986), (35.7998910000000024, -87.2202139999999986), (35.7998910000000024, -88.2202139999999986)] 

p1 = Polygon(poly1) 
p2 = Polygon(poly2) 
print 'P1 area:',p1.area 
print 'P2 area:',p2.area 
print p1.intersection(p2) 

由于它打印两个多边形的面积,我假设多边形形成正确。我也(不知何故)打印第一个多边形以确保它确实是一个简单的多边形。

任何人都可以请解释为什么我得到这个异常?

编辑:我打印p1.is_valid,结果是False。有一些解释here。搜索字符串is_valid。它说

有效的多边形可能不具有任何重叠的外部或内部环。

有人能解释一下这是什么意思,如果有可能的解决方法吗? 顺便说一句,我也注意到,如果我从poly1删除最后一个坐标,整个事情就起作用了。也许整个坐标列表使多边形复杂

回答

5

你会得到这个例外,因为p1不是有效的多边形。

>>> p1.is_valid 
False 
>>> p2.is_valid 
True 

documentation说:

有效的多边形可能不具有任何重叠的外部或内部 环。

请记住,由于多边形的第一个和最后一个点是不同的,所以会将第一个点追加到列表的末尾。

>>> list(p1.exterior.coords) 
[(35.004100000000001, -88.195499999999996), (34.991799999999998, -85.606800000000007), (32.840400000000002, -85.175600000000003), (32.259300000000003, -84.892700000000005), (32.153500000000001, -85.034199999999998), (31.794699999999999, -85.135800000000003), (31.52, -85.043800000000005), (31.3384, -85.083600000000004), (31.209299999999999, -85.106999999999999), (31.002300000000002, -84.994399999999999), (30.9953, -87.600899999999996), (30.942299999999999, -87.592600000000004), (30.853899999999999, -87.625600000000006), (30.674499999999998, -87.407200000000003), (30.4404, -87.368799999999993), (30.1463, -87.524000000000001), (30.154599999999999, -88.386399999999995), (31.893899999999999, -88.474299999999999), (34.893799999999999, -88.102099999999993), (34.947899999999997, -88.1721), (34.910699999999999, -88.146100000000004), (35.004100000000001, -88.195499999999996)] 

您的多边形的外观是一个线性环,这也似乎是无效的:

>>> p1.exterior.type 
'LinearRing' 
>>> p1.exterior.is_valid 
False 

你也可以看到,如果你把多边形的外观成线串它将是复杂的:

>>> l1 = LineString(p1.exterior.coords) 
>>> l1.is_simple 
False 

不知何故多边形的外部交叉或触及自身。

挖掘到更多的数据位,我们可以想像它在地图上:

>>> import cgpolyencode 
>>> encoder = cgpolyencode.GPolyEncoder() 
>>> encoder.encode((y, x) for x, y in p1.exterior.coords) 
{'points': '[email protected][email protected][email protected]@[email protected]|NfjI{[email protected]`[email protected][email protected]@[email protected]~h]{[email protected]~lgDsurIjdPk|hQgugAaqIntLlgFoaDwfQvsH', 'numLevels': 18, 'zoomFactor': 2, 'levels': 'PPLMKMKGKPNIKLMNPLLKJP'} 

如果你把它插入到Google's Polyline Encoder,你可以看到它是美国阿拉巴马州。如果你放大阿拉巴马州的左上角,你会发现两条线相互交叉。要解决这个问题,您需要删除最后一个点或将第二个点与第二个点交换到最后一个点。

+0

有没有办法处理_complex_多边形? – Nik

+1

理想情况下,您可以将所有多边形定义为正确的开头。既然这是对付美国的一个国家,而不是某种线索,我会认为修正这将是更好的路线。但是,如果这是不可能的,你总是可以使用'p1.convex_hull'而不是'p1'。 'convex_hull'永远是有效的,永不复杂。 –

9

如前所述,p1无效。在绘制它时,我注意到右下方有一个“领结”。我假设你不需要你的多边形;如果没有,你可以尝试身材匀称的buffer(0)绝招(匀称手册中记录)来解决这个问题:

In [382]: p1.is_valid 
Out[382]: False 

In [383]: p1 = p1.buffer(0) 

In [384]: p1.is_valid 
Out[384]: True 

buffer(0)具有以下作用:

前:

enter image description here

后:

enter image description here

你现在可以这样做:

print p1.intersection(p2) 
POLYGON ((34.9396324323625151 -88.1614025927056559, 34.8937999999999988 -88.1020999999999930, 34.7998910000000024 -88.1137513649788247, 34.7998910000000024 -87.2202139999999986, 34.9994660069532983 -87.2202139999999986, 35.0041000000000011 -88.1954999999999956, 34.9396324323625151 -88.1614025927056559)) 

请注意,我有一些情况下(与看上去更像是“鸟巢”不是简单的领结区),其中并没有工作;检查确保你找回一个单一的Polygon对象而不是MultiPolygon