这篇文章主要知识点是关于python、射线法、的内容,如果大家想对相关知识点有系统深入的学习,可以参阅以下电子书
本文实例为大家分享了python射线法判断点是否位于区域内的具体代码,供大家参考,具体内容如下
#!/usr/bin/env python # -*- coding: utf-8 -*- # @Date : 2018-10-07 15:49:37 # @Author : Sheldon (thisisscret@qq.com) # @Blog : 谢耳朵的派森笔记 # @Link : https://www.cnblogs.com/shld/ # @Version : 0.0.1 def isinpolygon(point,vertex_lst:list, contain_boundary=True): #检测点是否位于区域外接矩形内 lngaxis, lataxis = zip(*vertex_lst) minlng, maxlng = min(lngaxis),max(lngaxis) minlat, maxlat = min(lataxis),max(lataxis) lng, lat = point if contain_boundary: isin = (minlng<=lng<=maxlng) & (minlat<=lat<=maxlat) else: isin = (minlng<lng<maxlng) & (minlat<lat<maxlat) return isin def isintersect(poi,spoi,epoi): #输入:判断点,边起点,边终点,都是[lng,lat]格式数组 #射线为向东的纬线 #可能存在的bug,当区域横跨本初子午线或180度经线的时候可能有问题 lng, lat = poi slng, slat = spoi elng, elat = epoi if poi == spoi: #print("在顶点上") return None if slat==elat: #排除与射线平行、重合,线段首尾端点重合的情况 return False if slat>lat and elat>lat: #线段在射线上边 return False if slat<lat and elat<lat: #线段在射线下边 return False if slat==lat and elat>lat: #交点为下端点,对应spoint return False if elat==lat and slat>lat: #交点为下端点,对应epoint return False if slng<lng and elat<lat: #线段在射线左边 return False #求交点 xseg=elng-(elng-slng)*(elat-lat)/(elat-slat) if xseg == lng: #print("点在多边形的边上") return None if xseg<lng: #交点在射线起点的左侧 return False return True #排除上述情况之后 def isin_multipolygon(poi,vertex_lst, contain_boundary=True): # 判断是否在外包矩形内,如果不在,直接返回false if not isinpolygon(poi, vertex_lst, contain_boundary): return False sinsc = 0 for spoi, epoi in zip(vertex_lst[:-1],vertex_lst[1::]): intersect = isintersect(poi, spoi, epoi) if intersect is None: return (False, True)[contain_boundary] elif intersect: sinsc+=1 return sinsc%2==1 if __name__ == '__main__': vertex_lst = [[0,0],[1,1],[1,2],[0,2],[0,0]] poi = [0.82,0.75] print(isin_multipolygon(poi,vertex_lst, contain_boundary=True))
以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持码农之家。
以上就是本次给大家分享的关于java的全部知识点内容总结,大家还可以在下方相关文章里找到相关文章进一步学习,感谢大家的阅读和支持。
Copyright 2018-2020 www.xz577.com 码农之家
版权投诉 / 书籍推广 / 赞助:520161757@qq.com
python射线法判断一个点在图形区域内外
用python 实现的代码:判断一个点在图形区域内外,供大家参考,具体内容如下 # -*-encoding:utf-8 -*-# file:class.py# """信息楼0 123.425658,41.7741771 123.425843,41.7741662 123.425847,41.7741193 123.42693,41.7740624 123.426943,41.7740995 123.427118,41.7740896 123.427066,41.7735487 123.426896,41.7735448 123.426916,41.7739209 123.425838,41.77396510 123.425804,41.77358511 123.425611,41.773595图书馆0 123.425649,41.773031 123.426656,41.7729932 123.426611,41.7723983 123.425605,41.772445""" class Point: lat = '' lng = '' def __init__(self,lat,lng): self.lat = lat #纬度 self.lng = lng #经度 def show(self): print self.lat," ",self.lng #将信息楼的边界点实例化并存储到points1里point0 = Point(123.425658,41.774177)point1 = Point(123.425843,41.774166)point2 = Point(123.425847,41.774119)point3 = Point(123.42693,41.774062)point4 = Point(123.426943,41.774099)point5 = Point(123.427118,41.774089)point6 = Point(123.427066,41.773548)point7 = Point(123.4268……
python3射线法判断点是否在多边形内
本文实例为大家分享了python3射线法判断点是否在多边形内的具体代码,供大家参考,具体内容如下 #!/usr/bin/python3.4# -*- coding:utf-8 -*- def isPointinPolygon(point, rangelist): #[[0,0],[1,1],[0,1],[0,0]] [1,0.8] # 判断是否在外包矩形内,如果不在,直接返回false lnglist = [] latlist = [] for i in range(len(rangelist)-1): lnglist.append(rangelist[i][0]) latlist.append(rangelist[i][1]) print(lnglist, latlist) maxlng = max(lnglist) minlng = min(lnglist) maxlat = max(latlist) minlat = min(latlist) print(maxlng, minlng, maxlat, minlat) if (point[0] maxlng or point[0] minlng or point[1] maxlat or point[1] minlat): return False count = 0 point1 = rangelist[0] for i in range(1, len(rangelist)): point2 = rangelist[i] # 点与多边形顶点重合 if (point[0] == point1[0] and point[1] == point1[1]) or (point[0] == point2[0] and point[1] == point2[1]): print("在顶点上") return False # 判断线段两端点是否在射线两侧 不在肯定不……