#include <array>
#include <bitset>
#include <cstdint>
#include <initializer_list>
#include <map>
#include <set>
#include <Eigen/Dense>

Classes
class	edelsbrunner96::ExhaustiveSimplexDistance< Traits >
	Computes the distance of a point to a simplex by expanding all combinations of vertices and evaluating the distance to the lower-dimensional simplex feature represented by that combination of vertices. More...

struct	edelsbrunner96::SimplexBase< Traits >
	A simplex in the triangulation. A simplex is the convex hull of Ndim+1 points in R^NDim. More...

class	edelsbrunner96::SimplexFill< Traits >
	A convenience for setting vertices of a simplex. More...

Enumerations
enum	edelsbrunner96::simplex::MarkedBits { edelsbrunner96::simplex::ISC_OPENED, edelsbrunner96::simplex::ISC_MEMBER, edelsbrunner96::simplex::BFS_QUEUED, edelsbrunner96::simplex::RETIRED, edelsbrunner96::simplex::FEATURE_WALK, edelsbrunner96::simplex::LINE_WALK, edelsbrunner96::simplex::VISIBLE_HULL_WALK, edelsbrunner96::simplex::VISIBLE_HULL, edelsbrunner96::simplex::FUZZY_WALK, edelsbrunner96::simplex::REMOVED_FOR_INSERT, edelsbrunner96::simplex::NUM_BITS }
	enum defining bits for various markings of a simplex More...

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...

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...

Detailed Description

Definition in file simplex.h.

Classes