Public Member Functions

StraightBoundary< dim, spacedim > Class Template Reference
[Boundary description for triangulations]

Inheritance diagram for StraightBoundary< dim, spacedim >:
Inheritance graph
[legend]

List of all members.

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

Detailed Description

template<int dim, int spacedim = dim>
class StraightBoundary< dim, spacedim >

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.

Author:
Wolfgang Bangerth, 1998, 2001, Ralf Hartmann, 2001

Definition at line 423 of file tria_boundary.h.


Constructor & Destructor Documentation

template<int dim, int spacedim = dim>
StraightBoundary< dim, spacedim >::StraightBoundary (  )

Default constructor. Some compilers require this for some reasons.


Member Function Documentation

template<int dim, int spacedim = dim>
virtual Point<spacedim> StraightBoundary< dim, spacedim >::get_new_point_on_line ( const typename Triangulation< dim, spacedim >::line_iterator &  line ) const [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 >.

template<int dim, int spacedim = dim>
virtual Point<spacedim> StraightBoundary< dim, spacedim >::get_new_point_on_quad ( const typename Triangulation< dim, spacedim >::quad_iterator &  quad ) const [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 >.

template<int dim, int spacedim = dim>
virtual void StraightBoundary< dim, spacedim >::get_intermediate_points_on_line ( const typename Triangulation< dim, spacedim >::line_iterator &  line,
std::vector< Point< spacedim > > &  points 
) const [virtual]

Gives n=points.size() points that splits the StraightBoundary line into $n+1$ 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 >.

template<int dim, int spacedim = dim>
virtual void StraightBoundary< dim, spacedim >::get_intermediate_points_on_quad ( const typename Triangulation< dim, spacedim >::quad_iterator &  quad,
std::vector< Point< spacedim > > &  points 
) const [virtual]

Gives n=points.size()=m*m points that splits the StraightBoundary quad into $(m+1)(m+1)$ 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 >.

template<int dim, int spacedim = dim>
virtual Tensor<1,spacedim> StraightBoundary< dim, spacedim >::normal_vector ( const typename Triangulation< dim, spacedim >::face_iterator &  face,
const Point< spacedim > &  p 
) const [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 >.

template<int dim, int spacedim = dim>
virtual void StraightBoundary< dim, spacedim >::get_normals_at_vertices ( const typename Triangulation< dim, spacedim >::face_iterator &  face,
typename Boundary< dim, spacedim >::FaceVertexNormals face_vertex_normals 
) const [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 >.

template<int dim, int spacedim = dim>
virtual Point<spacedim> StraightBoundary< dim, spacedim >::project_to_surface ( const typename Triangulation< dim, spacedim >::line_iterator &  line,
const Point< spacedim > &  candidate 
) const [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 >.

template<int dim, int spacedim = dim>
virtual Point<spacedim> StraightBoundary< dim, spacedim >::project_to_surface ( const typename Triangulation< dim, spacedim >::quad_iterator &  quad,
const Point< spacedim > &  candidate 
) const [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 >.

template<int dim, int spacedim = dim>
virtual Point<spacedim> StraightBoundary< dim, spacedim >::project_to_surface ( const typename Triangulation< dim, spacedim >::hex_iterator &  hex,
const Point< spacedim > &  candidate 
) const [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 >.


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines

deal.II documentation generated on Fri Feb 3 2012 06:04:12 by doxygen 1.7.2