const Function<dim,double> *coefficient = 0);
/**
+ * Returns a std::map with all vertices of faces located in the boundary
*
- *
+ * @param[in] tria The Triangulation object.
*/
- template<int dim>
- std::map<unsigned int,Point<dim> >
- get_all_vertex_at_boundary (const Triangulation<dim> &tria);
+ template <int dim, int spacedim>
+ std::map<unsigned int,Point<spacedim> >
+ get_all_vertices_at_boundary (const Triangulation<dim, spacedim> &tria);
/**
* Scale the entire triangulation by the given factor. To preserve the
}
}
-
- template<int dim>
- std::map<unsigned int,Point<dim> >
- get_all_vertex_at_boundary (const Triangulation<dim> &tria)
+ template <int dim, int spacedim>
+ std::map<unsigned int,Point<spacedim> >
+ get_all_vertices_at_boundary (const Triangulation<dim, spacedim> &tria)
{
- std::map<unsigned int, Point<dim> > vertex_map;
- typename Triangulation<dim>::active_cell_iterator
+ std::map<unsigned int, Point<spacedim> > vertex_map;
+ typename Triangulation<dim,spacedim>::active_cell_iterator
cell = tria.begin_active(),
endc = tria.end();
for (; cell!=endc; ++cell)
- {
- for (unsigned int i=0;i<GeometryInfo<dim>::faces_per_cell; ++i)
{
- const auto face = cell->face(i);
- if (face->at_boundary())
- {
- for (unsigned j = 0; j < GeometryInfo<dim>::vertices_per_face; ++j)
+ for (unsigned int i=0; i<GeometryInfo<dim>::faces_per_cell; ++i)
{
- const auto vertex = face->vertex(j);
- const auto vertex_index = face->vertex_index(j);
- vertex_map[vertex_index] = vertex / vertex.norm();
+ const auto face = cell->face(i);
+ if (face->at_boundary())
+ {
+ for (unsigned j = 0; j < GeometryInfo<dim>::vertices_per_face; ++j)
+ {
+ const auto vertex = face->vertex(j);
+ const auto vertex_index = face->vertex_index(j);
+ vertex_map[vertex_index] = vertex;
+ }
+ }
}
- }
}
- }
return vertex_map;
}
double
maximal_cell_diameter (const Triangulation<deal_II_dimension, deal_II_space_dimension> &triangulation);
+ template
+ std::map<unsigned int,Point<deal_II_space_dimension> >
+ get_all_vertices_at_boundary (const Triangulation<deal_II_dimension,deal_II_space_dimension> &tria);
+
#if deal_II_dimension == deal_II_space_dimension
# if deal_II_dimension > 1
template
Triangulation<deal_II_dimension> &triangulation,
const Function<deal_II_dimension> *coefficient);
- template
- std::map<unsigned int,Point<deal_II_dimension> >
- get_all_vertex_at_boundary (const Triangulation<deal_II_dimension> &tria);
-
# endif
template