IrregularDomain.h 6.57 KB
Newer Older
1
//
frey_m's avatar
frey_m committed
2 3
// Class IrregularDomain
//   Defines a common abstract interface for different types of boundaries.
4
//
5
// Copyright (c) 2008,        Yves Ineichen, ETH Zürich,
frey_m's avatar
frey_m committed
6
//               2013 - 2015, Tülin Kaman, Paul Scherrer Institut, Villigen PSI, Switzerland
7
//               2017 - 2020, Paul Scherrer Institut, Villigen PSI, Switzerland
frey_m's avatar
frey_m committed
8
// All rights reserved
9
//
10 11 12 13 14
// Implemented as part of the master thesis
// "A Parallel Multigrid Solver for Beam Dynamics"
// and the paper
// "A fast parallel Poisson solver on irregular domains applied to beam dynamics simulations"
// (https://doi.org/10.1016/j.jcp.2010.02.022)
frey_m's avatar
frey_m committed
15 16 17 18 19 20 21 22 23 24
//
// This file is part of OPAL.
//
// OPAL 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 3 of the License, or
// (at your option) any later version.
//
// You should have received a copy of the GNU General Public License
// along with OPAL. If not, see <https://www.gnu.org/licenses/>.
25
//
gsell's avatar
gsell committed
26 27 28 29 30
#ifndef IRREGULAR_DOMAIN_H
#define IRREGULAR_DOMAIN_H

#include <vector>
#include <string>
31
#include "Algorithms/PBunchDefs.h"
32

gsell's avatar
gsell committed
33 34 35 36 37 38 39
/// enumeration corresponding to different interpolation methods at the boundary
enum {
    CONSTANT,
    LINEAR,
    QUADRATIC
};

40

gsell's avatar
gsell committed
41 42 43 44
class IrregularDomain {

public:

45 46 47 48 49 50 51 52 53 54 55 56 57 58
    template<typename T>
    struct Stencil {
        T center;   // x,   y,   z
        T west;     // x-1, y,   z
        T east;     // x+1, y,   z
        T north;    // x,   y+1, z
        T south;    // x,   y-1, z
        T front;    // x,   y,   z-1
        T back;     // x,   y,   z+1
    };

    typedef Stencil<int>    StencilIndex_t;
    typedef Stencil<double> StencilValue_t;

frey_m's avatar
frey_m committed
59
    IrregularDomain(const Vector_t& nr,
60 61
                    const Vector_t& hr,
                    const std::string& interpl);
frey_m's avatar
frey_m committed
62 63


frey_m's avatar
frey_m committed
64 65
    /** method to compute the intersection points with the boundary geometry
     * (stored in some appropriate data structure)
gsell's avatar
gsell committed
66 67
     * \param hr updated mesh spacings
     */
68
    virtual void compute(Vector_t hr, NDIndex<3> localId) = 0;
gsell's avatar
gsell committed
69 70 71 72 73

    /// method to calculate the stencil at a boundary points
    /// \param x index of the current element in the matrix
    /// \param y index of the current element in the matrix
    /// \param z index of the current element in the matrix
74 75
    /// \param values of stencil element
    /// \param scaleFactor of stencil values
76
    void getBoundaryStencil(int x, int y, int z,
77
                                    StencilValue_t& value,
78
                                    double &scaleFactor);
gsell's avatar
gsell committed
79 80

    /// method to calculate the stencil at a boundary points
81
    /// \param id index of the current element in the matrix
82 83 84
    // \param values of stencil element
    /// \param scaleFactor of stencil values
    void getBoundaryStencil(int id, StencilValue_t& value,
85
                            double &scaleFactor);
gsell's avatar
gsell committed
86 87 88 89 90

    /// method to calculate the neighbours in the matrix of the current index (x,y,z)
    /// \param x index of the current element in the matrix
    /// \param y index of the current element in the matrix
    /// \param z index of the current element in the matrix
91
    /// \param index stencil indices of an element
92
    void getNeighbours(int x, int y, int z, StencilIndex_t& index);
93 94

    void getNeighbours(int idx, StencilIndex_t& index);
95

frey_m's avatar
frey_m committed
96 97
    /// Conversion from a 3D index to (x,y,z)
    virtual void getCoord(int idx, int &x, int &y, int &z);
98

frey_m's avatar
frey_m committed
99 100
    /// Conversion from (x,y,z) to index on the 3D grid
    int getIdx(int x, int y, int z);
gsell's avatar
gsell committed
101 102 103 104 105 106 107 108

