Trk::SeedNewtonTrkDistanceFinder Class Reference

#include <SeedNewtonTrkDistanceFinder.h>

Inheritance diagram for Trk::SeedNewtonTrkDistanceFinder:

Collaboration diagram for Trk::SeedNewtonTrkDistanceFinder:

Public Member Functions
virtual StatusCode	initialize () override
virtual StatusCode	finalize () override
	SeedNewtonTrkDistanceFinder (const std::string &t, const std::string &n, const IInterface *p)
virtual	~SeedNewtonTrkDistanceFinder ()
virtual std::optional< TwoPoints >	CalculateMinimumDistance (const Trk::Perigee &, const Trk::Perigee &) const override final
	method to do the calculation starting from two Perigees More...
virtual std::optional< TwoPoints >	CalculateMinimumDistance (const Trk::Track &, const Trk::Track &) const override final
	method to do the calculation starting from two tracks More...
virtual std::optional< TwoPoints >	CalculateMinimumDistance (const Trk::TrackParticleBase &, const Trk::TrackParticleBase &) const override final
	method to do the calculation starting from two track particles More...

Private Attributes
ToolHandle< Trk2dDistanceSeeder >	m_2ddistanceseeder
ToolHandle< NewtonTrkDistanceFinder >	m_distancefinder
std::atomic< int >	m_numberOfMinimizationFailures

Detailed Description

Algotool which calculates the distance between the two tracks, using: the distance finder you specify, which is an object of type NewtonTrkDistanceFinderAlgo, and using a starting position on the tracks given by Trk2dDistanceSeeder.

The class NewtonTrkDistanceFinderAlgo is based on a Newton minimization procedure, which finds the twodimensional point (position on first and second track) on which the derivatives of the distance is zero.

To avoid maxima the algorithm is initialized with two initial points on the two tracks, which are obtained using the Trk2dDistanceSeeder AlgoTool. This tool finds the point on minimum distance on the transverse plane, which is analitically well defined (intersection of two circles). In case of double intersection different possibilities were considered, at the end I found reasonably good to choose the intersection point where the tracks are nearest in the z coordinate...

Author

Giaci.nosp@m.nto..nosp@m.Piacq.nosp@m.uadi.nosp@m.o@phy.nosp@m.sik..nosp@m.uni-f.nosp@m.reib.nosp@m.urg.d.nosp@m.e

Definition at line 44 of file SeedNewtonTrkDistanceFinder.h.

Constructor & Destructor Documentation

SeedNewtonTrkDistanceFinder()

Trk::SeedNewtonTrkDistanceFinder::SeedNewtonTrkDistanceFinder	(	const std::string &	t,
		const std::string &	n,
		const IInterface *	p
	)

Definition at line 29 of file SeedNewtonTrkDistanceFinder.cxx.

  {   
    declareProperty("Trk2dDistanceSeeder",     m_2ddistanceseeder);
    declareProperty("TrkDistanceFinderImplementation",     m_distancefinder);
  }
 
  SeedNewtonTrkDistanceFinder::~SeedNewtonTrkDistanceFinder() = default;

~SeedNewtonTrkDistanceFinder()

Trk::SeedNewtonTrkDistanceFinder::~SeedNewtonTrkDistanceFinder ( )

virtualdefault

Member Function Documentation

CalculateMinimumDistance() [1/3]

std::optional< ITrkDistanceFinder::TwoPoints > Trk::SeedNewtonTrkDistanceFinder::CalculateMinimumDistance ( const Trk::Perigee &  a, const Trk::Perigee &  b  ) const

finaloverridevirtual

method to do the calculation starting from two Perigees

method to do the calculation starting from two MeasuredPerigees

If successful, returns the points on the two tracks at minimum distance.

return value is true if calculation is successfull

