2 #ifndef LSST_JOINTCAL_LIST_MATCH_H 3 #define LSST_JOINTCAL_LIST_MATCH_H 34 deltaSizeRatio(0.1 * sizeRatio),
35 minMatchRatio(1. / 3.),
74 const Gtransfo *guess,
const double maxDist);
79 const double maxDist);
89 std::unique_ptr<Gtransfo> transfo,
const int maxOrder = 3);
91 #ifdef DO_WE_NEED_THAT 101 #endif // LSST_JOINTCAL_LIST_MATCH_H
double maxSizeRatio() const
std::unique_ptr< Gtransfo > listMatchCombinatorial(const BaseStarList &list1, const BaseStarList &list2, const MatchConditions &conditions=MatchConditions())
std::unique_ptr< StarMatchList > matchSearchRotShift(BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions)
searches a geometrical transformation that goes from list1 to list2.
std::unique_ptr< StarMatchList > matchSearchRotShiftFlip(BaseStarList &list1, BaseStarList &list2, const MatchConditions &conditions)
same as above but searches also a flipped solution.
Class for a simple mapping implementing a generic Gtransfo.
std::unique_ptr< Gtransfo > listMatchRefine(const BaseStarList &list1, const BaseStarList &list2, std::unique_ptr< Gtransfo > transfo, const int maxOrder=3)
double minSizeRatio() const
std::unique_ptr< StarMatchList > listMatchCollect(const BaseStarList &list1, const BaseStarList &list2, const Gtransfo *guess, const double maxDist)
assembles star matches.
a virtual (interface) class for geometric transformations.
Parameters to be provided to combinatorial searches.
std::unique_ptr< GtransfoLin > listMatchupShift(const BaseStarList &list1, const BaseStarList &list2, const Gtransfo >ransfo, double maxShift, double binSize=0)
searches for a 2 dimensional shift using a very crude histogram method.