step-1.cc File Reference

#include <deal.II/grid/grid_generator.h>
#include <deal.II/grid/grid_out.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_accessor.h>
#include <deal.II/grid/tria_iterator.h>
#include <cmath>
#include <fstream>
#include <iostream>

Include dependency graph for step-1.cc:

Go to the source code of this file.

Functions
void	first_grid (Triangulation< 2 > &triangulation)
	Generate a hypercube, and output it as an svg file. More...
void	second_grid (Triangulation< 2 > &triangulation)
	Generate a locally refined hyper_shell, and output it as an svg file. More...
void	third_grid (Triangulation< 2 > &)
	Create an L-shaped domain with one global refinement, and write it on. More...
std::tuple< unsigned int, unsigned int, unsigned int >	get_info (const Triangulation< 2 > &)
	Returns a tuple with number of levels, number of cells, number of active. More...
int	main ()

Function Documentation

first_grid()

void first_grid

(

Triangulation< 2 > &

triangulation

)

Generate a hypercube, and output it as an svg file.

Definition at line 35 of file step-1.cc.

{
  GridGenerator::hyper_cube(triangulation);
 
  std::cout << "Number of original vertices: " << triangulation.n_vertices()
            << std::endl;
 
  triangulation.refine_global(4);
 
  std::cout << "Number of vertices after 4 refinements: "
            << triangulation.n_vertices() << std::endl;
  {
    std::ofstream out("grid-1.svg");
    GridOut       grid_out;
    grid_out.write_svg(triangulation, out);
    std::cout << "Grid written to grid-1.svg" << std::endl;
  }
  {
    std::ofstream out("grid-1.vtk");
    GridOut       grid_out;
    grid_out.write_vtk(triangulation, out);
    std::cout << "Grid written to grid-1.vtk" << std::endl;
  }
}

second_grid()

void second_grid

(

Triangulation< 2 > &

triangulation

)

Generate a locally refined hyper_shell, and output it as an svg file.

Definition at line 63 of file step-1.cc.

{
  const Point<2> center(1, 0);
  const double   inner_radius = 0.5, outer_radius = 1.0;
  GridGenerator::hyper_shell(
    triangulation, center, inner_radius, outer_radius, 10);
 
  // triangulation.reset_all_manifolds();
 
  for (unsigned int step = 0; step < 5; ++step)
    {
      std::ofstream out("grid-2-" + std::to_string(step) + ".vtk");
      GridOut       grid_out;
      grid_out.write_vtk(triangulation, out);
 
      for (auto &cell : triangulation.active_cell_iterators())
        {
          for (const auto v : cell->vertex_indices())
            {
              const double distance_from_center =
                center.distance(cell->vertex(v));
 
              if (std::fabs(distance_from_center - inner_radius) <=
                  1e-6 * inner_radius)
                {
                  cell->set_refine_flag();
                  break;
                }
            }
        }
 
      triangulation.execute_coarsening_and_refinement();
    }
}

third_grid()

void third_grid

(

Triangulation< 2 > &

)

Create an L-shaped domain with one global refinement, and write it on.

Definition at line 104 of file step-1.cc.

{
  // Insert code here
}

get_info()

std::tuple<unsigned int, unsigned int, unsigned int> get_info

(

const Triangulation< 2 > &

)

Returns a tuple with number of levels, number of cells, number of active.

Definition at line 112 of file step-1.cc.

{
  // Insert code here
  return std::make_tuple(0, 0, 0);
}

main()

int main

(

)

Definition at line 119 of file step-1.cc.

{
  {
    Triangulation<2> triangulation;
    first_grid(triangulation);
  }
  {
    Triangulation<2> triangulation;
    second_grid(triangulation);
  }
}