path_to_edges.h File Reference

#include "igl_inline.h"
#include <Eigen/Core>
#include <vector>
#include "path_to_edges.cpp"

Go to the source code of this file.

Namespaces
namespace	igl

Functions
template<typename DerivedI , typename DerivedE >
void	igl::path_to_edges (const Eigen::MatrixBase< DerivedI > &I, Eigen::PlainObjectBase< DerivedE > &E, bool make_loop=false)
	Given a path as an ordered list of N>=2 vertex indices I[0], I[1], ..., I[N-1] construct a list of edges [[I[0],I[1]], [I[1],I[2]], ..., [I[N-2], I[N-1]]] connecting each sequential pair of vertices.
template<typename Index , typename DerivedE >
void	igl::path_to_edges (const std::vector< Index > &I, Eigen::PlainObjectBase< DerivedE > &E, bool make_loop=false)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.