A function to compute the convex hull of a point cloud.
#include <vector>#include <array>#include <algorithm>#include <iterator>#include <dune/common/exceptions.hh>#include <dune/common/fvector.hh>#include <dumux/common/math.hh>Go to the source code of this file.
| Namespaces | |
| namespace | Dumux | 
| Functions | |
| template<class ctype> | |
| int | Dumux::getOrientation (const Dune::FieldVector< ctype, 3 > &a, const Dune::FieldVector< ctype, 3 > &b, const Dune::FieldVector< ctype, 3 > &c, const Dune::FieldVector< ctype, 3 > &normal) | 
| Returns the orientation of a sequence a-->b-->c in one plane (defined by normal vector) | |
| template<int dim, class ctype, std::enable_if_t<(dim==2), int > = 0> | |
| std::vector< Dune::FieldVector< ctype, 3 > > | Dumux::grahamConvexHullImpl (std::vector< Dune::FieldVector< ctype, 3 > > &points) | 
| Compute the points making up the convex hull around the given set of unordered points. | |
| template<int dim, class ctype, std::enable_if_t<(dim==2), int > = 0> | |
| std::vector< Dune::FieldVector< ctype, 2 > > | Dumux::grahamConvexHullImpl (const std::vector< Dune::FieldVector< ctype, 2 > > &points) | 
| Compute the points making up the convex hull around the given set of unordered points. | |
| template<int dim, class ctype, int dimWorld> | |
| std::vector< Dune::FieldVector< ctype, dimWorld > > | Dumux::grahamConvexHull (std::vector< Dune::FieldVector< ctype, dimWorld > > &points) | 
| Compute the points making up the convex hull around the given set of unordered points. | |
| template<int dim, class ctype, int dimWorld> | |
| std::vector< Dune::FieldVector< ctype, dimWorld > > | Dumux::grahamConvexHull (const std::vector< Dune::FieldVector< ctype, dimWorld > > &points) | 
| Compute the points making up the convex hull around the given set of unordered points. | |