LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
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 | |
namespace | lsst |
A base class for image defects. | |
namespace | lsst::jointcal |
Macros | |
#define | M_PI 3.14159265358979323846 /* pi */ |
Typedefs | |
using | lsst::jointcal::SegmentIterator = std::list< Segment >::iterator |
using | lsst::jointcal::SegmentCIterator = std::list< Segment >::const_iterator |
using | lsst::jointcal::SegmentPairList = std::list< SegmentPair > |
using | lsst::jointcal::SegmentPairListIterator = SegmentPairList::iterator |
using | lsst::jointcal::SegmentPairListCIterator = SegmentPairList::const_iterator |
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, double maxDist) |
assembles star matches. More... | |
std::unique_ptr< StarMatchList > | lsst::jointcal::listMatchCollect (const BaseStarList &list1, const BaseStarList &list2, 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, int maxOrder=3) |
#define M_PI 3.14159265358979323846 /* pi */ |
Definition at line 31 of file ListMatch.cc.