2018-04-18 21:48:24 +10:00
|
|
|
#include "tap.hpp"
|
|
|
|
|
|
|
|
#include "kmeans.hpp"
|
|
|
|
|
2018-05-12 14:28:23 +10:00
|
|
|
#include "point.hpp"
|
2018-04-18 21:48:24 +10:00
|
|
|
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
int
|
|
|
|
main ()
|
|
|
|
{
|
2018-08-05 14:42:02 +10:00
|
|
|
cruft::TAP::logger tap;
|
2018-04-18 21:48:24 +10:00
|
|
|
|
|
|
|
// create one point and check it 'converges' to this one point
|
|
|
|
{
|
2018-08-05 14:42:02 +10:00
|
|
|
const std::array<cruft::point3f,1> p { {{1,2,3}} };
|
|
|
|
std::array<cruft::point3f,1> q;
|
2018-04-18 21:48:24 +10:00
|
|
|
|
2018-08-05 14:42:02 +10:00
|
|
|
cruft::kmeans (cruft::view{p}, cruft::view{q});
|
2018-04-18 21:48:24 +10:00
|
|
|
tap.expect_eq (p, q, "single point, single k");
|
|
|
|
}
|
|
|
|
|
|
|
|
// create two vectors, check if the mean converges to their average
|
|
|
|
{
|
2018-08-05 14:42:02 +10:00
|
|
|
const std::array<cruft::vector3f,2> p {{
|
2018-04-18 21:48:24 +10:00
|
|
|
{1}, {2}
|
|
|
|
}};
|
2018-08-05 14:42:02 +10:00
|
|
|
std::array<cruft::vector3f,1> q;
|
2018-04-18 21:48:24 +10:00
|
|
|
|
2018-08-05 14:42:02 +10:00
|
|
|
cruft::kmeans (cruft::view{p}, cruft::view{q});
|
2018-04-18 21:48:24 +10:00
|
|
|
tap.expect_eq (q[0], (p[0]+p[1])/2, "two point, single k");
|
|
|
|
}
|
|
|
|
|
|
|
|
return tap.status ();
|
|
|
|
}
|