Lines Matching refs:lengths
72 We could work with bezier path as well, but bezier arc lengths are (re)computed for each point
78 lengths=[]
91 lengths.append(d)
93 new=[p[i][1] for i in range(0,len(p)-1) if lengths[i]>zero]
95 lengths=[l for l in lengths if l>zero]
96 return(new,lengths)
161 l=l % sum(self.lengths)
163 return 0,l/self.lengths[0]
165 while (i<len(self.lengths)) and (self.lengths[i]<=l):
166 l-=self.lengths[i]
168 t=l/self.lengths[min(i,len(self.lengths)-1)]
180 dx=(self.skelcomp[i][0]-self.skelcomp[i-1][0])/self.lengths[-1]
181 dy=(self.skelcomp[i][1]-self.skelcomp[i-1][1])/self.lengths[-1]
184 dx=(self.skelcomp[i+1][0]-self.skelcomp[i][0])/self.lengths[i]
185 dy=(self.skelcomp[i+1][1]-self.skelcomp[i][1])/self.lengths[i]
250 self.skelcomp,self.lengths=linearize(comp)
254 length=sum(self.lengths)