i need to implement this problem :
Given a set of points in 2-dimensional space. Initial position (xi, yi) and velocity (vxi, vyi) are known for each point Pi. Its position at the given time t can be calculated as follows:
xi(t) = xi + t*vxi
yi(t) = yi + t*vyi
Implement simplified K-Means algorithm to find K clusters. Find a first occurrence during given time interval [0, T] when a system of K clusters has a Quality Measure q that is less than given value QM.
Hi! I'm interesting your project very well. I am mastering c++ and I'm a good Mathematician. And also I have many experience and good skill about geometry algorithm development. Let's go ahead with me