/Users/marc/Developer/EGSnrc/HEN_HOUSE/user_codes/egs_brachy/egs_brachy/ginfo.h

Go to the documentation of this file.

/*
################################################################################
#
#  egs_brachy ginfo.h
#  Copyright (C) 2016 Rowan Thomson, Dave Rogers, Randle Taylor, and Marc
#  Chamberland
#
#  This file is part of egs_brachy
#
#  egs_brachy is free software: you can redistribute it and/or modify it
#  under the terms of the GNU Affero General Public License as published
#  by the Free Software Foundation, either version 3 of the License, or
#  (at your option) any later version.
#
#  egs_brachy 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
#  Affero General Public License for more details:
#  <http://www.gnu.org/licenses/>.
#
################################################################################
#
#  When egs_brachy is used for publications, please cite our paper:
#  M. J. P. Chamberland, R. E. P. Taylor, D. W. O. Rogers, and R. M. Thomson,
#  egs brachy: a versatile and fast Monte Carlo code for brachytherapy,
#  Phys. Med. Biol. 61, 8214-8231 (2016).
#
################################################################################
#
#  Author:        Randle Taylor, 2016
#
#  Contributors:  Marc Chamberland
#                 Dave Rogers
#                 Rowan Thomson
#
################################################################################
*/
 
#ifndef EB_GINFO_
#define EB_GINFO_
 
#include <map>
#include <set>
#include <cstdlib>
#include <algorithm>
 
#include "egs_functions.h"
#include "egs_input.h"
#include "phantom.h"
 
 
// Tree node used for organizing/sorting geometries and their children
class Node {
public:
    string name;
    vector<Node> children;
 
    Node(string n, vector<Node> children) {
        name = n;
        for (size_t i=0; i < children.size(); i++) {
            addNode(children[i]);
        }
 
    };
 
    void addNode(Node node) {
        children.push_back(node);
    }
 
};
 
 
typedef pair<EGS_BaseGeometry *, int> GeomRegT;
 
 
struct GeomRegionInfo {
 
    string name; 
    string type; 
    vector<string> children; 
    int nreg; 
    int start; 
    int end; 
};
 
typedef  map<string, GeomRegionInfo> GeomRegionInfoMapT;
 
 
class GeomInfo {
 
    vector<int> global_ir_to_phant; 
    //
    vector<int> global_ir_to_source; 
 
 
    vector<EGS_BaseGeometry *> global_ir_to_geom; 
 
    vector<int> global_ir_to_local_ir; 
    //
    GeomRegionInfoMapT gmap;
 
    vector<string> getChildren(string name, EGS_Input *inp);
 
    void getGeomRegs(Node, vector<GeomRegionInfo> &, int);
    void setGeomMap();
 
    Node build_tree(string root, vector<Node> &children);
 
public:
 
 
    string sim_geom_name;         
    string source_envelope_name;         
    vector<string> phantom_names; 
    vector<string> source_names;  
    Node *geom_tree; 
    int ngeom;     
    int nreg_total; 
 
 
    GeomInfo() {};
    ~GeomInfo() {
        if (geom_tree) {
            delete geom_tree;
        }
    }
 
    vector<GeomRegionInfo> ordered_geom_data; 
    map<EGS_BaseGeometry *, GeomRegionInfo> geom_to_regioninfo; 
    vector<EB_Phantom *> phantom_geoms; 
 
    int initializeFromInput(EGS_Input *input);
 
    void setGeometryIndexes(EGS_BaseGeometry *sim_geom);
 
    int phantomFromRegion(int ir);
 
    GeomRegT globalToLocal(int ir);
 
    int globalToLocalReg(int ir);
 
    /* \brief convert an (EGS_BaseGeometry, local_reg_num) to global region number */
    int localToGlobal(GeomRegT);
 
 
    /* \brief return true if global reg is inside a phantom object */
    bool isPhantom(int ir);
 
    /* \brief return true if global reg is inside the first source (a.ka.
     * generator) object */
    bool isSource(int ir);
 
    /* \brief print information about geometries and their region number*/
    void printInfo();
 
};
 
#endif