cuboid2d.hh

open lattice boltzmann project www.openlb.org

/*  This file is part of the OpenLB library
 *
 *  Copyright (C) 2007 Mathias J. Krause
 *  Address: Wilhelm-Maybach-Str. 24, 68766 Hockenheim, Germany 
 *  E-mail: [e-mail]
 *
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU General Public License
 *  as published by the Free Software Foundation; either version 2
 *  of the License, or (at your option) any later version.
 *
 *  This program 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public 
 *  License along with this program; if not, write to the Free 
 *  Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 *  Boston, MA  02110-1301, USA.
*/

/** \file
 * The description of a single 2D cuboid -- generic implementation.
 */


#ifndef CUBOID_2D_HH
#define CUBOID_2D_HH

#include <iostream>
#include <math.h>
#include <vector>
#include "cuboid2D.h"
#include "core/lbHelpers.h"


namespace olb {

////////////////////// Class Cuboid2D /////////////////////////

template<typename T>
Cuboid2D<T>::Cuboid2D(T globPosX, T globPosY, T delta ,int nX, int nY) {
    init(globPosX, globPosY, delta, nX, nY);
}

template<typename T>
void Cuboid2D<T>::init(T globPosX, T globPosY, T delta, int nX, int nY) {
    _globPosX = globPosX;
    _globPosY = globPosY;
    _delta    = delta;
    _nX       = nX;
    _nY       = nY;
}


template<typename T>
T Cuboid2D<T>::get_globPosX() const { return _globPosX; }

template<typename T>
T Cuboid2D<T>::get_globPosY() const { return _globPosY; }

template<typename T>
T Cuboid2D<T>::get_delta() const { return _delta; }

template<typename T>
int Cuboid2D<T>::get_nX() const { return _nX; }

template<typename T>
int Cuboid2D<T>::get_nY() const { return _nY; }

template<typename T>
T Cuboid2D<T>::get_volume() const { return _nY*_nX*_delta*_delta; }

template<typename T>
int Cuboid2D<T>::get_nNodesVolume() const { return _nY*_nX; }

template<typename T>
T Cuboid2D<T>::get_perimeter() const { return 2*_nY*_delta + 2*_nX*_delta; }

template<typename T>
int Cuboid2D<T>::get_nNodesPerimeter() const { return 2*_nY + 2*_nX -4; }

template<typename T>
void Cuboid2D<T>::print() const {
    std::cout << "--------Cuboid Details----------" << std::endl; 
    std::cout << " Left Corner (x/y): " << "\t" << "(" << this->get_globPosX() << "/" << this->get_globPosY() << ")" << std::endl;
    std::cout << " Delta: " << "\t" << "\t" << this->get_delta() << std::endl;
    std::cout << " Perimeter: " << "\t" << "\t" << this->get_perimeter() << std::endl;
    std::cout << " Volume: " << "\t" << "\t" << this->get_volume() << std::endl;
    std::cout << " Extent (x/y): " << "\t" << "\t" << "(" << this->get_nX() << "/" << this->get_nY() << ")" << std::endl;
    std::cout << " Nodes at Perimeter: " << "\t" << this->get_nNodesPerimeter() << std::endl;
    std::cout << " Nodes in Volume: " << "\t" << this->get_nNodesVolume() << std::endl;
    std::cout << "--------------------------------" << std::endl;
}


template<typename T>
bool Cuboid2D<T>::checkPoint(T globX, T globY, int overlap) const {
    if (_globPosX-overlap*_delta <= globX && 
        _globPosX + T(_nX-1+2*overlap)*_delta  >= globX &&
        _globPosY <= globY-overlap &&
        _globPosY + T(_nY-1+2*overlap)*_delta  >= globY) {
        return true;
    }
    else return false;
}

template<typename T>
bool Cuboid2D<T>::checkPoint(T globX, T globY, int &locX, int &locY, int overlap) const {
    if (overlap!=0) {
        Cuboid2D tmp(_globPosX - overlap*_delta, _globPosY - overlap*_delta, _delta , _nX + overlap*2, _nY + overlap*2);
        return tmp.checkPoint(globX, globY, locX, locY);
    }
    else if (!checkPoint(globX, globY)) return false;
    else {
        T tempX = globX - (T)_globPosX;
        T tempY = globY - (T)_globPosY;
        if(tempX==(int)tempX && tempY==(int)tempY) {
            locX = (int)tempX;
            locY = (int)tempY;
            return true;
        }
        else return false;
    }
}

template<typename T>
bool Cuboid2D<T>::checkInters(T globX0, T globX1, T globY0, T globY1, int overlap) const {

    double locX0d = std::max(_globPosX-overlap*_delta,globX0);
    double locY0d = std::max(_globPosY-overlap*_delta,globY0);
    double locX1d = std::min(_globPosX+(_nX+2*overlap)*_delta,globX1);
    double locY1d = std::min(_globPosY+(_nY+2*overlap)*_delta,globY1); 

    if (!(locX1d>=locX0d && locY1d>=locY0d)) return false;
    return true;
}

template<typename T>
bool Cuboid2D<T>::checkInters(T globX0, T globX1, T globY0, T globY1, 
                                  int &locX0, int &locX1, int &locY0, int &locY1, int overlap) const {
    if (overlap!=0) {
        Cuboid2D tmp(_globPosX - overlap*_delta, _globPosY - overlap*_delta, _delta , _nX + overlap*2, _nY + overlap*2);
        return tmp.checkInters(globX0, globX1, globY0, globY1, 
                                  locX0, locX1, locY0, locY1);
    }
    else if (!checkInters(globX0, globX1, globY0, globY1)) {
        locX0 = 1; locX1 = 0; locY0 = 1; locY1 = 0;
        return false;
    }
    else {
        locX0 = 0;
        for (int i=0; _globPosX + i*_delta < globX0; i++) {locX0 = i+1;}
        locX1 = _nX-1;
        for (int i=_nX-1; _globPosX + i*_delta > globX1; i--) {locX1 = i-1;}
        locY0 = 0;
        for (int i=0; _globPosY + i*_delta < globY0; i++) {locY0 = i+1;}
        locY1 = _nY-1;
        for (int i=_nY-1; _globPosY + i*_delta > globY1; i--) {locY1 = i-1;}
        return true;
    }
}

template<typename T>
void Cuboid2D<T>::divide(int nX, int nY, std::vector<Cuboid2D<T> > &childrenC) const {
    T globPosX_child, globPosY_child;
    int xN_child = 0;
    int yN_child = 0;

    globPosX_child = _globPosX;
    globPosY_child = _globPosY;

    for (int iX=0; iX<nX; iX++) {
        for (int iY=0; iY<nY; iY++) {
            xN_child       = (_nX+nX-iX-1)/nX;
            yN_child       = (_nY+nY-iY-1)/nY;
            Cuboid2D<T> child(globPosX_child, globPosY_child, _delta, xN_child, yN_child);
            childrenC.push_back(child);
            globPosY_child += yN_child*_delta;
        }
        globPosY_child = _globPosY;
        globPosX_child += xN_child*_delta;
    }
}

template<typename T>
void Cuboid2D<T>::divide(int p, std::vector<Cuboid2D<T> > &childrenC) const {

    OLB_PRECONDITION(p>0);
    int nX = 0;
    int nY = 0;
    T ratio;
    T bestRatio = (T)_nX/(T)_nY;
    T difRatio = fabs(bestRatio - 1) + 1;
    for (int i=1; i<= p; i++) {
        int j = p / i;
        if (i*j<=p) {
            if( fabs(bestRatio - (T)i/(T)j) <= difRatio) {
                difRatio = fabs(bestRatio - (T)i/(T)j);
                nX = i; nY = j;
            }
        }
    }

    ratio = T(nX)/(T)nY;
    int rest = p - nX*nY;

    if (rest==0) {
        divide(nX,nY,childrenC);
        return;
    }

    if (ratio < bestRatio) {
        int n_QNoInsertions = nX*(nY-rest);
        T bestVolume_QNoInsertions = (T)get_volume() * n_QNoInsertions/p;
        int yN_QNoInsertions = (int)(bestVolume_QNoInsertions / (T)_nX);
        int xN_QNoInsertions = _nX;
        int yN_QInsertions = _nY-yN_QNoInsertions;
        int xN_QInsertions = _nX;
        Cuboid2D<T> firstChildQ(_globPosX, _globPosY, _delta, xN_QNoInsertions, yN_QNoInsertions);
        Cuboid2D<T> secondChildQ(_globPosX, _globPosY+yN_QNoInsertions*_delta, _delta, xN_QInsertions, yN_QInsertions);

        firstChildQ.divide(nX, nY-rest, childrenC);
        secondChildQ.divide(nX+1,rest, childrenC);
    }
    else {
        int n_QNoInsertions = nY*(nX-rest);
        T bestVolume_QNoInsertions = (T)get_volume() * n_QNoInsertions/p;
        int xN_QNoInsertions = (int)(bestVolume_QNoInsertions / (T)_nY + 0.9999);
        int yN_QNoInsertions = _nY;
        int xN_QInsertions = _nX-xN_QNoInsertions;
        int yN_QInsertions = _nY;
        Cuboid2D<T> firstChildQ(_globPosX, _globPosY, _delta, xN_QNoInsertions, yN_QNoInsertions);
        Cuboid2D<T> secondChildQ(_globPosX+xN_QNoInsertions*_delta, _globPosY, _delta, xN_QInsertions, yN_QInsertions);

        firstChildQ.divide(nX-rest, nY, childrenC);
        secondChildQ.divide(rest,nY+1, childrenC);
    }
}

}  // namespace olb

#endif