--- /dev/null
+//-----------------------------------------------------------------------------
+// $Id: data_out_base_pvd.cc 25569 2012-05-30 12:53:31Z bangerth $
+// Version: $Name$
+//
+// Copyright (C) 2006, 2007, 2010, 2012 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//-----------------------------------------------------------------------------
+
+
+// on a somewhat deformed cube, verify that if we push forward a bunch
+// of points from the reference to the real cell and then call
+// Mapping::transform_unit_to_real_cell that we get the same point as
+// we had in the beginning.
+//
+// this test is like the _q1 test but uses a Q4 mapping. however,
+// since we use StraightBoundary objects to describe the boundary, we
+// should really get nothing different since the mapping is, in
+// reality, still (bi-/tri-)linear
+
+#include "../tests.h"
+
+#include <deal.II/base/utilities.h>
+#include <deal.II/grid/tria.h>
+#include <deal.II/grid/grid_generator.h>
+#include <deal.II/fe/mapping_q.h>
+
+
+template<int dim, int spacedim>
+void test_real_to_unit_cell()
+{
+ deallog << "dim=" << dim << ", spacedim=" << spacedim << std::endl;
+
+ Triangulation<dim, spacedim> triangulation;
+ GridGenerator::hyper_cube (triangulation);
+
+ const unsigned int n_points = 5;
+ std::vector< Point<dim> > unit_points(Utilities::fixed_power<dim>(n_points));
+
+ switch (dim)
+ {
+ case 1:
+ for (unsigned int x=0; x<n_points;++x)
+ unit_points[x][0] = double(x)/double(n_points);
+ break;
+
+ case 2:
+ for (unsigned int x=0; x<n_points;++x)
+ for (unsigned int y=0; y<n_points;++y)
+ {
+ unit_points[y * n_points + x][0] = double(x)/double(n_points);
+ unit_points[y * n_points + x][1] = double(y)/double(n_points);
+ }
+ break;
+
+ case 3:
+ for (unsigned int x=0; x<n_points;++x)
+ for (unsigned int y=0; y<n_points;++y)
+ for (unsigned int z=0; z<n_points;++z)
+ {
+ unit_points[z * n_points + y * n_points + x][0] = double(x)/double(n_points);
+ unit_points[z * n_points + y * n_points + x][1] = double(y)/double(n_points);
+ unit_points[z * n_points + y * n_points + x][2] = double(z)/double(n_points);
+ }
+ break;
+ }
+
+
+ MappingQ< dim, spacedim > map(4);
+
+ typename Triangulation<dim, spacedim >::active_cell_iterator
+ cell = triangulation.begin_active();
+
+ //Move a vertex a little bit
+ const unsigned int n_dx = 5;
+ const double dx = 0.4/n_dx;
+ Point<spacedim> direction;
+ for (unsigned int j=0; j<spacedim;++j)
+ direction[j]=dx;
+
+ // in a loop, make the cell more
+ // and more distorted
+ for (unsigned int j=0; j<n_dx;++j)
+ {
+ deallog << "Vertex displacement: " << double(j)*direction << std::endl;
+ cell->vertex(0) = double(j)*direction;
+
+ for (unsigned int i=0; i<unit_points.size();++i)
+ {
+ // for each of the points,
+ // verify that if we apply
+ // the forward map and then
+ // pull back that we get
+ // the same point again
+ const Point<spacedim> p = map.transform_unit_to_real_cell(cell,unit_points[i]);
+ const Point<dim> p_unit = map.transform_real_to_unit_cell(cell,p);
+ Assert (unit_points[i].distance(p_unit) < 1e-10,
+ ExcInternalError());
+ }
+ }
+ deallog << "OK" << std::endl;
+}
+
+
+int
+main()
+{
+ std::ofstream logfile ("mapping_real_to_unit_q4/output");
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+ deallog.threshold_double(1.e-10);
+
+
+ test_real_to_unit_cell<1,1>();
+ test_real_to_unit_cell<2,2>();
+ test_real_to_unit_cell<3,3>();
+
+ test_real_to_unit_cell<1,2>();
+
+// the following is not currently implemented
+// test_real_to_unit_cell<1,3>();
+ test_real_to_unit_cell<2,3>();
+
+ return 0;
+}
+
+
+
--- /dev/null
+
+DEAL::dim=1, spacedim=1
+DEAL::Vertex displacement: 0.00000
+DEAL::Vertex displacement: 0.0800000
+DEAL::Vertex displacement: 0.160000
+DEAL::Vertex displacement: 0.240000
+DEAL::Vertex displacement: 0.320000
+DEAL::OK
+DEAL::dim=2, spacedim=2
+DEAL::Vertex displacement: 0.00000 0.00000
+DEAL::Vertex displacement: 0.0800000 0.0800000
+DEAL::Vertex displacement: 0.160000 0.160000
+DEAL::Vertex displacement: 0.240000 0.240000
+DEAL::Vertex displacement: 0.320000 0.320000
+DEAL::OK
+DEAL::dim=3, spacedim=3
+DEAL::Vertex displacement: 0.00000 0.00000 0.00000
+DEAL::Vertex displacement: 0.0800000 0.0800000 0.0800000
+DEAL::Vertex displacement: 0.160000 0.160000 0.160000
+DEAL::Vertex displacement: 0.240000 0.240000 0.240000
+DEAL::Vertex displacement: 0.320000 0.320000 0.320000
+DEAL::OK
+DEAL::dim=1, spacedim=2
+DEAL::Vertex displacement: 0.00000 0.00000
+DEAL::Vertex displacement: 0.0800000 0.0800000
+DEAL::Vertex displacement: 0.160000 0.160000
+DEAL::Vertex displacement: 0.240000 0.240000
+DEAL::Vertex displacement: 0.320000 0.320000
+DEAL::OK
+DEAL::dim=2, spacedim=3
+DEAL::Vertex displacement: 0.00000 0.00000 0.00000
+DEAL::Vertex displacement: 0.0800000 0.0800000 0.0800000
+DEAL::Vertex displacement: 0.160000 0.160000 0.160000
+DEAL::Vertex displacement: 0.240000 0.240000 0.240000
+DEAL::Vertex displacement: 0.320000 0.320000 0.320000
+DEAL::OK