Lines Matching refs:lengths
86 We could work with bezier path as well, but bezier arc lengths are (re)computed for each point
92 lengths=[]
105 lengths.append(d)
107 new=[p[i][1] for i in range(0,len(p)-1) if lengths[i]>zero]
109 lengths=[l for l in lengths if l>zero]
110 return(new,lengths)
194 l=l % sum(self.lengths)
196 return 0,l/self.lengths[0]
198 while (i<len(self.lengths)) and (self.lengths[i]<=l):
199 l-=self.lengths[i]
201 t=l/self.lengths[min(i,len(self.lengths)-1)]
212 dx=(self.skelcomp[i][0]-self.skelcomp[i-1][0])/self.lengths[-1]
213 dy=(self.skelcomp[i][1]-self.skelcomp[i-1][1])/self.lengths[-1]
216 dx=(self.skelcomp[i+1][0]-self.skelcomp[i][0])/self.lengths[i]
217 dy=(self.skelcomp[i+1][1]-self.skelcomp[i][1])/self.lengths[i]
259 self.skelcomp,self.lengths=linearize(comp)
263 length=sum(self.lengths)