X-Git-Url: http://shamusworld.gotdns.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Fgeometry.cpp;h=e5a6af2cd991b5c5f74ee5e198073e18f43053fe;hb=e78daf62eb771ee29a59035d16cf63c1e6ebe144;hp=b9158974ec97d902d4ff2e936a2cc4b43e469082;hpb=0fcc2d879e1e0ca17eeaceae2159f5143a06586f;p=architektonas

diff --git a/src/geometry.cpp b/src/geometry.cpp
index b915897..e5a6af2 100644
--- a/src/geometry.cpp
+++ b/src/geometry.cpp
@@ -255,14 +255,12 @@ void Geometry::CheckLineToCircleIntersection(Object * l, Object * c)
 	// Radius is the hypotenuse, so we have to use c² = a² + b² => a² = c² - b²
 	double perpendicularLength = sqrt((c->radius[0] * c->radius[0]) - (distance * distance));
 
-	// Now, find the points using the length, then check to see if they are on
-	// the line segment
+	// Now, find the intersection points using the length...
 	Vector lineUnit = Vector(l->p[0], l->p[1]).Unit();
 	Point i1 = p + (lineUnit * perpendicularLength);
 	Point i2 = p - (lineUnit * perpendicularLength);
 
-	// Now we have our intersection points, next we need to see if they are on
-	// the line segment...
+	// Next we need to see if they are on the line segment...
 	double u = ParameterOfLineAndPoint(l->p[0], l->p[1], i1);
 	double v = ParameterOfLineAndPoint(l->p[0], l->p[1], i2);