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

Namespaces
namespace	igl

Functions
template<bool batched = false, typename Derivedorigin, typename Func, typename Derivedijk, typename Derivedijk_maybe>
void	igl::lipschitz_octree_prune (const Eigen::MatrixBase< Derivedorigin > &origin, const typename Derivedorigin::Scalar h0, const int depth, const Func &udf, const Eigen::MatrixBase< Derivedijk > &ijk, Eigen::PlainObjectBase< Derivedijk_maybe > &ijk_maybe)
	Given a 1-Lipschitz non-negative function to a level set (e.g., "unsigned distance function") and a set of query octree cells at a current depth given by the minimum corners subscripts in ijk (where root is (0,0,0)), determine which of these cells maybe still contains the level set based on checking a simple sufficient culling condition at the corners.

Namespaces

Functions