lsFromMesh.hpp

Go to the documentation of this file.

#pragma once
 
#include <lsPreCompileMacros.hpp>
 
#include <lsDomain.hpp>
#include <lsMesh.hpp>
 
namespace viennals {
 
using namespace viennacore;

template <class T, int D> class FromMesh {
  typedef typename Domain<T, D>::DomainType hrleDomainType;
 
  SmartPointer<Domain<T, D>> levelSet = nullptr;
  SmartPointer<Mesh<T>> mesh = nullptr;
  bool sortPointList = true;
 
public:
  FromMesh() = default;
 
  FromMesh(SmartPointer<Domain<T, D>> passedLevelSet,
           SmartPointer<Mesh<T>> passedMesh)
      : levelSet(passedLevelSet), mesh(passedMesh) {}
 
  void setLevelSet(SmartPointer<Domain<T, D>> passedlsDomain) {
    levelSet = passedlsDomain;
  }
 
  void setMesh(const SmartPointer<Mesh<T>> passedMesh) { mesh = passedMesh; }
 
  void setSortPointList(bool passedSortPointList) {
    sortPointList = passedSortPointList;
  }
 
  void apply() {
    if (levelSet == nullptr) {
      Logger::getInstance()
          .addWarning("No level set was passed to FromMesh.")
          .print();
      return;
    }
    if (mesh == nullptr) {
      Logger::getInstance()
          .addWarning("No Mesh<> was supplied to FromMesh.")
          .print();
      return;
    }
 
    auto &domain = levelSet->getDomain();
    auto &nodes = mesh->getNodes();
    auto values = mesh->cellData.getScalarData("LSValues", true);
 
    if (values == nullptr) {
      Logger::getInstance()
          .addWarning("Mesh does not contain level set values (\"LSValues\").")
          .print();
      return;
    }
 
    domain.initialize();
 
    // if there are no points, just initialize an empty hrleDomain
    if (nodes.empty()) {
      return;
    }
 
    const viennahrle::Grid<D> &grid = domain.getGrid();
    const T gridDelta = grid.getGridDelta();
 
    viennahrle::Index<D> lastIndex;
    for (unsigned i = 0; i < D; ++i) {
      lastIndex[i] = nodes.front()[i] / gridDelta;
    }
 
    if (lastIndex != grid.getMinGridPoint()) {
      domain.insertNextUndefinedPoint(0, grid.getMinGridPoint(),
                                      (values->front() < 0)
                                          ? Domain<T, D>::NEG_VALUE
                                          : Domain<T, D>::POS_VALUE);
    }
 
    auto pointDataIt = nodes.begin();
    auto pointDataEnd = nodes.end();
 
    auto valueIt = values->begin();
    auto valueEnd = values->end();
 
    VectorType<bool, D> signs;
    std::fill(signs.begin(), signs.end(),
              values->front() <= -std::numeric_limits<T>::epsilon());
 
    while (pointDataIt != pointDataEnd && valueIt != valueEnd) {
      // only read in points within the first 5 layers, to ignore
      // undefined points
      if (std::abs(*valueIt) > 2.5) {
        ++pointDataIt;
        ++valueIt;
        continue;
      }
 
      bool setPoint = true;
 
      viennahrle::Index<D> currentIndex;
      for (unsigned i = 0; i < D; ++i) {
        currentIndex[i] = std::round(pointDataIt->at(i) / gridDelta);
      }
 
      // if boundary conditions are infinite always set the point
      // if not, check, whether it is inside of domain
      for (unsigned i = 0; i < D; ++i) {
        if (grid.getBoundaryConditions(i) !=
            viennahrle::BoundaryType::INFINITE_BOUNDARY) {
          if (currentIndex[i] > grid.getMaxBounds(i) ||
              currentIndex[i] < grid.getMinBounds(i)) {
            setPoint = false;
          }
        }
      }
 
      if (setPoint) {
        // Add defined point as it appears in the list
        domain.insertNextDefinedPoint(0, currentIndex, *valueIt);
 
        // determine signs for next undefined runs
        {
          bool changeSign = false;
          for (int i = D - 1; i >= 0; --i) {
            changeSign = changeSign || (currentIndex[i] > lastIndex[i]);
            if (changeSign) {
              signs[i] = *valueIt <= -std::numeric_limits<T>::epsilon();
              lastIndex[i] = currentIndex[i];
            }
          }
        }
      }
 
      viennahrle::Index<D> nextIndex;
 
      ++pointDataIt;
      ++valueIt;
 
      // choose correct next index
      if (pointDataIt == pointDataEnd) {
        nextIndex = grid.getMaxGridPoint();
        ++nextIndex[D - 1];
      } else {
        for (unsigned i = 0; i < D; ++i) {
          nextIndex[i] = std::round(pointDataIt->at(i) / gridDelta);
        }
      }
 
      // move current index by one grid spacing and see if the next
      // point has the same index, if not, there must be an undefined
      // run inbetween
      for (int q = 0; q < D; q++) {
        viennahrle::Index<D> tmp = currentIndex;
        ++tmp[q];
        if (tmp[q] > grid.getMaxGridPoint(q))
          continue;
        for (int r = 0; r < q; ++r)
          tmp[r] = grid.getMinGridPoint(r);
 
        if (tmp >= nextIndex)
          break;
 
        domain.insertNextUndefinedPoint(0, tmp,
                                        signs[q] ? Domain<T, D>::NEG_VALUE
                                                 : Domain<T, D>::POS_VALUE);
      }
    }
 
    domain.finalize();
  }
};
 
// add all template specialisations for this class
PRECOMPILE_PRECISION_DIMENSION(FromMesh)
 
} // namespace viennals