version 3.8
triangulation.hh File Reference

Functionality to triangulate point clouds. More...

#include <vector>
#include <array>
#include <algorithm>
#include <type_traits>
#include <tuple>
#include <dune/common/exceptions.hh>
#include <dune/common/fvector.hh>
#include <dumux/common/math.hh>
#include <dumux/geometry/intersectspointsimplex.hh>
#include <dumux/geometry/grahamconvexhull.hh>

Go to the source code of this file.

Description

Note
Most of the implemented algorithms currently do not scale for large point clouds and are only meant to be used with a small number of points

Classes

struct  Dumux::TriangulationPolicy::MidPointPolicy
 
struct  Dumux::TriangulationPolicy::ConvexHullPolicy
 
struct  Dumux::TriangulationPolicy::DelaunayPolicy
 Delaunay-type triangulations. More...
 

Namespaces

namespace  Dumux
 
namespace  Dumux::TriangulationPolicy
 

Typedefs

template<int dim, int dimWorld>
using Dumux::TriangulationPolicy::DefaultPolicy = std::tuple_element_t< dim-1, Detail::DefaultDimPolicies >
 Default policy for a given dimension. More...
 
template<int dim, int dimWorld, class ctype >
using Dumux::Triangulation = std::vector< std::array< Dune::FieldVector< ctype, dimWorld >, dim+1 > >
 The default data type to store triangulations. More...
 

Functions

template<int dim, int dimWorld, class Policy = TriangulationPolicy::DefaultPolicy<dim, dimWorld>, class RandomAccessContainer , std::enable_if_t< std::is_same_v< Policy, TriangulationPolicy::DelaunayPolicy > &&dim==1, int > = 0>
Triangulation< dim, dimWorld, typename RandomAccessContainer::value_type::value_type > Dumux::triangulate (const RandomAccessContainer &points)
 Triangulate area given points of a convex hull (1d) More...
 
Include dependency graph for triangulation.hh: