Interference3DLattice.cpp

Go to the documentation of this file.

//  ************************************************************************************************
//
//  BornAgain: simulate and fit reflection and scattering
//
//! @file      Sample/Aggregate/Interference3DLattice.cpp
//! @brief     Implements class Interference3DLattice.
//!
//! @homepage  http://www.bornagainproject.org
//! @license   GNU General Public License v3 or higher (see COPYING)
//! @copyright Forschungszentrum Jülich GmbH 2018
//! @authors   Scientific Computing Group at MLZ (see CITATION, AUTHORS)
//
//  ************************************************************************************************
 
#include "Sample/Aggregate/Interference3DLattice.h"
#include "Base/Util/Assert.h"
#include "Sample/Correlations/IPeakShape.h"
#include <algorithm>
#include <iostream>
 
Interference3DLattice::Interference3DLattice(const Lattice3D& lattice)
    : IInterference(0)
    , m_lattice(lattice)
    , m_peak_shape(nullptr)
    , m_rec_radius(0.0)
{
    R3 a1 = m_lattice.basisVectorA();
    R3 a2 = m_lattice.basisVectorB();
    R3 a3 = m_lattice.basisVectorC();
 
    m_rec_radius = std::max(M_PI / a1.mag(), M_PI / a2.mag());
    m_rec_radius = std::max(m_rec_radius, M_PI / a3.mag());
}
 
Interference3DLattice::~Interference3DLattice() = default;
 
Interference3DLattice* Interference3DLattice::clone() const
{
    auto* result = new Interference3DLattice(m_lattice);
    result->setPositionVariance(m_position_var);
    if (m_peak_shape)
        result->setPeakShape(*m_peak_shape);
    return result;
}
 
void Interference3DLattice::setPeakShape(const IPeakShape& peak_shape)
{
    m_peak_shape.reset(peak_shape.clone());
}
 
const Lattice3D& Interference3DLattice::lattice() const
{
    return m_lattice;
}
 
std::vector<const INode*> Interference3DLattice::nodeChildren() const
{
    return {};
}
 
double Interference3DLattice::iff_without_dw(const R3 q) const
{
    ASSERT(m_peak_shape);
    R3 center = q;
    double radius = 2.1 * m_rec_radius;
    //    double inner_radius = 0.0;
    //    if (m_peak_shape->angularDisorder()) {
    //        center = R3(0.0, 0.0, 0.0);
    //        inner_radius = std::max(0.0, q.mag() - radius);
    //        radius += q.mag();
    //    }
    const auto rec_vectors = m_lattice.reciprocalLatticeVectorsWithinRadius(center, radius);
    // std::cout << "IWD: q=" << q << ", r=" << radius << ", ir=" << inner_radius <<
    //    ", disordered=" << m_peak_shape->angularDisorder() << " => nVec=" << rec_vectors.size()
    //          << std::endl;
 
    double result = 0.0;
    for (const auto& q_rec : rec_vectors)
        //        if (!(q_rec.mag() < inner_radius)) {
        // result += m_peak_shape->evaluate(q, q_rec);
        result += exp(-(q - q_rec).mag2() / 2 / pow(.06, 2));
    // std::cout << "  INCR: qr=" << q_rec << " => " << result << std::endl;
    //        }
    return result;
}