_adapter | opengv::sac_problems::relative_pose::EigensolverSacProblem | protected |
_sampleSize | opengv::sac_problems::relative_pose::EigensolverSacProblem | protected |
adapter_t typedef | opengv::sac_problems::relative_pose::EigensolverSacProblem | |
computeModelCoefficients(const std::vector< int > &indices, model_t &outModel) const | opengv::sac_problems::relative_pose::EigensolverSacProblem | virtual |
countWithinDistance(const model_t &model_coefficients, const double threshold) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |
drawIndexSample(std::vector< int > &sample) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
EigensolverSacProblem(adapter_t &adapter, size_t sampleSize, bool randomSeed=true) | opengv::sac_problems::relative_pose::EigensolverSacProblem | inline |
EigensolverSacProblem(adapter_t &adapter, size_t sampleSize, const std::vector< int > &indices, bool randomSeed=true) | opengv::sac_problems::relative_pose::EigensolverSacProblem | inline |
getDistancesToModel(const model_t &model_coefficients, std::vector< double > &distances) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |
getIndices() const | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
getSamples(int &iterations, std::vector< int > &samples) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |
getSampleSize() const | opengv::sac_problems::relative_pose::EigensolverSacProblem | virtual |
getSelectedDistancesToModel(const model_t &model, const std::vector< int > &indices, std::vector< double > &scores) const | opengv::sac_problems::relative_pose::EigensolverSacProblem | virtual |
indices_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
isSampleGood(const std::vector< int > &sample) const | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |
max_sample_checks_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
model_t typedef | opengv::sac_problems::relative_pose::EigensolverSacProblem | |
optimizeModelCoefficients(const std::vector< int > &inliers, const model_t &model, model_t &optimized_model) | opengv::sac_problems::relative_pose::EigensolverSacProblem | virtual |
rnd() | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
rng_alg_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
rng_dist_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
rng_gen_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
SampleConsensusProblem(bool randomSeed=true) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
selectWithinDistance(const model_t &model_coefficients, const double threshold, std::vector< int > &inliers) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |
setIndices(const std::vector< int > &indices) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
setUniformIndices(int N) | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
shuffled_indices_ | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | |
~EigensolverSacProblem() | opengv::sac_problems::relative_pose::EigensolverSacProblem | inlinevirtual |
~SampleConsensusProblem() | opengv::sac::SampleConsensusProblem< eigensolverOutput_t > | virtual |