viennagrid/algorithm/detail/refine_tet.hpp File Reference

Provides refinement routines for tetrahedra. More...

#include "viennagrid/forwards.hpp"
#include "viennagrid/mesh/segmentation.hpp"
#include "viennagrid/topology/vertex.hpp"
#include "viennagrid/topology/line.hpp"
#include "viennagrid/topology/simplex.hpp"
#include "viennagrid/algorithm/norm.hpp"

Go to the source code of this file.

Data Structures
struct	element_refinement< tetrahedron_tag >
	Class specialization for the refinement of a tetrahedron: A LOT of spaghetti-code to follow. More...
Namespaces
namespace	viennagrid
	The main ViennaGrid namespace. Most user functionality resides directly in this namespace rather than in sub-namespaces.
namespace	viennagrid::detail
	Namespace for implementation details. Not intended to be used directly by a library user.
Functions
template<typename ElementsVerticesHandleContainerT , typename VertexHandleContainerT >
void	add_refinement_element (ElementsVerticesHandleContainerT &elements_vertices, VertexHandleContainerT vertex_handle_container, unsigned int i0, unsigned int i1, unsigned int i2, unsigned int i3)
template<typename MeshT , typename VertexHandleT >
bool	stable_line_is_longer (MeshT const &mesh, VertexHandleT vh1_1, VertexHandleT vh1_2, VertexHandleT vh2_1, VertexHandleT vh2_2)
	Compares the lines (v1_1, v1_2) and (v2_1, v2_2) and returns true if the first is longer.
template<typename MeshT , typename VertexHandleContainer >
bool	stable_line_is_longer (MeshT const &mesh, VertexHandleContainer vertices, unsigned int i0, unsigned int i1, unsigned int i2, unsigned int i3)

---

Detailed Description

Provides refinement routines for tetrahedra.