orthanc-stone: Framework/Toolbox/GeometryToolbox.cpp comparison

IntersectPlaneAndLine

author	Sebastien Jodogne <s.jodogne@gmail.com>
date	Fri, 09 Feb 2018 16:00:29 +0100
parents	441cfe8e7440
children	a053ca7fa5c6

comparison

equal deleted inserted replaced

-:441cfe8e7440
+:2309e8d86efe
 {
 void Print(const Vector& v)
 {
 for (size_t i = 0; i < v.size(); i++)
 {
-printf("%8.2f\n", v[i]);
+printf("%g\n", v[i]);
+//printf("%8.2f\n", v[i]);
 }
 printf("\n");
 }
 {
 for (size_t i = 0; i < m.size1(); i++)
 {
 for (size_t j = 0; j < m.size2(); j++)
 {
-printf("%8.2f  ", m(i,j));
+printf("%g  ", m(i,j));
+//printf("%8.2f  ", m(i,j));
 }
 printf("\n");
 }
+printf("\n");
 }
 bool ParseVector(Vector& target,
 const std::string& value)
 }
 }
 }
+bool IntersectPlaneAndLine(Vector& p,
+const Vector& normal,
+double d,
+const Vector& origin,
+const Vector& direction)
+{
+// http://geomalgorithms.com/a05-_intersect-1.html#Line-Plane-Intersection
+// Check for parallel line and plane
+double denominator = boost::numeric::ublas::inner_prod(direction, normal);
+if (fabs(denominator) < 100.0 * std::numeric_limits<double>::epsilon())
+{
+return false;
+}
+else
+{
+// Compute intersection
+double t = -(normal[0] * origin[0] +
+normal[1] * origin[1] +
+normal[2] * origin[2] + d) / denominator;
+p = origin + t * direction;
+return true;
+}
+}
 void FillMatrix(Matrix& target,
 size_t rows,
 size_t columns,
 const double values[])
 {

Mercurial > hg > orthanc-stone