/**
* Actually delete a cell, or rather all
- * it children, which is the
- * main step for the coarsening process.
- * This is the dimension dependent part
- * of @p execute_coarsening.
+ * its children, which is the main step for
+ * the coarsening process. This is the
+ * dimension dependent part of @p
+ * execute_coarsening. The second argument
+ * is a vector which gives for each line
+ * index the number of cells containing
+ * this line. This information is needed to
+ * decide whether a refined line may be
+ * coarsened or not in 3D. In 1D and 2D
+ * this argument is not needed and thus
+ * ignored.
*/
- void delete_children (cell_iterator &cell);
+ void delete_children (cell_iterator &cell,
+ std::vector<unsigned int> &cell_count);
+
+ /**
+ * Fill the vector @p cell_count needed by
+ * @p delete_children with the number of
+ * cells containing a given line. As this
+ * is only needed in 3D, it is only
+ * implemented there and throws an
+ * exception otherwise.
+ */
+ void count_cells_at_line (std::vector<unsigned int> &cell_count);
/**
* Some dimension dependent stuff for
template <> void Triangulation<2>::execute_refinement ();
template <> void Triangulation<3>::execute_refinement ();
template <> void Triangulation<3>::prepare_refinement_dim_dependent ();
-template <> void Triangulation<1>::delete_children (cell_iterator &cell);
-template <> void Triangulation<2>::delete_children (cell_iterator &cell);
-template <> void Triangulation<3>::delete_children (cell_iterator &cell);
+template <> void Triangulation<1>::delete_children (cell_iterator &cell, std::vector<unsigned int> &);
+template <> void Triangulation<2>::delete_children (cell_iterator &cell, std::vector<unsigned int> &);
+template <> void Triangulation<3>::delete_children (cell_iterator &cell, std::vector<unsigned int> &cell_count);
+template <> void Triangulation<3>::count_cells_at_line (std::vector<unsigned int> &cell_count);
template <> void Triangulation<1>::update_number_cache_quads ();
template <> void Triangulation<1>::update_number_cache_hexes ();
template <> void Triangulation<2>::update_number_cache_hexes ();
#endif
+
template <int dim>
void Triangulation<dim>::execute_coarsening ()
{
+ // create a vector counting for each line how
+ // many cells contain this line. in 3D, this
+ // is used later on to decide which lines can
+ // be deleted after coarsening a cell. in
+ // other dimensions it will be ignored
+ std::vector<unsigned int> cell_count(0);
+ if (dim==3)
+ count_cells_at_line(cell_count);
+
// loop over all cells. Flag all
// cells of which all children are
// flagged for
// use a separate function,
// since this is dimension
// specific
- delete_children (cell);
+ delete_children (cell, cell_count);
// re-compute number of lines and
// quads
}
+
+#if deal_II_dimension == 3
+
+template <>
+void Triangulation<3>::count_cells_at_line (std::vector<unsigned int> &cell_count)
+{
+ cell_count.clear();
+ cell_count.resize(n_raw_lines(),0);
+ cell_iterator cell=begin(),
+ endc=end();
+ for (; cell!=endc; ++cell)
+ for (unsigned int l=0; l<GeometryInfo<3>::lines_per_cell; ++l)
+ ++cell_count[cell->line_index(l)];
+}
+
+#else
+
+template <int dim>
+void Triangulation<dim>::count_cells_at_line (std::vector<unsigned int> &cell_count)
+{
+ Assert(false, ExcNotImplemented());
+ cell_count.clear();
+}
+
+#endif
+
+
+
#if deal_II_dimension == 1
template <>
-void Triangulation<1>::delete_children (cell_iterator &cell)
+void Triangulation<1>::delete_children (cell_iterator &cell,
+ std::vector<unsigned int> &)
{
const unsigned int dim=1;
// first we need to reset the
#if deal_II_dimension == 2
template <>
-void Triangulation<2>::delete_children (cell_iterator &cell)
+void Triangulation<2>::delete_children (cell_iterator &cell,
+ std::vector<unsigned int> &)
{
const unsigned int dim=2;
// first we need to reset the
template <>
-void Triangulation<3>::delete_children (cell_iterator &cell)
+void Triangulation<3>::delete_children (cell_iterator &cell,
+ std::vector<unsigned int> &cell_count)
{
const unsigned int dim=3;
+ Assert(cell_count.size()==n_raw_lines(), ExcInternalError());
+
// first we need to reset the
// neighbor pointers of the
// neighbors of this cell's
cell->clear_children ();
cell->clear_user_flag();
- // now there still are the 12 lines
- // of this hex which are refined
- // and which may need
- // coarsening. however, it is not
- // so easy to decide whether they
- // are still needed, since it does
- // not suffice to ask the
- // neighbors. we also need to ask
- // those cells, which are "around
- // the corner".
- //
- // to do so: first set up a list of
- // 12 pairs of line_iterators and
- // flags which denote whether the
- // line's children are still needed
- //
- // we default to: "is not needed"
- // because in this case, if we make
- // an error in the code below, some
- // lines will be deleted that in
- // fact are needed. this will
- // eventually be caught somewhen,
- // because there are many checks
- // whether an iterator points to
- // something used. the opposite
- // case, that we do not delete
- // lines that are no more used, is
- // more severe and causes a memory
- // leak which is probably
- // impossible to find.
- const std::pair<line_iterator,bool> line_is_needed_pairs[12]
- = { std::make_pair(cell->line(0), false),
- std::make_pair(cell->line(1), false),
- std::make_pair(cell->line(2), false),
- std::make_pair(cell->line(3), false),
- std::make_pair(cell->line(4), false),
- std::make_pair(cell->line(5), false),
- std::make_pair(cell->line(6), false),
- std::make_pair(cell->line(7), false),
- std::make_pair(cell->line(8), false),
- std::make_pair(cell->line(9), false),
- std::make_pair(cell->line(10), false),
- std::make_pair(cell->line(11), false) };
-
+ // now there still are the 12 lines of this
+ // hex which are refined and which may need
+ // coarsening. As we got the number of cells
+ // containing this line, we can simply use
+ // that information here.
+
// if in debug mode: make sure that
// none of the lines of this cell
// is twice refined; else, deleting
// children in fact has children
// (the bits/coarsening_3d test
// tripped over this initially)
- for (unsigned int line=0; line<12; ++line)
+ for (unsigned int line_no=0; line_no<12; ++line_no)
{
- Assert (cell->line(line)->has_children(),
+ line_iterator line=cell->line(line_no);
+
+ Assert (line->has_children(),
ExcInternalError());
for (unsigned int c=0; c<2; ++c)
- Assert (!cell->line(line)->child(c)->has_children(),
- ExcInternalError());
- }
-
-
- // next make a map out of this for
- // simpler access to the flag
- // associated with a line
- std::map<line_iterator,bool> line_is_needed (&line_is_needed_pairs[0],
- &line_is_needed_pairs[12]);
-
- // then ask each neighbor and their
- // neighbors
- for (unsigned int nb=0; nb<GeometryInfo<dim>::faces_per_cell; ++nb)
- {
- const cell_iterator neighbor = cell->neighbor(nb);
- // do nothing if at boundary
- if (neighbor.state() != IteratorState::valid)
- continue;
-
- Assert (neighbor->level() == cell->level(),
- ExcInternalError());
-
- // if the neighbor itself has
- // children, then the four
- // lines of the common face are
- // definitely needed
- if (neighbor->has_children())
{
- for (unsigned int i=0; i<4; ++i)
- {
- Assert (line_is_needed.find(cell->face(nb)->line(i))
- != line_is_needed.end(),
- ExcInternalError());
-
- line_is_needed[cell->face(nb)->line(i)] = true;
- }
- // ok for this neighbor
- continue;
+ Assert (!line->child(c)->has_children(),
+ ExcInternalError());
+ // decrease the number of cells
+ // referencing this line by one, as
+ // one of those was one of our former
+ // children
+ --cell_count[line->child_index(c)];
}
-
- // if the neighbor is not
- // refined, then it may still
- // be that one of his neighbors
- // may need one of our
- // lines. the present cell is
- // also one of his neighbors,
- // but this one is not any more
- // refined
- for (unsigned int nb_nb=0; nb_nb<GeometryInfo<dim>::faces_per_cell;
- ++nb_nb)
+ // the cell counters for both
+ // line_children have to be the same
+ Assert(cell_count[line->child_index(0)] ==
+ cell_count[line->child_index(1)],
+ ExcInternalError());
+
+ if (cell_count[line->child_index(0)]==0)
{
- const cell_iterator neighbor_neighbor = neighbor->neighbor(nb_nb);
- // do nothing if at
- // boundary
- if (neighbor_neighbor.state() != IteratorState::valid)
- continue;
-
- Assert ((neighbor_neighbor->level() == cell->level()) ||
- (neighbor_neighbor->level() == cell->level()-1),
- ExcInternalError());
-
- // also do nothing if the
- // neighbor is at a lower
- // level (but then it
- // should not be refined)
- if (neighbor_neighbor->level() == cell->level()-1)
+ // we may delete the line's children
+ // and the middle vertex as no cell
+ // references them anymore
+ vertices_used[line->child(0)->vertex_index(1)] = false;
+
+ for (unsigned int child=0; child<2; ++child)
{
- Assert (!neighbor_neighbor->has_children(),
- ExcInternalError());
- continue;
+ line->child(child)->clear_user_pointer();
+ line->child(child)->clear_user_flag();
+ line->child(child)->clear_used_flag();
}
-
- // neighbor's neighbor is
- // on same level. if it has
- // children, then look
- // closer
- if (neighbor_neighbor->has_children())
- // if any of those cell's
- // lines is one of those
- // that we are interested
- // in, then flag it
- for (unsigned int l=0; l<GeometryInfo<dim>::lines_per_cell; ++l)
- {
- line_iterator line = neighbor_neighbor->line(l);
-
- if (line_is_needed.find(line) != line_is_needed.end())
- line_is_needed[line] = true;
- }
+
+ line->clear_children();
}
}
-
-
- // now, if the lines are not marked
- // as needed, we may delete their
- // children and the midpoint
- std::map<line_iterator,bool>::iterator line_and_flag;
- for (line_and_flag=line_is_needed.begin();
- line_and_flag!=line_is_needed.end(); ++line_and_flag)
- if (line_and_flag->second == false)
- {
- line_iterator line = line_and_flag->first;
-
- vertices_used[line->child(0)->vertex_index(1)] = false;
-
- for (unsigned int child=0; child<2; ++child)
- {
- line->child(child)->clear_user_pointer();
- line->child(child)->clear_user_flag();
- line->child(child)->clear_used_flag();
- }
-
- line->clear_children();
- }
}
#endif
+
+# This file was generated by the deal.II library.
+
+
+#
+# For a description of the UCD format see the AVS Developer's guide.
+#
+63 20 0 0 0
+1 0.00000 0.00000 0.00000
+2 1.00000 0.00000 0.00000
+3 0.866025 0.500000 0.00000
+4 0.500000 0.866025 0.00000
+5 6.12323e-17 1.00000 0.00000
+6 -0.500000 0.866025 0.00000
+7 -0.866025 0.500000 0.00000
+8 -1.00000 1.22465e-16 0.00000
+9 -0.866025 -0.500000 0.00000
+10 -0.500000 -0.866025 0.00000
+11 -1.83697e-16 -1.00000 0.00000
+12 0.500000 -0.866025 0.00000
+13 0.866025 -0.500000 0.00000
+14 0.00000 0.00000 -1.00000
+15 1.00000 0.00000 -1.00000
+16 0.866025 0.500000 -1.00000
+17 0.500000 0.866025 -1.00000
+18 6.12323e-17 1.00000 -1.00000
+19 -0.500000 0.866025 -1.00000
+20 -0.866025 0.500000 -1.00000
+21 -1.00000 1.22465e-16 -1.00000
+22 -0.866025 -0.500000 -1.00000
+23 -0.500000 -0.866025 -1.00000
+24 -1.83697e-16 -1.00000 -1.00000
+25 0.500000 -0.866025 -1.00000
+26 0.866025 -0.500000 -1.00000
+27 0.500000 0.00000 0.00000
+28 0.250000 0.433013 0.00000
+29 -0.500000 6.12323e-17 0.00000
+30 -0.250000 -0.433013 0.00000
+31 0.00000 0.00000 -0.500000
+32 0.933013 0.250000 0.00000
+33 1.00000 0.00000 -0.500000
+34 0.866025 0.500000 -0.500000
+35 0.683013 0.683013 0.00000
+36 0.500000 0.866025 -0.500000
+37 -0.933013 -0.250000 0.00000
+38 -1.00000 1.22465e-16 -0.500000
+39 -0.866025 -0.500000 -0.500000
+40 -0.683013 -0.683013 0.00000
+41 -0.500000 -0.866025 -0.500000
+42 0.500000 0.00000 -1.00000
+43 0.250000 0.433013 -1.00000
+44 -0.500000 6.12323e-17 -1.00000
+45 -0.250000 -0.433013 -1.00000
+46 0.933013 0.250000 -1.00000
+47 0.683013 0.683013 -1.00000
+48 -0.933013 -0.250000 -1.00000
+49 -0.683013 -0.683013 -1.00000
+50 0.591506 0.341506 0.00000
+51 0.250000 0.433013 -0.500000
+52 -0.591506 -0.341506 0.00000
+53 -0.500000 6.12323e-17 -0.500000
+54 -0.250000 -0.433013 -0.500000
+55 0.500000 0.00000 -0.500000
+56 0.933013 0.250000 -0.500000
+57 0.683013 0.683013 -0.500000
+58 -0.933013 -0.250000 -0.500000
+59 -0.683013 -0.683013 -0.500000
+60 0.591506 0.341506 -1.00000
+61 -0.591506 -0.341506 -1.00000
+62 0.591506 0.341506 -0.500000
+63 -0.591506 -0.341506 -0.500000
+1 0 hex 1 4 5 6 14 17 18 19
+2 0 hex 1 6 7 8 14 19 20 21
+3 0 hex 1 10 11 12 14 23 24 25
+4 0 hex 1 12 13 2 14 25 26 15
+5 0 hex 1 27 50 28 31 55 62 51
+6 0 hex 27 2 32 50 55 33 56 62
+7 0 hex 31 55 62 51 14 42 60 43
+8 0 hex 55 33 56 62 42 15 46 60
+9 0 hex 28 50 35 4 51 62 57 36
+10 0 hex 50 32 3 35 62 56 34 57
+11 0 hex 51 62 57 36 43 60 47 17
+12 0 hex 62 56 34 57 60 46 16 47
+13 0 hex 1 29 52 30 31 53 63 54
+14 0 hex 29 8 37 52 53 38 58 63
+15 0 hex 31 53 63 54 14 44 61 45
+16 0 hex 53 38 58 63 44 21 48 61
+17 0 hex 30 52 40 10 54 63 59 41
+18 0 hex 52 37 9 40 63 58 39 59
+19 0 hex 54 63 59 41 45 61 49 23
+20 0 hex 63 58 39 59 61 48 22 49
+# This file was generated by the deal.II library.
+
+
+#
+# For a description of the UCD format see the AVS Developer's guide.
+#
+45 13 0 0 0
+1 0.00000 0.00000 0.00000
+2 1.00000 0.00000 0.00000
+3 0.866025 0.500000 0.00000
+4 0.500000 0.866025 0.00000
+5 6.12323e-17 1.00000 0.00000
+6 -0.500000 0.866025 0.00000
+7 -0.866025 0.500000 0.00000
+8 -1.00000 1.22465e-16 0.00000
+9 -0.866025 -0.500000 0.00000
+10 -0.500000 -0.866025 0.00000
+11 -1.83697e-16 -1.00000 0.00000
+12 0.500000 -0.866025 0.00000
+13 0.866025 -0.500000 0.00000
+14 0.00000 0.00000 -1.00000
+15 1.00000 0.00000 -1.00000
+16 0.866025 0.500000 -1.00000
+17 0.500000 0.866025 -1.00000
+18 6.12323e-17 1.00000 -1.00000
+19 -0.500000 0.866025 -1.00000
+20 -0.866025 0.500000 -1.00000
+21 -1.00000 1.22465e-16 -1.00000
+22 -0.866025 -0.500000 -1.00000
+23 -0.500000 -0.866025 -1.00000
+24 -1.83697e-16 -1.00000 -1.00000
+25 0.500000 -0.866025 -1.00000
+26 0.866025 -0.500000 -1.00000
+29 -0.500000 6.12323e-17 0.00000
+30 -0.250000 -0.433013 0.00000
+31 0.00000 0.00000 -0.500000
+37 -0.933013 -0.250000 0.00000
+38 -1.00000 1.22465e-16 -0.500000
+39 -0.866025 -0.500000 -0.500000
+40 -0.683013 -0.683013 0.00000
+41 -0.500000 -0.866025 -0.500000
+44 -0.500000 6.12323e-17 -1.00000
+45 -0.250000 -0.433013 -1.00000
+48 -0.933013 -0.250000 -1.00000
+49 -0.683013 -0.683013 -1.00000
+52 -0.591506 -0.341506 0.00000
+53 -0.500000 6.12323e-17 -0.500000
+54 -0.250000 -0.433013 -0.500000
+58 -0.933013 -0.250000 -0.500000
+59 -0.683013 -0.683013 -0.500000
+61 -0.591506 -0.341506 -1.00000
+63 -0.591506 -0.341506 -0.500000
+1 0 hex 1 2 3 4 14 15 16 17
+2 0 hex 1 4 5 6 14 17 18 19
+3 0 hex 1 6 7 8 14 19 20 21
+4 0 hex 1 10 11 12 14 23 24 25
+5 0 hex 1 12 13 2 14 25 26 15
+6 0 hex 1 29 52 30 31 53 63 54
+7 0 hex 29 8 37 52 53 38 58 63
+8 0 hex 31 53 63 54 14 44 61 45
+9 0 hex 53 38 58 63 44 21 48 61
+10 0 hex 30 52 40 10 54 63 59 41
+11 0 hex 52 37 9 40 63 58 39 59
+12 0 hex 54 63 59 41 45 61 49 23
+13 0 hex 63 58 39 59 61 48 22 49
projects / dealii-svn.git / commitdiff