$OpenBSD$

Index: src/aliceVision/linearProgramming/lInfinityCV/lInftyCV_resection_robust_test.cpp
--- src/aliceVision/linearProgramming/lInfinityCV/lInftyCV_resection_robust_test.cpp.orig
+++ src/aliceVision/linearProgramming/lInfinityCV/lInftyCV_resection_robust_test.cpp
@@ -41,7 +41,7 @@ BOOST_AUTO_TEST_CASE(Resection_L_Infinity_Robust_Outli
   {
     typedef  lInfinityCV::kernel::l1PoseResectionKernel KernelType;
     const Mat & pt2D = d2._x[nResectionCameraIndex];
-    const Mat & pt3D = d2._X;
+    const Mat & pt3D = d2._Xpoints;
     KernelType kernel(pt2D, pt3D);
     ScoreEvaluator<KernelType> scorer(2*Square(0.6));
     Mat34 P = MaxConsensus(kernel, scorer, nullptr, 128);
@@ -85,16 +85,16 @@ BOOST_AUTO_TEST_CASE(Resection_L_Infinity_Robust_OneOu
   const int nbOutlier = nbPoints*0.2;
   for (int i=0; i < nbOutlier; ++i)
   {
-    d2._X.col(i)(0) += 120.0;
-    d2._X.col(i)(1) += -60.0;
-    d2._X.col(i)(2) += 80.0;
+    d2._Xpoints.col(i)(0) += 120.0;
+    d2._Xpoints.col(i)(1) += -60.0;
+    d2._Xpoints.col(i)(2) += 80.0;
   }
 
   // Solve the problem and check that fitted value are good enough
   {
     typedef  lInfinityCV::kernel::l1PoseResectionKernel KernelType;
     const Mat & pt2D = d2._x[nResectionCameraIndex];
-    const Mat & pt3D = d2._X;
+    const Mat & pt3D = d2._Xpoints;
     KernelType kernel(pt2D, pt3D);
     ScoreEvaluator<KernelType> scorer(Square(0.1)); //Highly intolerant for the test
     Mat34 P = MaxConsensus(kernel, scorer, nullptr, 128);
