test_adaptive_refinement_utilities.h

Go to the documentation of this file.

/*
This file is part of the Ristra Wonton project.
Please see the license file at the root of this repository, or at:
    https://github.com/laristra/wonton/blob/master/LICENSE
*/

#ifndef WONTON_ADAPTIVE_REFINEMENT_MESH_UTILITIES_H_
#define WONTON_ADAPTIVE_REFINEMENT_MESH_UTILITIES_H_

#include <iostream>
#include <cmath>
#include <vector>

#include "wonton/support/wonton.h"
#include "wonton/support/Point.h"

#include "gtest/gtest.h"

// ============================================================================
namespace Adaptive_Refinement_Utilities {

// Getting tired of typing this
template<int D>
using BoxList = std::pair<std::vector<int>,std::vector<Wonton::BoundingBox<D>>>;

// Getting tired of typing Wonton::
const int LO = Wonton::LO;
const int HI = Wonton::HI;

// ============================================================================
// Templates

template<int D>
int refinement_function(const Wonton::Point<D> r, double lo1, double hi1) {
  return(0);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<int D>
int num_cells() {
  return(0);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<int D>
BoxList<D> get_sample_points() {
  BoxList<D> boxes;
  return boxes;
}

// ============================================================================
// 1D

template<>
int refinement_function<1>(
    const Wonton::Point<1> r, double lo1, double hi1) {
  Wonton::Point<1> r_norm;
  r_norm[0] = (r[0] - lo1) / (hi1 - lo1);
  int result = (int) std::ceil(2.0 + 3.0*r_norm[0]);
  return(result);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
int num_cells<1>() {
  return(18);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
BoxList<1> get_sample_points<1>() {
  // Declare storage and counter
  std::vector<int> id_list;
  std::vector<Wonton::BoundingBox<1>> box_list;
  int n;
  // First sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 0;
  box_list[n][0][LO] = 0.0;
  box_list[n][0][HI] = 1.0 / 8.0;
  // Second sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 6;
  box_list[n][0][LO] =  9.0 / 16.0;
  box_list[n][0][HI] = 10.0 / 16.0;
  // Third sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 14;
  box_list[n][0][LO] = 1.0 - 4.0 / 32.0;
  box_list[n][0][HI] = 1.0 - 3.0 / 32.0;
  // Return
  return std::make_pair(id_list,box_list);
}

// ============================================================================

template<>
int refinement_function<2>(
    const Wonton::Point<2> r, double lo1, double hi1) {
  Wonton::Point<2> r_norm;
  for (int d = 0; d < 2; ++d) {
    r_norm[d] = (r[d] - lo1) / (hi1 - lo1);
  }
  int result = (int) std::ceil(1.2 - 1.1*r_norm[0] + 2.4*r_norm[1]);
  return(result);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
int num_cells<2>() {
  return(46);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
BoxList<2> get_sample_points<2>() {
  // Declare storage and counter
  std::vector<int> id_list;
  std::vector<Wonton::BoundingBox<2>> box_list;
  int n;
  // First sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 4;
  box_list[n][0][LO] = 0.5;
  box_list[n][0][HI] = 1.0;
  box_list[n][1][LO] = 0.0;
  box_list[n][1][HI] = 0.5;
  // Second sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 20;
  box_list[n][0][LO] = 0.0;
  box_list[n][0][HI] = 1.0 / 16.0;
  box_list[n][1][LO] = 1.0 - 1.0 / 16.0;
  box_list[n][1][HI] = 1.0;
  // Third sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 35;
  box_list[n][0][LO] = 4.0 / 8.0;
  box_list[n][0][HI] = 5.0 / 8.0;
  box_list[n][1][LO] = 5.0 / 8.0;
  box_list[n][1][HI] = 6.0 / 8.0;
  // Return
  return std::make_pair(id_list,box_list);
}

// ============================================================================

template<>
int refinement_function<3>(
    const Wonton::Point<3> r, double lo1, double hi1) {
  Wonton::Point<3> r_norm;
  for (int d = 0; d < 3; ++d) {
    r_norm[d] = (r[d] - lo1) / (hi1 - lo1);
  }
  const int DIM = 3;
  double radius = 0;
  for (int d = 0; d < DIM; ++d) {
    double x = r_norm[d] - 0.5;
    radius += x * x;
  }
  radius = sqrt(radius);
  int result = (int) std::ceil(2.5 - 6.0*radius*radius);
  return(result);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
int num_cells<3>() {
  return(120);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
BoxList<3> get_sample_points<3>() {
  // Declare storage and counter
  std::vector<int> id_list;
  std::vector<Wonton::BoundingBox<3>> box_list;
  int n;
  // First sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 0;
  box_list[n][0][LO] = 0.0;
  box_list[n][0][HI] = 0.25;
  box_list[n][1][LO] = 0.0;
  box_list[n][1][HI] = 0.25;
  box_list[n][2][LO] = 0.0;
  box_list[n][2][HI] = 0.25;
  // Second sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 92;
  box_list[n][0][LO] = 3.0 / 8.0;
  box_list[n][0][HI] = 4.0 / 8.0;
  box_list[n][1][LO] = 4.0 / 8.0;
  box_list[n][1][HI] = 5.0 / 8.0;
  box_list[n][2][LO] = 4.0 / 8.0;
  box_list[n][2][HI] = 5.0 / 8.0;
  // Third sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 119;
  box_list[n][0][LO] = 0.75;
  box_list[n][0][HI] = 1.0;
  box_list[n][1][LO] = 0.75;
  box_list[n][1][HI] = 1.0;
  box_list[n][2][LO] = 0.75;
  box_list[n][2][HI] = 1.0;
  // Return
  return std::make_pair(id_list,box_list);
}

// ============================================================================

template<>
int refinement_function<4>(
    const Wonton::Point<4> r, double lo1, double hi1) {
  Wonton::Point<4> r_norm;
  for (int d = 0; d < 4; ++d) {
    r_norm[d] = (r[d] - lo1) / (hi1 - lo1);
  }
  int result = (int) std::ceil(
      2.0 - 1e-12 // 1e-12 to deal with round-off issues from rescaling
      - 3.0*r_norm[0]
      + 1.2*r_norm[1]
      - 0.5*r_norm[2]
      + 0.3*r_norm[3]);
  return(result);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
int num_cells<4>() {
  return(916);
}

//  - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

template<>
BoxList<4> get_sample_points<4>() {
  // Declare storage and counter
  std::vector<int> id_list;
  std::vector<Wonton::BoundingBox<4>> box_list;
  int n;
  // First sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 0;
  box_list[n][0][LO] = 0.0;
  box_list[n][0][HI] = 0.25;
  box_list[n][1][LO] = 0.0;
  box_list[n][1][HI] = 0.25;
  box_list[n][2][LO] = 0.0;
  box_list[n][2][HI] = 0.25;
  box_list[n][3][LO] = 0.0;
  box_list[n][3][HI] = 0.25;
  // Second sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 92;
  box_list[n][0][LO] = 1.0 / 8.0;
  box_list[n][0][HI] = 2.0 / 8.0;
  box_list[n][1][LO] = 5.0 / 8.0;
  box_list[n][1][HI] = 6.0 / 8.0;
  box_list[n][2][LO] = 2.0 / 8.0;
  box_list[n][2][HI] = 3.0 / 8.0;
  box_list[n][3][LO] = 1.0 / 8.0;
  box_list[n][3][HI] = 2.0 / 8.0;
  // Third sample point
  // -- Expand lists
  n = id_list.size();
  id_list.resize(n+1);
  box_list.resize(n+1);
  // -- Save data
  id_list[n] = 119;
  box_list[n][0][LO] = 0.0;
  box_list[n][0][HI] = 1.0 / 8.0;
  box_list[n][1][LO] = 4.0 / 8.0;
  box_list[n][1][HI] = 5.0 / 8.0;
  box_list[n][2][LO] = 1.0 / 8.0;
  box_list[n][2][HI] = 2.0 / 8.0;
  box_list[n][3][LO] = 2.0 / 8.0;
  box_list[n][3][HI] = 3.0 / 8.0;
  // Return
  return std::make_pair(id_list,box_list);
}

// ============================================================================

}  // namespace Adaptive_Refinement_Utilities

#endif  // WONTON_ADAPTIVE_REFINEMENT_MESH_UTILITIES_H_