Lines Matching refs:i1
459 for i1 in range(len(csp1)) :
460 for j1 in range(1,len(csp1[i1])) :
463 d = csp_seg_bound_to_csp_seg_bound_max_min_distance(csp1[i1][j1-1],csp1[i1][j1],csp2[i2][j2-1],csp2[i2][j2])
465 if d[1] < dist_bounds[0] : return [d[1],i1,j1,1,i2,j2,1]
466 d = csp_seg_to_csp_seg_distance(csp1[i1][j1-1],csp1[i1][j1],csp2[i2][j2-1],csp2[i2][j2], dist_bounds, tolerance=tolerance)
468 dist = [d[0], i1,j1,d[1], i2,j2,d[2]]
2808 for i1 in range(len(poly1)) :
2810 vertex = poly1[i1]
2816 st,end = poly1[i1-1], poly1[i1]
2863 for i1 in range(len(self.polygon)):
2864 poly1 = self.polygon[i1]
2879 if i1==i2 : continue
3058 i1 = random.randint(0,len(self.population)-1)
3059 t += [ [self.population[i1][0],i1] ]
3087 i1,i2 = 0, 0
3128 i1,i2 = random.randint(0,self.genes_count-1),random.randint(0,self.genes_count-1)
3129 specimen[i1][0], specimen[i2][0] = specimen[i2][0], specimen[i1][0]
3131 i1 = random.randint(0,self.genes_count-1)
3132 specimen[i1][1] = (specimen[i1][1]+random.random()*math.pi2*self.move_mutation_multiplier)%1.
3133 specimen[i1][2] = (specimen[i1][2]+random.random()*self.move_mutation_multiplier)%1.
3736 # print_((-f(w[k][i-1]),-f(w[k][i]), [i1[5] for i1 in l1]) )
5413 def line_divide((x0,y0),j0,i0,(x1,y1),j1,i1,(nx,ny),length):
5434 return [ [x2, y2, r2], line_divide((x2,y2),j2,i2,(x1,y1),j1,i1,(nx,ny),length/2)]
5435 if j2==j1 and i2==i1 : #Same as right end. Don't subdivide this part any more
5437 return [ line_divide((x0,y0),j0,i0,(x2,y2),j2,i2,(nx,ny),length/2), line_divide((x2,y2),j2,i2,(x1,y1),j1,i1,(nx,ny),length/2)]
5451 xy1a,xy1,xy1b,i1,j1,ii1,jj1=cspm[-1]
5453 if i==i1 and j==j1 and ii==ii1 and jj==jj1 : #one match
5454 xy1a,xy2,xy1b,i1,j1,ii1,jj1=cspm[-2]
5456 if i==i1 and j==j1 and ii==ii1 and jj==jj1 : #two matches. Now test linearity
6139 subpath = [ [ [i2[0],i2[1]+r] for i2 in i1] for i1 in subpath]
6198 current_pass = [ [ [i2[0],i2[1]+width] for i2 in i1] for i1 in fine_cut]