No subject

    VectorType vectorPoint;
    for (int i=0; i<NDimensions; i++) {
      vectorPoint[i] = point[i];
    }

    NeighborsType neighbors;
    tree->Search(vectorPoint, m_radius, neighbors);





Where radius is computed like:

  unsigned int FVOrder = 3;
  double Order = (double)(FVOrder+1.0);
  double  m_radius =  (1.0*maxValue * Order)/2.0;


Now if I do:

    tree->Search(vectorPoint, 5.0, neighbors);

it works fine without any segmentation errors. But if I do:

    tree->Search(vectorPoint, m_radius, neighbors);

where m_radius is compted as above I get the segmentation error (after
a few thousand calls).

Could this be a bug or am I doing something wrong here?