preview

Import Usage Of Import Importation

Satisfactory Essays
Open Document

import re import sys from sys import stdin x = 0 stringList = [] nameMaster = [] streetDictionary = {} def intersection_check(seg1, seg2): xseg1d = seg1[0][0] - seg1[1][0] xseg2d = seg2[0][0] - seg2[1][0] xd = (xseg1d, xseg2d) yseg1d = seg1[0][1] - seg1[1][1] yseg2d = seg2[0][1] - seg2[1][1] yd = (yseg1d, yseg2d) def newdet(e, f): return (e[0] * f[1]) - (e[1] * f[0]) division = newdet(xd, yd) if division == 0: return "No Intersection" else: dcheck = (newdet(*seg1), newdet(*seg2)) xintersec = newdet(dcheck, xd) / division yintersec = newdet(dcheck, yd) / division if ((xintersec>seg1[0][0] and xintersec>seg1[1][0]) or (xintersec>seg2[0][0] and xintersec>seg2[1][0])) or ((xintersecseg1[0][1] and yintersec>seg1[1][1]) or (yintersec>seg2[0][1] and yintersec>seg2[1][1])): return "No Intersection" else: return round(xintersec, 2), round(yintersec, 2) def on_seg(p1, p2, c): vecprod = (c[1] - p1[1]) * (p2[0] - p1[0]) - (c[0] - p1[0]) * (p2[1] - p1[1]) if abs(vecprod) !=0 : return False # scalprod = (c[0] - p1[0]) * (p2[0] - p1[0]) + (c[1] - p1[1])*(p2[1] - p1[1]) if scalprod < 0 : return False length2 = (p2[0] - p1[0])*(p2[0] - p1[0]) + (p2[1] - p1[1])*(p2[1] - p1[1]) if scalprod > length2: return False return True def point_on_seg(coor1, coor2, vertex1, vertex2): if on_seg(vertex1, vertex2, coor1) and

Get Access
Related
Get Access