TRestSpiderMask.cxx

/*************************************************************************
 * This file is part of the REST software framework.                     *
 *                                                                       *
 * Copyright (C) 2016 GIFNA/TREX (University of Zaragoza)                *
 * For more information see https://gifna.unizar.es/trex                 *
 *                                                                       *
 * REST 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.                                   *
 *                                                                       *
 * REST 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 a copy of the GNU General Public License along with   *
 * REST in $REST_PATH/LICENSE.                                           *
 * If not, see https://www.gnu.org/licenses/.                            *
 * For the list of contributors see $REST_PATH/CREDITS.                  *
 *************************************************************************/
 
 
#include "TRestSpiderMask.h"
 
#include "TRandom3.h"
 
ClassImp(TRestSpiderMask);
 
TRestSpiderMask::TRestSpiderMask() : TRestPatternMask() { Initialize(); }
 
TRestSpiderMask::TRestSpiderMask(const char* cfgFileName, std::string name) : TRestPatternMask(cfgFileName) {
    Initialize();
 
    LoadConfigFromFile(fConfigFileName, name);
 
    if (GetVerboseLevel() >= TRestStringOutput::REST_Verbose_Level::REST_Info) PrintMetadata();
}
 
TRestSpiderMask::~TRestSpiderMask() {}
 
void TRestSpiderMask::Initialize() {
    SetSectionName(this->ClassName());
    SetType("Spider");
 
    if (fArmsSeparationAngle > 0) GenerateSpider();
}
 
Int_t TRestSpiderMask::GetRegion(Double_t& x, Double_t& y) {
    if (TRestPatternMask::GetRegion(x, y)) return 0;
 
    Double_t d = TMath::Sqrt(x * x + y * y);
 
    if (fArmsSeparationAngle == 0 || d < fInitialRadius) {
        if (fInternalRegionRadius > 0 && d < fInternalRegionRadius) return 1;
 
        return 0;
    }
 
    Double_t cos_angle = y / d;
 
    if (x >= 0) {
        int region = 1;
        for (unsigned int n = 0; n < fPositiveRanges.size() - 1; n++) {
            if (cos_angle < fPositiveRanges[n].second && cos_angle > fPositiveRanges[n + 1].first)
                return region % fMaxRegions + 1;
            region++;
        }
        if (cos_angle < fPositiveRanges.back().second && cos_angle >= -1) return region % fMaxRegions + 1;
 
    } else {
        int region = fPositiveRanges.size() + 1;
 
        if (cos_angle < fNegativeRanges[0].first && cos_angle >= -1) return region % fMaxRegions + 1;
        region++;
 
        for (unsigned int n = 0; n < fNegativeRanges.size() - 1; n++) {
            if (cos_angle > fNegativeRanges[n].second && cos_angle < fNegativeRanges[n + 1].first)
                return region % fMaxRegions + 1;
            region++;
        }
    }
 
    return 0;
}
 
