FEAT: dipole quadtree is like sphere quadtree

Author: aaronjridley

src/quadtree.cpp

@@ -514,19 +514,18 @@ int64_t Quadtree::find_point(arma_vec point) {
 
   if (IsSphere)
     wrap_point = wrap_point_sphere(point);
-
   if (IsCubeSphere)
     wrap_point = wrap_point_cubesphere(point);
+  if (IsDipole)
+    wrap_point = wrap_point_sphere(point);
 
   int64_t iNode = -1;
 
   for (int64_t iRoot = 0; iRoot < nRootNodes; iRoot++) {
     iNode = find_point(wrap_point, root_nodes[iRoot]);
-
     if (iNode > -1)
       break;
   }
-
   return iNode;
 }
 
@@ -542,9 +541,10 @@ int64_t Quadtree::find_root(arma_vec point) {
 
   if (IsSphere)
     wrap_point = wrap_point_sphere(point);
-
   if (IsCubeSphere)
     wrap_point = wrap_point_cubesphere(point);
+  if (IsDipole)
+    wrap_point = wrap_point_cubesphere(point);
 
   int64_t iNode = -1, iRoot;