def calc_isect_lsi(): return list(intersection(S).keys())
print '' es = True if seg1 is not seg2 and (seg2, seg1) not in seen: i = intersect(seg1, seg2) if i: intersections.append((i, [seg1, seg2])) # xpts = [seg1[0][0], seg1[1][0], seg2[0][0], seg2[1][0]] # xpts = sorted(xpts) # if (i[0] <= xpts[2] and i[0] >= xpts[1]: # intersections.append((i, [seg1, seg2])) seen.append((seg1, seg2)) later = time.time() n2time = later-now print "Line sweep results:" now = time.time() lsinters = intersection(S) inters = [] for k, v in lsinters.iteritems(): #print '{0}: {1}'.format(k, v) inters.append(k) # inters.append(v) later = time.time() print 'TIME ELAPSED: {0}'.format(later-now) print "N^2 comparison results:" pts_seen = [] highestseen = 0 for i in intersections: seen_already = False seen = 0 for p in pts_seen: if approx_equal(i[0][0], p[0], ev) and approx_equal(i[0][1], p[1], ev):
print '' es = True if seg1 is not seg2 and (seg2, seg1) not in seen: i = intersect(seg1, seg2) if i: intersections.append((i, [seg1, seg2])) # xpts = [seg1[0][0], seg1[1][0], seg2[0][0], seg2[1][0]] # xpts = sorted(xpts) # if (i[0] <= xpts[2] and i[0] >= xpts[1]: # intersections.append((i, [seg1, seg2])) seen.append((seg1, seg2)) later = time.time() n2time = later - now print "Line sweep results:" now = time.time() lsinters = intersection(S) inters = [] for k, v in lsinters.iteritems(): #print '{0}: {1}'.format(k, v) inters.append(k) # inters.append(v) later = time.time() print 'TIME ELAPSED: {0}'.format(later - now) print "N^2 comparison results:" pts_seen = [] highestseen = 0 for i in intersections: seen_already = False seen = 0 for p in pts_seen: if approx_equal(i[0][0], p[0], ev) and approx_equal(i[0][1], p[1], ev):