LSSTApplications
16.0-11-g09ed895+2,16.0-11-g12e47bd,16.0-11-g9bb73b2+6,16.0-12-g5c924a4+6,16.0-14-g9a974b3+1,16.0-15-g1417920+1,16.0-15-gdd5ca33+1,16.0-16-gf0259e2,16.0-17-g31abd91+7,16.0-17-g7d7456e+7,16.0-17-ga3d2e9f+13,16.0-18-ga4d4bcb+1,16.0-18-gd06566c+1,16.0-2-g0febb12+21,16.0-2-g9d5294e+69,16.0-2-ga8830df+6,16.0-20-g21842373+7,16.0-24-g3eae5ec,16.0-28-gfc9ea6c+4,16.0-29-ge8801f9,16.0-3-ge00e371+34,16.0-4-g18f3627+13,16.0-4-g5f3a788+20,16.0-4-ga3eb747+10,16.0-4-gabf74b7+29,16.0-4-gb13d127+6,16.0-49-g42e581f7+6,16.0-5-g27fb78a+7,16.0-5-g6a53317+34,16.0-5-gb3f8a4b+87,16.0-6-g9321be7+4,16.0-6-gcbc7b31+42,16.0-6-gf49912c+29,16.0-7-gd2eeba5+51,16.0-71-ge89f8615e,16.0-8-g21fd5fe+29,16.0-8-g3a9f023+20,16.0-8-g4734f7a+1,16.0-8-g5858431+3,16.0-9-gf5c1f43+8,master-gd73dc1d098+1,w.2019.01
LSSTDataManagementBasePackage
|
#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.