X-Git-Url: https://git.pterodactylus.net/?a=blobdiff_plain;f=synfig-studio%2Ftrunk%2Fsrc%2Fsynfigapp%2Fblineconvert.cpp;h=1f6e3a75789e208618bde2a5f095531bbc1e2244;hb=b9d70da87063fe9f6d22bd1100f78c287b3fa898;hp=0d8c39c8683a9c5a9548dbcc4a163ed89a7876f7;hpb=15927373be09b6ef5a53e816ba93862fdcdaf545;p=synfig.git diff --git a/synfig-studio/trunk/src/synfigapp/blineconvert.cpp b/synfig-studio/trunk/src/synfigapp/blineconvert.cpp index 0d8c39c..1f6e3a7 100644 --- a/synfig-studio/trunk/src/synfigapp/blineconvert.cpp +++ b/synfig-studio/trunk/src/synfigapp/blineconvert.cpp @@ -165,7 +165,7 @@ void DerivativeApprox(T &df, const T f[], const Real t[], int npoints, int index Lpj += mult; //add into the summation - //since the ks follow the exact patern we need for the divisor (use that too) + //since the ks follow the exact pattern we need for the divisor (use that too) div *= tj - t[k]; } } @@ -326,7 +326,7 @@ Real CurveError(const synfig::Point *pts, unsigned int n, std::vector &inds, const std::vector &f, const std::vector &df, std::vector &work) +int tessellate_curves(const std::vector &inds, const std::vector &f, const std::vector &df, std::vector &work) { if(inds.size() < 2) return 0; @@ -341,7 +341,7 @@ int tesselate_curves(const std::vector &inds, const std::vector j2 = j++; for(; j != end; j2 = j++) { - //if this curve has invalid error (in j) then retesselate its work points (requires reparametrization, etc.) + //if this curve has invalid error (in j) then retessellate its work points (requires reparametrization, etc.) if(j->error < 0) { //get the stepsize etc. for the number of points in here @@ -529,7 +529,7 @@ synfigapp::BLineConverter::operator () (std::list &out, cons brk.push_back(i); - //postprocess for breaks too close to eachother + //postprocess for breaks too close to each other Real d = 0; Point p = f[brk.front()]; @@ -629,7 +629,7 @@ synfigapp::BLineConverter::operator () (std::list &out, cons //preproceval += timer(); //numpre++; - work.resize(size*2-1); //guarantee that all points will be tesselated correctly (one point inbetween every 2 adjacent points) + work.resize(size*2-1); //guarantee that all points will be tessellated correctly (one point inbetween every 2 adjacent points) //if size of work is size*2-1, the step size should be 1/(size*2 - 2) //Real step = 1/(Real)(size*2 - 1); @@ -645,18 +645,18 @@ synfigapp::BLineConverter::operator () (std::list &out, cons //while there are still enough points between us, and the error is too high subdivide (and invalidate neighbors that share tangents) while(!done) { - //tesselate all curves with invalid error values + //tessellate all curves with invalid error values work[0] = f[i0]; //timer.reset(); - /*numtess += */tesselate_curves(curind,f,df,work); + /*numtess += */tessellate_curves(curind,f,df,work); //tesseval += timer(); //now get all error values //timer.reset(); for(i = 1; i < (int)curind.size(); ++i) { - if(curind[i].error < 0) //must have been retesselated, so now recalculate error value + if(curind[i].error < 0) //must have been retessellated, so now recalculate error value { //evaluate error from points (starting at current index) int size = curind[i].curind - curind[i-1].curind + 1; @@ -667,7 +667,7 @@ synfigapp::BLineConverter::operator () (std::list &out, cons { synfig::info("Holy crap %d-%d error %f",curind[i-1].curind,curind[i].curind,curind[i].error); curind[i].error = -1; - numtess += tesselate_curves(curind,f,df,work); + numtess += tessellate_curves(curind,f,df,work); curind[i].error = CurveError(&f[curind[i-1].curind], size, work,0,work.size());//(curind[i-1].curind - i0)*2,(curind[i].curind - i0)*2+1); }*/ @@ -807,7 +807,7 @@ synfigapp::BLineConverter::operator () (std::list &out, cons "\tDistance Calculation: %f\n" " Algorithm: (numtimes,totaltime)\n" "\tPreprocess step: (%d,%f)\n" - "\tTesselation step: (%d,%f)\n" + "\tTessellation step: (%d,%f)\n" "\tError step: (%d,%f)\n" "\tSplit step: (%d,%f)\n" " Num Input: %d, Num Output: %d\n"