#include "igl_inline.h"
#include <Eigen/Core>
#include <vector>
#include "knn.cpp"
Go to the source code of this file.
|
template<typename DerivedP , typename IndexType , typename DerivedCH , typename DerivedCN , typename DerivedW , typename DerivedI > |
void | igl::knn (const Eigen::MatrixBase< DerivedP > &P, size_t k, const std::vector< std::vector< IndexType > > &point_indices, const Eigen::MatrixBase< DerivedCH > &CH, const Eigen::MatrixBase< DerivedCN > &CN, const Eigen::MatrixBase< DerivedW > &W, Eigen::PlainObjectBase< DerivedI > &I) |
| Given a 3D set of points P, an whole number k, and an octree find the indicies of the k nearest neighbors for each point in P.
|
|
template<typename DerivedP , typename DerivedV , typename IndexType , typename DerivedCH , typename DerivedCN , typename DerivedW , typename DerivedI > |
void | igl::knn (const Eigen::MatrixBase< DerivedP > &P, const Eigen::MatrixBase< DerivedV > &V, size_t k, const std::vector< std::vector< IndexType > > &point_indices, const Eigen::MatrixBase< DerivedCH > &CH, const Eigen::MatrixBase< DerivedCN > &CN, const Eigen::MatrixBase< DerivedW > &W, Eigen::PlainObjectBase< DerivedI > &I) |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|