void TRestSpiderMask::GenerateSpider() {
    if (fArmsSeparationAngle <= 0) return;
 
    fPositiveRanges.clear();
    fNegativeRanges.clear();
 
    std::pair<Double_t, Double_t> additional_negative = {-1, -1};
 
    // The angle parameter could introduce an offset but we let finally this task to TRestPatternMask
    Double_t angle = 0;
    do {
        Double_t angle_down = angle - fArmsWidth / 2.;
        Double_t angle_up = angle + fArmsWidth / 2.;
 
        if (angle_down < 0) {
            additional_negative = {2 * TMath::Pi() + angle_down, 2 * TMath::Pi()};
            fPositiveRanges.push_back({0, angle_up});
 
        } else if (angle_up > TMath::Pi() && angle_down < TMath::Pi()) {
            fPositiveRanges.push_back({angle_down, TMath::Pi()});
            fNegativeRanges.push_back({TMath::Pi(), angle_up});
        } else if (angle_up < TMath::Pi()) {
            fPositiveRanges.push_back({angle_down, angle_up});
        } else if (angle_down >= TMath::Pi()) {
            fNegativeRanges.push_back({angle_down, angle_up});
        }
 
        angle += fArmsSeparationAngle;
 
    } while (angle + 1.e-3 < 2 * TMath::Pi());
 
    if (additional_negative.first != -1 && additional_negative.second != -1)
        fNegativeRanges.push_back(additional_negative);
 
    RESTDebug << "Printing positive spider angles" << RESTendl;
    RESTDebug << "-------------------------------" << RESTendl;
    for (unsigned int n = 0; n < fPositiveRanges.size(); n++) {
        RESTDebug << "n : " << n << " from : " << 180 * fPositiveRanges[n].first / TMath::Pi() << " to "
                  << 180 * fPositiveRanges[n].second / TMath::Pi() << RESTendl;
    }
 
    RESTDebug << "Printing negative spider angles" << RESTendl;
    RESTDebug << "-------------------------------" << RESTendl;
    for (unsigned int n = 0; n < fNegativeRanges.size(); n++) {
        RESTDebug << "n : " << n << " from : " << 180 * fNegativeRanges[n].first / TMath::Pi() << " to "
                  << 180 * fNegativeRanges[n].second / TMath::Pi() << RESTendl;
    }
 
    for (unsigned int n = 0; n < fNegativeRanges.size(); n++) {
        fNegativeRanges[n].first = TMath::Cos(fNegativeRanges[n].first);
        fNegativeRanges[n].second = TMath::Cos(fNegativeRanges[n].second);
    }
 
    for (unsigned int n = 0; n < fPositiveRanges.size(); n++) {
        fPositiveRanges[n].first = TMath::Cos(fPositiveRanges[n].first);
        fPositiveRanges[n].second = TMath::Cos(fPositiveRanges[n].second);
    }
 
    RESTDebug << "Printing positive spider angles" << RESTendl;
    RESTDebug << "-------------------------------" << RESTendl;
    for (unsigned int n = 0; n < fPositiveRanges.size(); n++) {
        RESTDebug << "n : " << n << " from : " << fPositiveRanges[n].first << " to "
                  << fPositiveRanges[n].second << RESTendl;
    }
 
    RESTDebug << "Printing negative spider cosines" << RESTendl;
    RESTDebug << "--------------------------------" << RESTendl;
    for (unsigned int n = 0; n < fNegativeRanges.size(); n++) {
        RESTDebug << "n : " << n << " from : " << fNegativeRanges[n].first << " to "
                  << fNegativeRanges[n].second << RESTendl;
    }
}
 
void TRestSpiderMask::PrintMetadata() {
    TRestPatternMask::PrintMetadata();
 
    PrintMaskMembers();
    RESTMetadata << "----" << RESTendl;
}
 
void TRestSpiderMask::PrintMask() {
    PrintCommonPatternMembers();
    RESTMetadata << "----" << RESTendl;
    PrintMaskMembers();
}
 
void TRestSpiderMask::PrintMaskMembers() {
    RESTMetadata << " - Arms separation angle : " << fArmsSeparationAngle * units("degrees") << " degrees"
                 << RESTendl;
    RESTMetadata << " - Arms angular width : " << fArmsWidth * units("degrees") << " degrees" << RESTendl;
    RESTMetadata << " - Spider start radius : " << fInitialRadius * units("cm") << " cm" << RESTendl;
    RESTMetadata << " - Internal region radius : " << fInternalRegionRadius * units("cm") << " cm"
                 << RESTendl;
 
    if (fPositiveRanges.size() > 0) {
        RESTMetadata << "-------------------------------" << RESTendl;
        for (unsigned int n = 0; n < fPositiveRanges.size(); n++) {
            RESTDebug << "n : " << n << " from : " << 180 * fPositiveRanges[n].first / TMath::Pi() << " to "
                      << 180 * fPositiveRanges[n].second / TMath::Pi() << RESTendl;
        }
 
        RESTMetadata << "Positive ranges : {";
        for (unsigned int n = 0; n < fPositiveRanges.size(); n++) {
            if (n > 0) RESTMetadata << ", ";
            RESTMetadata << "(" << fPositiveRanges[n].first << ", " << fPositiveRanges[n].second << ")";
        }
        RESTMetadata << "}" << RESTendl;
 
        RESTMetadata << "Negative ranges : {";
        for (unsigned int n = 0; n < fNegativeRanges.size(); n++) {
            if (n > 0) RESTMetadata << ", ";
            RESTMetadata << "(" << fNegativeRanges[n].first << ", " << fNegativeRanges[n].second << ")";
        }
        RESTMetadata << "}" << RESTendl;
    }
}