X-Git-Url: https://git.ucc.asn.au/?p=ipdf%2Fcode.git;a=blobdiff_plain;f=src%2Fbezier.cpp;h=9b594a05f8fa24f9b821586b30f99b433a1104c4;hp=67b384c9716feda24ee4bf41d58f203120a6d33d;hb=fe80b0a479a44182b6e7e982fb6ff33b6e17303d;hpb=875df16552ba91c5eb4a7aaf3c48537b3d93b3fb

diff --git a/src/bezier.cpp b/src/bezier.cpp
index 67b384c..9b594a0 100644
--- a/src/bezier.cpp
+++ b/src/bezier.cpp
@@ -58,7 +58,7 @@ static void CubicSolveSegment(vector<Real> & roots, const Real & a, const Real &
 		//return;
 	
 	bool negative = (u < l); // lower point > 0, upper point < 0
-	Debug("%ft^3 + %ft^2 + %ft + %f is negative (%f < %f) %d", a,b,c,d,u,l, negative);
+	//Debug("%ft^3 + %ft^2 + %ft + %f is negative (%f < %f) %d", a,b,c,d,u,l, negative);
 	while (tu - tl > delta)
 	{
 		Real t(tu+tl);
@@ -89,7 +89,7 @@ vector<Real> SolveCubic(const Real & a, const Real & b, const Real & c, const Re
 	Real tu(max);
 	Real tl(min);
 	vector<Real> turns(SolveQuadratic(a*3, b*2, c));
-	Debug("%u turning points", turns.size());
+	//Debug("%u turning points", turns.size());
 	for (unsigned i = 1; i < turns.size(); ++i)
 	{
 		tu = turns[i];