libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim > Class Template Reference

#include <meshfree_interpolation.h>

Public Types
typedef Real	coord_t

Public Member Functions
	PointListAdaptor (const std::vector< Point > &pts)
size_t	kdtree_get_point_count () const
coord_t	kdtree_distance (const coord_t *p1, const size_t idx_p2, size_t size) const
coord_t	kdtree_get_pt (const size_t idx, int dim) const
template<class BBOX >
bool	kdtree_get_bbox (BBOX &) const

Private Attributes
const std::vector< Point > &	_pts

Detailed Description

template<unsigned int KDDim>
template<unsigned int PLDim>
class libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >

This class adapts list of libMesh Point types for use in a nanoflann KD-Tree. For more on the basic idea see examples/pointcloud_adaptor_example.cpp in the nanoflann source tree.

Definition at line 192 of file meshfree_interpolation.h.

Member Typedef Documentation

coord_t

template<unsigned int KDDim>

template<unsigned int PLDim>

typedef Real libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::coord_t

libMesh Point coordinate type

Definition at line 205 of file meshfree_interpolation.h.

Constructor & Destructor Documentation

PointListAdaptor()

template<unsigned int KDDim>

template<unsigned int PLDim>

libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::PointListAdaptor ( const std::vector< Point > &  pts )

inline

Definition at line 198 of file meshfree_interpolation.h.

                                                    :
      _pts(pts)
    {}

Member Function Documentation

kdtree_distance()

template<unsigned int KDDim>

template<unsigned int PLDim>

coord_t libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::kdtree_distance ( const coord_t *  p1, const size_t  idx_p2, size_t  size  ) const

inline

Returns

The distance between the vector "p1[0:size-1]" and the data point with index "idx_p2" stored in the class

Definition at line 216 of file meshfree_interpolation.h.

    {
      libmesh_assert_equal_to (size, PLDim);
      libmesh_assert_less (idx_p2, _pts.size());

      const Point & p2(_pts[idx_p2]);

      switch (size)
        {
        case 3:
          {
            const coord_t d0=p1[0] - p2(0);
            const coord_t d1=p1[1] - p2(1);
            const coord_t d2=p1[2] - p2(2);

            return d0*d0 + d1*d1 + d2*d2;
          }

        case 2:
          {
            const coord_t d0=p1[0] - p2(0);
            const coord_t d1=p1[1] - p2(1);

            return d0*d0 + d1*d1;
          }

        case 1:
          {
            const coord_t d0=p1[0] - p2(0);

            return d0*d0;
          }

        default:
          libmesh_error_msg("ERROR: unknown size " << size);
        }

      return -1.;
    }

kdtree_get_bbox()

template<unsigned int KDDim>

template<unsigned int PLDim>

template<class BBOX >

bool libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::kdtree_get_bbox ( BBOX &  ) const

inline

Optional bounding-box computation.

Returns

true if the BBOX was already computed by the class and returned in bb so we can avoid redoing it, or false to default to a standard bbox computation loop.

Look at bb.size() to find out the expected dimensionality (e.g. 2 or 3 for point clouds)

Definition at line 285 of file meshfree_interpolation.h.

{ return false; }

kdtree_get_point_count()

template<unsigned int KDDim>

template<unsigned int PLDim>

size_t libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::kdtree_get_point_count ( ) const

inline

Must return the number of data points

Definition at line 210 of file meshfree_interpolation.h.

{ return _pts.size(); }

kdtree_get_pt()

template<unsigned int KDDim>

template<unsigned int PLDim>

coord_t libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::kdtree_get_pt ( const size_t  idx, int  dim  ) const

inline

Returns

The dim'th component of the idx'th point in the class: Since this is inlined and the "dim" argument is typically an immediate value, the "if's" are actually solved at compile time.

Definition at line 261 of file meshfree_interpolation.h.

    {
      libmesh_assert_less (dim, (int) PLDim);
      libmesh_assert_less (idx, _pts.size());
      libmesh_assert_less (dim, 3);

      const Point & p(_pts[idx]);

      if (dim==0) return p(0);
      if (dim==1) return p(1);
      return p(2);
    }

Member Data Documentation

_pts

template<unsigned int KDDim>

template<unsigned int PLDim>

const std::vector<Point>& libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< PLDim >::_pts

private

Definition at line 195 of file meshfree_interpolation.h.

Referenced by libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< KDDim >::kdtree_distance(), libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< KDDim >::kdtree_get_point_count(), and libMesh::InverseDistanceInterpolation< KDDim >::PointListAdaptor< KDDim >::kdtree_get_pt().

---

The documentation for this class was generated from the following file:

• meshfree_interpolation.h