LSST Applications
21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
|
#include <iostream>
#include <cmath>
#include <list>
#include <memory>
#include <algorithm>
#include "lsst/log/Log.h"
#include "lsst/jointcal/BaseStar.h"
#include "lsst/jointcal/StarMatch.h"
#include "lsst/jointcal/AstrometryTransform.h"
#include "lsst/jointcal/Histo2d.h"
#include "lsst/jointcal/Histo4d.h"
#include "lsst/jointcal/FastFinder.h"
#include "lsst/jointcal/ListMatch.h"
Go to the source code of this file.
Classes | |
struct | lsst::jointcal::Segment |
class | lsst::jointcal::SegmentList |
struct | lsst::jointcal::SegmentPair |
Namespaces | |
lsst | |
A base class for image defects. | |
lsst::jointcal | |
Macros | |
#define | M_PI 3.14159265358979323846 /* pi */ |
Typedefs | |
typedef std::list< Segment >::iterator | lsst::jointcal::SegmentIterator |
typedef std::list< Segment >::const_iterator | lsst::jointcal::SegmentCIterator |
typedef std::list< SegmentPair > | lsst::jointcal::SegmentPairList |
typedef SegmentPairList::iterator | lsst::jointcal::SegmentPairListIterator |
typedef SegmentPairList::const_iterator | lsst::jointcal::SegmentPairListCIterator |
using | lsst::jointcal::SolList = std::list< std::unique_ptr< StarMatchList > > |
Functions | |
std::unique_ptr< StarMatchList > | lsst::jointcal::matchSearchRotShift (BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions) |
searches a geometrical transformation that goes from list1 to list2. More... | |
std::unique_ptr< StarMatchList > | lsst::jointcal::matchSearchRotShiftFlip (BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions) |
same as above but searches also a flipped solution. More... | |
std::unique_ptr< AstrometryTransformLinear > | lsst::jointcal::listMatchupShift (const BaseStarList &list1, const BaseStarList &list2, const AstrometryTransform &transform, double maxShift, double binSize=0) |
searches for a 2 dimensional shift using a very crude histogram method. More... | |
std::unique_ptr< StarMatchList > | lsst::jointcal::listMatchCollect (const BaseStarList &list1, const BaseStarList &list2, const AstrometryTransform *guess, const double maxDist) |
assembles star matches. More... | |
std::unique_ptr< StarMatchList > | lsst::jointcal::listMatchCollect (const BaseStarList &list1, const BaseStarList &list2, const double maxDist) |
same as before except that the transform is the identity More... | |
std::unique_ptr< AstrometryTransform > | lsst::jointcal::listMatchCombinatorial (const BaseStarList &list1, const BaseStarList &list2, const MatchConditions &conditions=MatchConditions()) |
std::unique_ptr< AstrometryTransform > | lsst::jointcal::listMatchRefine (const BaseStarList &list1, const BaseStarList &list2, std::unique_ptr< AstrometryTransform > transform, const int maxOrder=3) |
#define M_PI 3.14159265358979323846 /* pi */ |
Definition at line 31 of file ListMatch.cc.