31 #ifndef SHARK_ALGORITHMS_DIRECTSEARCH_HYPERVOLUMECALCULATOR_H 32 #define SHARK_ALGORITHMS_DIRECTSEARCH_HYPERVOLUMECALCULATOR_H 57 return m_approximationAlgorithm.
epsilon();
60 return m_approximationAlgorithm.
epsilon();
64 return m_approximationAlgorithm.
delta();
68 return m_approximationAlgorithm.
delta();
71 template<
typename Archive>
72 void serialize( Archive & archive,
const unsigned int version ) {
73 archive & BOOST_SERIALIZATION_NVP(m_useApproximation);
74 archive & BOOST_SERIALIZATION_NVP(m_approximationAlgorithm);
80 template<
typename Po
ints,
typename VectorType>
82 if(points.size() == 0)
return 0;
83 SIZE_CHECK( points.begin()->size() == refPoint.size() );
84 std::size_t numObjectives = refPoint.size();
85 if(numObjectives == 2){
87 return algorithm(points, refPoint);
88 }
else if(numObjectives == 3){
90 return algorithm(points, refPoint);
91 }
else if(numObjectives == 4){
93 return algorithm(points, refPoint);
94 }
if(m_useApproximation){
95 return m_approximationAlgorithm(points, refPoint);
98 return algorithm(points, refPoint);
103 bool m_useApproximation;