|
cheshirekow
v0.1.0
|
#include <cassert>#include <iostream>#include <list>#include <set>#include <vector>#include <Eigen/Dense>#include <mpblocks/clarkson93/BitMember.h>#include <mpblocks/clarkson93/Indexed.h>#include <mpblocks/clarkson93/PQueue.h>#include <mpblocks/clarkson93/StaticStack.h>#include <mpblocks/clarkson93/HorizonRidge.h>#include <mpblocks/clarkson93/Simplex.h>#include <mpblocks/clarkson93/Simplex2.h>#include <mpblocks/clarkson93/Triangulation.h>#include <mpblocks/clarkson93/ExampleTraits.h>#include <mpblocks/clarkson93/ExampleTraits2.h>#include <mpblocks/clarkson93/dynamic/Simplex.h>#include <mpblocks/clarkson93/dynamic/Triangulation.h>Go to the source code of this file.
Classes | |
| struct | mpblocks::clarkson93::DefaultSimplex< Traits > |
| default simplex structure which contains no additional functionality More... | |
| struct | mpblocks::clarkson93::HorizonRidge< Traits > |
| A horizon ridge is a d-2 dimensional facet (i.e. a facet of a facet),. More... | |
| struct | mpblocks::clarkson93::SimplexBase< Traits > |
| encapsulates a vertex, simplex pair where the simplex is the neighbor across from the specified vertex More... | |
| struct | mpblocks::clarkson93::Triangulation< Traits > |
| misleadingly-named data structure, is actually a "simplexification", the dimension agnostic analog of a triangulation More... | |
| struct | mpblocks::clarkson93::WithoutSet |
Namespaces | |
| mpblocks | |
| mpblocks::clarkson93 | |
| Implementation of RIC convex-hull construction (but not maintainance) algorithm by Clarkson (Computational Geometry, '93) | |
Enumerations | |
| enum | mpblocks::clarkson93::Orientation { mpblocks::clarkson93::INSIDE, mpblocks::clarkson93::OUTSIDE } |
Variables | |
| const int | mpblocks::clarkson93::Dynamic = -1 |