您好
我试图将一个点数组(x, y)放入一个框数组[(x0, y0), (x1, y0), (x0, y1), (x1, y1)](元组是角点)
到目前为止,我有以下例行程序:def isInside(self, point, x0, x1, y0, y1):
pr1 = getProduct(point, (x0, y0), (x1, y0))
if pr1 >= 0:
pr2 = getProduct(point, (x1, y0), (x1, y1))
if pr2 >= 0:
pr3 = getProduct(point, (x1, y1), (x0, y1))
if pr3 >= 0:
pr4 = getProduct(point, (x0, y1), (x0, y0))
if pr4 >= 0:
return True
return False
def getProduct(origin, pointA, pointB):
product = (pointA[0] - origin[0])*(pointB[1] - origin[1]) - (pointB[0] - origin[0])*(pointA[1] - origin[1])
return product
有没有比逐点查找更好的方法?也许是一些不明显的裸体行为?在
谢谢你!在