10.点的凸包

最新推荐文章于 2023-07-18 23:07:12 发布

黑夜中坚持

最新推荐文章于 2023-07-18 23:07:12 发布

阅读量332

点赞数

分类专栏：针对lcy编程文章标签：算法

原文链接：https://blog.csdn.net/weixin_44851932/article/details/103152899

版权

针对lcy编程专栏收录该内容

42 篇文章 4 订阅

订阅专栏

点的凸包
Description
Convex Hull of a set of points, in 2D plane, is a convex polygon with minimum area such that each point lies either on the boundary of polygon or inside it. Now given a set of points the task is to find the convex hull of points.

Input
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N denoting the no of points. Then in the next line are N*2 space separated values denoting the points ie x and y.Constraints:1<=T<=100,1<=N<=100,1<=x,y<=1000

Output
For each test case in a new line print the points x and y of the convex hull separated by a space in sorted order (increasing by x) where every pair is separated from the other by a ‘,’. If no convex hull is possible print -1.

Sample Input 1
2
3
1 2 3 1 5 6
3
1 2 4 4 5 1

Sample Output 1
1 2, 3 1, 5 6
1 2, 4 4, 5 1

注:考到直接放弃型题目,记录一下,不看了

转载自https://blog.csdn.net/weixin_44851932/article/details/103152899
代码全程copy,设置公开只为方便自己看到,如有侵权,速删

# 凸包问题的分治解法
def convex_problem(first, final, lis, result):
    maxDistance = 0
    index = -1
    # 处理上凸包
    if first < final:
        for i in range(first, final):
            firstPoint = lis[first]
            finalPoint = lis[final]
            first_x = firstPoint[0]
            first_y = firstPoint[1]
            final_x = finalPoint[0]
            final_y = finalPoint[1]
            indexPoint = lis[i]
            index_x = indexPoint[0]
            index_y = indexPoint[1]
            distance = first_x * final_y + index_x * first_y + final_x * index_y - index_x * final_y - final_x * first_y - first_x * index_y
            if distance > maxDistance:
                maxDistance = distance
                index = i
            if distance == 0:
                result[i] = 1
        # 处理下凸包
    else:
        for i in range(final, first):
            firstPoint = lis[first]
            finalPoint = lis[final]
            first_x = firstPoint[0]
            first_y = firstPoint[1]
            final_x = finalPoint[0]
            final_y = finalPoint[1]
            indexPoint = lis[i]
            index_x = indexPoint[0]
            index_y = indexPoint[1]
            distance = first_x * final_y + index_x * first_y + final_x * index_y - index_x * final_y - final_x * first_y - first_x * index_y
            if distance > maxDistance:
                maxDistance = distance
                index = i
            if distance == 0:
                result[i] = 1
    if index != -1:
        result[index] = 1
        convex_problem(first, index, lis, result)
        convex_problem(index, final, lis, result)


def isOnLine(first, final, index, lis):
    re = False
    firstPoint = lis[first]
    finalPoint = lis[final]
    indexPoint = lis[index]
    a = finalPoint[1] - firstPoint[1]
    b = firstPoint[0] - finalPoint[0]
    c = finalPoint[0] * firstPoint[1] - firstPoint[0] * finalPoint[1]
    judge = a * indexPoint[0] + b * indexPoint[1] + c
    if judge == 0:
        re = True
    return re


nums = int(input())
for T in range(nums):
    N = int(input())
    arr = list(map(int, input().split()))
    lis = []
    result = [0 for x in range(N)]  # 标记凸包点
    resultList = []
    k = 0
    for i in range(N):
        lis.append([arr[k], arr[k + 1]])
        k += 2
    lis.sort()   # 按横坐标排序
    isAllOnLine = True
    for i in range(N):
        if isOnLine(0, N-1, i, lis) is False:
            isAllOnLine = False
            break
    if isAllOnLine is True:
        for i in range(N):
            if i == 0 or i == N-1:
                resultList.append(lis[i])
            else:
                resultList.append(lis[i])
                resultList.append(lis[i])
    else:
        if N <= 3:  # 如果点的数量小于等于3，则3个点均为凸包点
            for i in range(N):
                result[i] = 1
        else:
            result[0] = 1  # x最大和最小的点肯定为凸包点
            result[N - 1] = 1
            convex_problem(0, N - 1, lis, result)   # 求上凸包
            convex_problem(N - 1, 0, lis, result)   # 求下凸包
        for i in range(len(result)):
            if result[i] == 1:
                resultList.append(lis[i])
    for i in range(len(resultList) - 1):
        conpoint = resultList[i]
        print(conpoint[0], end=' ')
        print(conpoint[1], end=', ')
    conpoint = resultList[-1]
    print(conpoint[0], end=' ')
    print(conpoint[1])