levelSetOctreeKernel.cpp

/*---------------------------------------------------------------------------*\
 *
 *  bitpit
 *
 *  Copyright (C) 2015-2021 OPTIMAD engineering Srl
 *
 *  -------------------------------------------------------------------------
 *  License
 *  This file is part of bitpit.
 *
 *  bitpit is free software: you can redistribute it and/or modify it
 *  under the terms of the GNU Lesser General Public License v3 (LGPL)
 *  as published by the Free Software Foundation.
 *
 *  bitpit is distributed in the hope that it will be useful, but WITHOUT
 *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 *  FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
 *  License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with bitpit. If not, see <http://www.gnu.org/licenses/>.
 *
\*---------------------------------------------------------------------------*/
 
# include "bitpit_voloctree.hpp"
# include "bitpit_CG.hpp"
# include "levelSetKernel.hpp"
# include "levelSetOctreeKernel.hpp"
 
namespace bitpit {


LevelSetOctreeKernel::LevelSetOctreeKernel(VolOctree &patch, LevelSetFillIn fillIn ) : LevelSetCachedKernel(&patch, fillIn) {
 
    // Initialize cache
    CellCacheCollection &cacheCollection = getCellCacheCollection();
    if (fillIn == LevelSetFillIn::SPARSE) {
        m_cellCentroidCacheId = cacheCollection.insert<CellSparseCacheContainer<std::array<double, 3>>>(CellCacheCollection::NULL_CACHE_ID);
    } else if (fillIn == LevelSetFillIn::DENSE) {
        m_cellCentroidCacheId = cacheCollection.insert<CellDenseCacheContainer<std::array<double, 3>>>(CellCacheCollection::NULL_CACHE_ID);
    } else {
        m_cellCentroidCacheId = CellCacheCollection::NULL_CACHE_ID;
    }
 
    // Mesh information
    VolOctree *mesh = getMesh();
    int dimension = mesh->getDimension();
    int maxLevel  = TreeConstants::instance(dimension).maxLevel;
 
    // Initialize bounding and tangent radii
    m_octantTangentRadii.resize(maxLevel + 1);
    m_octantBoundingRadii.resize(maxLevel + 1);
    for (int level = 0; level <= maxLevel; ++level) {
        double levelSize = mesh->getTree().levelToSize(level);
 
        m_octantTangentRadii[level]  = 0.5 * levelSize;
        m_octantBoundingRadii[level] = 0.5 * std::sqrt(dimension) * levelSize;
    }
 
}

VolOctree * LevelSetOctreeKernel::getMesh() const{
    return static_cast<VolOctree *>(LevelSetKernel::getMesh()) ;
}

double LevelSetOctreeKernel::getOctantTangentRadius( int level ) const {
 
    return m_octantTangentRadii[level];
 
}

double LevelSetOctreeKernel::getOctantBoundingRadius( int level ) const {
 
    return m_octantBoundingRadii[level];
 
}

std::array<double, 3> LevelSetOctreeKernel::computeCellCentroid( long id ) const {
 
    // Try fetching the value from the cache
    CellCacheCollection::ValueCache<std::array<double, 3>> *cache = (*m_cellCacheCollection)[m_cellCentroidCacheId].getCache<std::array<double, 3>>();
    if (cache) {
        typename CellCacheCollection::ValueCache<std::array<double, 3>>::Entry cacheEntry = cache->findEntry(id);
        if (cacheEntry.isValid()) {
            return *cacheEntry;
        }
    }
 
    // Evaluate the centroid
    std::array<double, 3> centroid = getMesh()->evalCellCentroid(id);
 
    // Update the cache
    if (cache) {
        cache->insertEntry(id, centroid);
    }
 
    return centroid;
 
}

double LevelSetOctreeKernel::computeCellTangentRadius( long id ) const {
 
    const VolOctree *mesh = getMesh();
    int cellLevel = mesh->getCellLevel(id);
 
    return getOctantTangentRadius(cellLevel);
 
}

double LevelSetOctreeKernel::computeCellBoundingRadius( long id ) const {
 
    const VolOctree *mesh = getMesh();
    int cellLevel = mesh->getCellLevel(id);
 
    return getOctantBoundingRadius(cellLevel);
 
}
 
}