Find minimum sum of Euclidean distance
سه سال پیش منتشر شده
تعداد بازدید: 355
کد پروژه: 351351
شرح پروژه
Given a set of 2D points in a file (one point per line represented by its float coordination X and Y with one space
between),
It is desired to find a point on X axis (Y=0) with minimum sum of Euclidean distance to all the given points.
Also, it is desired to find a point on X axis (Y=0) as the center of a circle with minimum radius including all the points.
Evaluation: A file containing 100 random points will be given to your program. The precision of output and time
complexity of the algorithm will determine your score.
مهارت ها و تخصص های مورد نیاز
مبلغ پروژه
165,000 تومان
مهلت برای انجام
2روز
وضعیت مناقصه
انجام شده
درباره کارفرما
عضویت چهار سال پیش
