凹多边形检测

顺序给出多边形所有点坐标检测

思路:
取相邻点坐标得出角两边的方向向量,计算向量夹角,注意处理内角大于π的情形,依据是否有大于π的内角来判断是否为凹多边形

import math

point_list1 = [(1, 1), (-1, 3), (-3, 0), (-1, 0), (0, -1), (0, -3)]
point_list2 = [(1, 1), (-1, 3), (-3, 0), (-3, -3), (-1, -2), (0, -3)]
point_list3 = [(-3, 0), (-1, 0), (0, -1)]
point_list4 = [(1, 1), (-1, 1), (-1, 3), (-3, 0), (-1, 0), (0, -1), (0, -3)]
point_list5 = [(1, 1), (2, 2), (-1, 1), (-1, 3), (-3, 0), (-1, 0), (0, -1), (0, -3)]

def get_angle(vector1, vector2):
    radian1 = math.atan2(*vector1)
    angle1 = int(radian1 * 180/math.pi)
    radian2 = math.atan2(*vector2)
    angle2 = int(radian2 * 180/math.pi)

    if angle1 * angle2 >= 0:
        included_angle = abs(angle1 - angle2)
    else:
        included_angle = abs(angle1) + abs(angle2)
    _dot = vector1[0] * vector2[0] + vector1[1] * vector2[1]
    if _dot > 0 and included_angle > 180:
        included_angle = 360 - included_angle
    return included_angle


def check_concave(point_list):
    list_len = len(point_list)
    for i in range(list_len):
        _next = i + 1
        if _next == list_len:
            _next = 0
        point1 = point_list[i-1]
        point2 = point_list[i]
        point3 = point_list[_next]
        vector1 = (point1[0] - point2[0], point1[1] - point2[1])
        vector2 = (point3[0] - point2[0], point3[1] - point2[1])

        angle = get_angle(vector1, vector2)
        if angle > 180:
            return False
    return True


print check_concave(point_list1)
print check_concave(point_list2)
print check_concave(point_list3)
print check_concave(point_list4)
print check_concave(point_list5)
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值