![]() |
Reference documentation for deal.II version 8.1.0
|
#include <tria_boundary.h>
Public Member Functions | |
StraightBoundary () | |
virtual Point< spacedim > | get_new_point_on_line (const typename Triangulation< dim, spacedim >::line_iterator &line) const |
virtual Point< spacedim > | get_new_point_on_quad (const typename Triangulation< dim, spacedim >::quad_iterator &quad) const |
virtual void | get_intermediate_points_on_line (const typename Triangulation< dim, spacedim >::line_iterator &line, std::vector< Point< spacedim > > &points) const |
virtual void | get_intermediate_points_on_quad (const typename Triangulation< dim, spacedim >::quad_iterator &quad, std::vector< Point< spacedim > > &points) const |
virtual Tensor< 1, spacedim > | normal_vector (const typename Triangulation< dim, spacedim >::face_iterator &face, const Point< spacedim > &p) const |
virtual void | get_normals_at_vertices (const typename Triangulation< dim, spacedim >::face_iterator &face, typename Boundary< dim, spacedim >::FaceVertexNormals &face_vertex_normals) const |
virtual Point< spacedim > | project_to_surface (const typename Triangulation< dim, spacedim >::line_iterator &line, const Point< spacedim > &candidate) const |
virtual Point< spacedim > | project_to_surface (const typename Triangulation< dim, spacedim >::quad_iterator &quad, const Point< spacedim > &candidate) const |
virtual Point< spacedim > | project_to_surface (const typename Triangulation< dim, spacedim >::hex_iterator &hex, const Point< spacedim > &candidate) const |
![]() | |
virtual | ~Boundary () |
Point< spacedim > | get_new_point_on_face (const typename Triangulation< dim, spacedim >::face_iterator &face) const |
void | get_intermediate_points_on_face (const typename Triangulation< dim, spacedim >::face_iterator &face, std::vector< Point< spacedim > > &points) const |
virtual void | get_normals_at_vertices (const typename Triangulation< dim, spacedim >::face_iterator &face, FaceVertexNormals &face_vertex_normals) const |
![]() | |
Subscriptor () | |
Subscriptor (const Subscriptor &) | |
virtual | ~Subscriptor () |
Subscriptor & | operator= (const Subscriptor &) |
void | subscribe (const char *identifier=0) const |
void | unsubscribe (const char *identifier=0) const |
unsigned int | n_subscriptions () const |
void | list_subscribers () const |
DeclException3 (ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects.\n"<< "(Additional information: "<< arg3<< ")\n"<< "Note the entry in the Frequently Asked Questions of "<< "deal.II (linked to from http://www.dealii.org/) for "<< "more information on what this error means.") | |
DeclException2 (ExcNoSubscriber, char *, char *,<< "No subscriber with identifier \""<< arg2<< "\" did subscribe to this object of class "<< arg1) | |
template<class Archive > | |
void | serialize (Archive &ar, const unsigned int version) |
Additional Inherited Members | |
![]() | |
typedef Tensor< 1, spacedim > | FaceVertexNormals[GeometryInfo< dim >::vertices_per_face] |
![]() | |
const std::vector< Point< 1 > > & | get_line_support_points (const unsigned int n_intermediate_points) const |
Specialization of Boundary<dim,spacedim>, which places the new point right into the middle of the given points. The middle is defined as the arithmetic mean of the points.
This class does not really describe a boundary in the usual sense. By placing new points in the middle of old ones, it rather assumes that the boundary of the domain is given by the polygon/polyhedron defined by the boundary of the initial coarse triangulation.
StraightBoundary< dim, spacedim >::StraightBoundary | ( | ) |
Default constructor. Some compilers require this for some reasons.
|
virtual |
Let the new point be the arithmetic mean of the two vertices of the line.
Refer to the general documentation of this class and the documentation of the base class for more information.
Implements Boundary< dim, spacedim >.
Reimplemented in HyperBallBoundary< dim, spacedim >, and CylinderBoundary< dim, spacedim >.
|
virtual |
Let the new point be the arithmetic mean of the four vertices of this quad and the four midpoints of the lines, which are already created at the time of calling this function.
Refer to the general documentation of this class and the documentation of the base class for more information.
Reimplemented from Boundary< dim, spacedim >.
Reimplemented in HyperBallBoundary< dim, spacedim >, and CylinderBoundary< dim, spacedim >.
|
virtual |
Gives n=points.size()
points that splits the StraightBoundary line into partitions of equal lengths.
Refer to the general documentation of this class and the documentation of the base class.
Reimplemented from Boundary< dim, spacedim >.
Reimplemented in HyperBallBoundary< dim, spacedim >, and CylinderBoundary< dim, spacedim >.
|
virtual |
Gives n=points.size()=m*m
points that splits the StraightBoundary quad into subquads of equal size.
Refer to the general documentation of this class and the documentation of the base class.
Reimplemented from Boundary< dim, spacedim >.
Reimplemented in HyperBallBoundary< dim, spacedim >, and CylinderBoundary< dim, spacedim >.
|
virtual |
Implementation of the function declared in the base class.
Refer to the general documentation of this class and the documentation of the base class.
Reimplemented from Boundary< dim, spacedim >.
Reimplemented in HyperBallBoundary< dim, spacedim >.
|
virtual |
Compute the normals to the boundary at the vertices of the given face.
Refer to the general documentation of this class and the documentation of the base class.
Reimplemented in HyperBallBoundary< dim, spacedim >, and CylinderBoundary< dim, spacedim >.
|
virtual |
Given a candidate point and a line segment characterized by the iterator, return a point that lies on the surface described by this object. This function is used in some mesh smoothing algorithms that try to move around points in order to improve the mesh quality but need to ensure that points that were on the boundary remain on the boundary.
The point returned is the projection of the candidate point onto the line through the two vertices of the given line iterator.
If spacedim==1, then the line represented by the line iterator is the entire space (i.e. it is a cell, not a part of the boundary), and the returned point equals the given input point.
Reimplemented from Boundary< dim, spacedim >.
|
virtual |
Same function as above but for a point that is to be projected onto the area characterized by the given quad.
The point returned is the projection of the candidate point onto the bilinear surface spanned by the four vertices of the given quad iterator.
If spacedim<=2, then the surface represented by the quad iterator is the entire space (i.e. it is a cell, not a part of the boundary), and the returned point equals the given input point.
Reimplemented from Boundary< dim, spacedim >.
|
virtual |
Same function as above but for a point that is to be projected onto the area characterized by the given quad.
The point returned is the projection of the candidate point onto the trilinear manifold spanned by the eight vertices of the given hex iterator.
If spacedim<=3, then the manifold represented by the hex iterator is the entire space (i.e. it is a cell, not a part of the boundary), and the returned point equals the given input point.
Reimplemented from Boundary< dim, spacedim >.