    /// method that checks if a given point lies inside the boundary
    /// \param x index of the current element in the matrix
    /// \param y index of the current element in the matrix
    /// \param z index of the current element in the matrix
    /// \return boolean indicating if the point lies inside the boundary
    virtual bool isInside(int x, int y, int z) = 0;

frey_m's avatar
frey_m committed
109 110 111 112
    Vector_t getNr() { return nr_m; }
    Vector_t getHr() { return hr_m; }
    void setNr(Vector_t nr) { nr_m = nr; }
    void setHr(Vector_t hr) { hr_m = hr; }
gsell's avatar
gsell committed
113 114 115 116 117

    void setMinMaxZ(double minz, double maxz) { zMin_m=minz; zMax_m=maxz; }
    double getMinZ() { return zMin_m; }
    double getMaxZ() { return zMax_m; }

118 119 120 121 122 123 124 125 126
    double getXRangeMin();
    double getXRangeMax();
    double getYRangeMin();
    double getYRangeMax();
    double getZRangeMin();
    double getZRangeMax();

    void setRangeMin(const Vector_t&);
    void setRangeMax(const Vector_t&);
gsell's avatar
gsell committed
127

128 129
    bool hasGeometryChanged();

130
    virtual ~IrregularDomain() {};
gsell's avatar
gsell committed
131

132
    virtual void resizeMesh(Vector_t& origin, Vector_t& hr,
frey_m's avatar
frey_m committed
133
                            const Vector_t& /*rmin*/, const Vector_t& /*rmax*/,
134
                            double /*dh*/);
135

gsell's avatar
gsell committed
136 137
protected:

frey_m's avatar
frey_m committed
138 139
    virtual int indexAccess(int x, int y, int z) = 0;

140 141 142 143 144 145 146 147 148 149 150
    /// different interpolation methods for boundary points
    virtual void constantInterpolation(int x, int y, int z, StencilValue_t& value,
                               double &scaleFactor);

    virtual void linearInterpolation(int x, int y, int z, StencilValue_t& value,
                             double &scaleFactor);

    virtual void quadraticInterpolation(int x, int y, int z, StencilValue_t& value,
                                double &scaleFactor);


gsell's avatar
gsell committed
151 152
    // a irregular domain is always defined on a grid
    /// number of mesh points in each direction
frey_m's avatar
frey_m committed
153
    Vector_t nr_m;
gsell's avatar
gsell committed
154
    /// mesh-spacings in each direction
frey_m's avatar
frey_m committed
155
    Vector_t hr_m;
gsell's avatar
gsell committed
156 157 158 159

    /// min/max of bunch in floor coordinates
    double zMin_m;
    double zMax_m;
160

161 162 163
    Vector_t min_m;
    Vector_t max_m;

164 165 166
    /// flag indicating if geometry has changed for the current time-step
    bool hasGeometryChanged_m;

167 168 169
    /// interpolation type
    int interpolationMethod_m;

170 171 172 173 174 175
    /// mapping (x,y,z) -> idx
    std::map<int, int> idxMap_m;

    /// mapping idx -> (x,y,z)
    std::map<int, int> coordMap_m;

gsell's avatar
gsell committed
176 177
};

178 179 180 181 182

inline bool IrregularDomain::hasGeometryChanged() {
    return hasGeometryChanged_m;
}

183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214
inline double IrregularDomain::getXRangeMin() {
    return min_m(0);
}

inline double IrregularDomain::getXRangeMax() {
    return max_m(0);
}

inline double IrregularDomain::getYRangeMin() {
    return min_m(1);
}

inline double IrregularDomain::getYRangeMax() {
    return max_m(1);
}

inline double IrregularDomain::getZRangeMin() {
    return min_m(2);
}

inline double IrregularDomain::getZRangeMax() {
    return max_m(2);
}

inline void IrregularDomain::setRangeMin(const Vector_t& min) {
    min_m = min;
}

inline void IrregularDomain::setRangeMax(const Vector_t& max) {
    max_m = max;
}

215 216
#endif

217

218 219 220 221 222 223 224
// vi: set et ts=4 sw=4 sts=4:
// Local Variables:
// mode:c
// c-basic-offset: 4
// indent-tabs-mode: nil
// require-final-newline: nil
// End: