Method SearchPoint

Modules/Core/src/DataManagement/mitkPointSet.cpp:193–252

}

int mitk::PointSet::SearchPoint(Point3D point, ScalarType distance, int t) const
{
  if (t >= (int)m_PointSetSeries.size())
  {
    return -1;
  }

  // Out is the point which is checked to be the searched point
  PointType out;
  out.Fill(0);
  PointType indexPoint;

  this->GetGeometry(t)->WorldToIndex(point, indexPoint);

  // Searching the first point in the Set, that is +- distance far away from
  // the given point
  unsigned int i;
  PointsContainer::Iterator it, end;
  end = m_PointSetSeries[t]->GetPoints()->End();
  int bestIndex = -1;
  distance = distance * distance;

  // To correct errors from converting index to world and world to index
  if (distance == 0.0)
  {
    distance = 0.000001;
  }

  ScalarType bestDist = distance;
  ScalarType dist, tmp;

  for (it = m_PointSetSeries[t]->GetPoints()->Begin(), i = 0; it != end; ++it, ++i)
  {
    bool ok = m_PointSetSeries[t]->GetPoints()->GetElementIfIndexExists(it->Index(), &out);

    if (!ok)
    {
      return -1;
    }
    else if (indexPoint == out) // if totally equal
    {
      return it->Index();
    }

    // distance calculation
    tmp = out[0] - indexPoint[0];
    dist = tmp * tmp;
    tmp = out[1] - indexPoint[1];
    dist += tmp * tmp;
    tmp = out[2] - indexPoint[2];
    dist += tmp * tmp;

    if (dist < bestDist)
    {
      bestIndex = it->Index();
      bestDist = dist;
    }
  }