凸包python实现

# -*- coding: utf-8 -*-
import turtle
import random
import time
f=open('point.txt','w')
for i in range(100):
    x=random.randrange(-250,250,10)
    y=random.randrange(-200,200,10)
    f.write(str(x)+','+str(y)+'\n')
f.close()
point=[]

f=open('point.txt')
for i in f:
    try:
        temp=i.split(',')
        x=float(temp[0]); y=float(temp[1])
        point.append((x,y))
    except :
        print 'a err'
f.close()

point=list(set(point))#去除重复的点

n=0
for i in range(len(point)):
    if point[n][1]>point[i][1]:
        n=i

p0=point[n]
point.pop(n)
def compare(a,b):
    x=[a[0]-p0[0],a[1]-p0[1]]
    y=[b[0]-p0[0],b[1]-p0[1]]
    dx=(x[0]**2+x[1]**2)**0.5
    dy=(y[0]**2+y[1]**2)**0.5
    cosa=x[0]/dx
    cosb=y[0]/dy
    if cosa < cosb:
        return 1
    elif cosa > cosb:
        return -1
    e