LSSTApplications
16.0-10-g0ee56ad+5,16.0-11-ga33d1f2+5,16.0-12-g3ef5c14+3,16.0-12-g71e5ef5+18,16.0-12-gbdf3636+3,16.0-13-g118c103+3,16.0-13-g8f68b0a+3,16.0-15-gbf5c1cb+4,16.0-16-gfd17674+3,16.0-17-g7c01f5c+3,16.0-18-g0a50484+1,16.0-20-ga20f992+8,16.0-21-g0e05fd4+6,16.0-21-g15e2d33+4,16.0-22-g62d8060+4,16.0-22-g847a80f+4,16.0-25-gf00d9b8+1,16.0-28-g3990c221+4,16.0-3-gf928089+3,16.0-32-g88a4f23+5,16.0-34-gd7987ad+3,16.0-37-gc7333cb+2,16.0-4-g10fc685+2,16.0-4-g18f3627+26,16.0-4-g5f3a788+26,16.0-5-gaf5c3d7+4,16.0-5-gcc1f4bb+1,16.0-6-g3b92700+4,16.0-6-g4412fcd+3,16.0-6-g7235603+4,16.0-69-g2562ce1b+2,16.0-8-g14ebd58+4,16.0-8-g2df868b+1,16.0-8-g4cec79c+6,16.0-8-gadf6c7a+1,16.0-8-gfc7ad86,16.0-82-g59ec2a54a+1,16.0-9-g5400cdc+2,16.0-9-ge6233d7+5,master-g2880f2d8cf+3,v17.0.rc1
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.