Mercurial Hosting > traffic-intelligence
diff trajectorymanagement/src/ChebyshevMetric.h @ 1159:e1e7acef8eab
moved trajectory management library into Traffic Intelligence
author | Nicolas Saunier <nicolas.saunier@polymtl.ca> |
---|---|
date | Mon, 22 Feb 2021 22:09:35 -0500 |
parents | |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/trajectorymanagement/src/ChebyshevMetric.h Mon Feb 22 22:09:35 2021 -0500 @@ -0,0 +1,60 @@ +#ifndef CHEBYSHEVMETRIC_H_ +#define CHEBYSHEVMETRIC_H_ + +#include "Metric.h" + +#include "TrajectoryExceptions.h" + +/** + * ChebyshevMetric class. + * + * The Chebyshev metric measures the similarity between two trajectories. + * This metric represents the largest distance of all points in every dimension. Expressed in meters. + */ +template<typename Tr, typename To> +class ChebyshevMetric: public Metric<Tr, To> +{ +public: + /** + * Compute distance between two trajectories. + * + * @param[in] a input trajectory + * @param[in] b input trajectory + * @param[out] result distance between two trajectories + */ + void distance(const Trajectory<Tr> *a, const Trajectory<Tr> *b, To &result, unsigned int nbOfPoints = std::numeric_limits<unsigned int>::max()) + { + result = To(0); + + if (nbOfPoints == std::numeric_limits<unsigned int>::max()) + checkTrajectoryLength(a->size(), b->size()); + + To diff = abs((a->getPoint(0) - b->getPoint(0)).x); + for (unsigned int i = 0; i < a->size() and i < nbOfPoints ; ++i) + { + cv::Point3_<typeof(static_cast<Tr>(a->getPoint(i)).x)> p(a->getPoint(i) - b->getPoint(i)); + diff = std::max(diff, abs(p.x)); + diff = std::max(diff, abs(p.y)); + diff = std::max(diff, abs(p.z)); + } + + result = diff; + } + +private: + /** + * Check the length of the trajectories. + * + * @param[in] a the size of the trajectory + * @param[in] b the size of the trajectory + */ + void checkTrajectoryLength(size_t a, size_t b) const + { + if (a != b || a == 0) + { + throw TrajectoryLengthErrorException(); + } + } +}; + +#endif /* CHEBYSHEVMETRIC_H_ */