Definition at line 65 of file SeedNewtonTrkDistanceFinder.cxx.

  {
    //defragmenting the meory: local variable instead of private data member    
    std::pair<PointOnTrack,PointOnTrack> minpoints;
   
    //try first to get the minimum directly with the Newton method
    auto ret = m_distancefinder->GetClosestPoints(a,b);
    if (std::holds_alternative<TwoPoints>(ret)) {
      return std::get<TwoPoints>(ret);
    }
    ATH_MSG_DEBUG( "Problem with Newton finder: " <<
                   std::get<std::string>(ret) );
    minpoints = m_2ddistanceseeder->GetSeed(TwoTracks(a,b));
    ret = m_distancefinder->GetClosestPoints(minpoints);
    if (std::holds_alternative<TwoPoints>(ret)) {
      return std::get<TwoPoints>(ret);
    }
    ATH_MSG_DEBUG( "Problem with Newton finder, even after 2d seeder: no minimum between tracks found" << std::get<std::string>(ret));
    m_numberOfMinimizationFailures+=1;
 
    return std::nullopt;
  }
 
 

CalculateMinimumDistance() [2/3]

std::optional< ITrkDistanceFinder::TwoPoints > Trk::SeedNewtonTrkDistanceFinder::CalculateMinimumDistance ( const Trk::Track &  a, const Trk::Track &  b  ) const

finaloverridevirtual

method to do the calculation starting from two tracks

Definition at line 92 of file SeedNewtonTrkDistanceFinder.cxx.

  {
    if (std::isnan(a.perigeeParameters()->parameters()[Trk::d0])||std::isnan(b.perigeeParameters()->parameters()[Trk::d0])) {
      ATH_MSG_ERROR( "Nan parameters in tracks. Cannot use them" );
      return std::nullopt;
    }
    
    return CalculateMinimumDistance(*(a.perigeeParameters()),*(b.perigeeParameters()));
    
  }
 

CalculateMinimumDistance() [3/3]

std::optional< ITrkDistanceFinder::TwoPoints > Trk::SeedNewtonTrkDistanceFinder::CalculateMinimumDistance ( const Trk::TrackParticleBase &  a, const Trk::TrackParticleBase &  b  ) const

finaloverridevirtual

method to do the calculation starting from two track particles

Definition at line 106 of file SeedNewtonTrkDistanceFinder.cxx.

  {
    const Trk::TrackParameters& para=a.definingParameters();
    const Trk::TrackParameters& parb=b.definingParameters();
 
    const Trk::Perigee* parpera=dynamic_cast<const Trk::Perigee*>(&para);
    const Trk::Perigee* parperb=dynamic_cast<const Trk::Perigee*>(&parb);
 
    if (parpera==nullptr||parperb==nullptr) {
      ATH_MSG_WARNING( "Cannot cast to perigee. Neutral will be supported soon" );
      return std::nullopt;
    }
 
    if (std::isnan(parpera->parameters()[Trk::d0])||std::isnan(parperb->parameters()[Trk::d0])) {
      ATH_MSG_ERROR( "Nan parameters in tracks. Cannot use them" );
      return std::nullopt;
    }
    
    return CalculateMinimumDistance(*(parpera),*(parperb));
    
  }
  
} // namespace Trk

finalize()

StatusCode Trk::SeedNewtonTrkDistanceFinder::finalize ( )

overridevirtual

Definition at line 54 of file SeedNewtonTrkDistanceFinder.cxx.

                                                                       : " << m_numberOfMinimizationFailures << ". Few per events is OK!" );
    return StatusCode::SUCCESS;
  }
 
 

initialize()

StatusCode Trk::SeedNewtonTrkDistanceFinder::initialize ( )

overridevirtual

Definition at line 41 of file SeedNewtonTrkDistanceFinder.cxx.

  {

Member Data Documentation

m_2ddistanceseeder

ToolHandle<Trk2dDistanceSeeder> Trk::SeedNewtonTrkDistanceFinder::m_2ddistanceseeder

private

Definition at line 71 of file SeedNewtonTrkDistanceFinder.h.

m_distancefinder

ToolHandle<NewtonTrkDistanceFinder> Trk::SeedNewtonTrkDistanceFinder::m_distancefinder

private

Definition at line 72 of file SeedNewtonTrkDistanceFinder.h.

m_numberOfMinimizationFailures

std::atomic<int> Trk::SeedNewtonTrkDistanceFinder::m_numberOfMinimizationFailures

mutableprivate

Definition at line 73 of file SeedNewtonTrkDistanceFinder.h.

---

The documentation for this class was generated from the following files:

• SeedNewtonTrkDistanceFinder.h
• SeedNewtonTrkDistanceFinder.cxx