volume_util_impl.hpp File Reference

#include <algorithm>
#include <vector>
#include "lib_grid/lg_base.h"
#include "common/static_assert.h"
#include "common/util/vec_for_each.h"
#include "lib_grid/grid_objects/hexahedron_rules.h"
#include "lib_grid/grid_objects/prism_rules.h"
#include "lib_grid/grid_objects/pyramid_rules.h"

Go to the source code of this file.

Classes
class	ug::CmpVrtsByHash< TElem >
	Can be used to compare vertices of their grids through their hash-value. More...

Namespaces
namespace	ug
	the ug namespace

Functions
template<class TAAPosVRT , class TAAWeightVRT >
UG_API TAAPosVRT::ValueType	ug::CalculateCenter (const VolumeVertices *vol, TAAPosVRT &aaPos, TAAWeightVRT &aaWeight)
	returns the weighted center of the vertices of the given volume
template<class TVertexPositionAttachmentAccessor >
TVertexPositionAttachmentAccessor::ValueType	ug::CalculateCenter (const VolumeVertices *vol, TVertexPositionAttachmentAccessor &aaPosVRT)
	calculates the center of a volume by averaging the positions of its corners
template<class TAAPos >
bool	ug::ContainsPoint (Volume *vol, const vector3 &p, TAAPos aaPos)
	Checks whether a given point lies in the given volume element.
template<class TVolIter >
void	ug::ConvertToTetrahedra (Grid &grid, TVolIter volsBegin, TVolIter volsEnd)
	Converts all volumes in the given range to tetrahedra.
UG_API bool	ug::PointIsInsideTetrahedron (const vector3 &v, Tetrahedron *tet, Grid::VertexAttachmentAccessor< APosition > &aaPos)
	returns true if the point lies inside the tetrahedron