cheshirekow
v0.1.0
|
#include <edelsbrunner96/simplex.h>
#include <algorithm>
#include <mpblocks/util/set_operations.hpp>
Go to the source code of this file.
Namespaces | |
edelsbrunner96 | |
Functions | |
template<class Traits , class Derived , class Iterator > | |
void | edelsbrunner96::BarycentricProjection (typename Traits::Storage &storage, const typename Traits::Point &x, Iterator begin, Iterator end, Eigen::MatrixBase< Derived > *L, typename Traits::Point *x_proj) |
Given a query point, x and a set of vertex points, V, return the point y in hull(V) which is closest to x_q . More... | |
void | edelsbrunner96::pass (std::initializer_list< int > &&) |
A trick to allow parameter pack expansion for filling. More... | |
template<class Traits , class OutputIterator > | |
Traits::Scalar | edelsbrunner96::SimplexDistance (typename Traits::Storage &storage, const typename Traits::Point &x, const typename Traits::SimplexRef s_ref, typename Traits::Point *x_proj, OutputIterator V_out) |
Given a set of <= NDim+1 vertices, compute the distance of the query point to the convex hull of the vertex set. More... | |
Definition in file simplex.hpp.