Given a set of circles (10^8) on a plane. Require as accurately as possible to solve the following problem. For each circle calculate the summary area of pairwise intersection with each circle. Also known that each circle intersect with 5000 circles at most. I am pleased to listen to your ideas. Thanks for reading.









Автокомментарий: текст был обновлен пользователем gmoryes (предыдущая версия, новая версия, сравнить).
Автокомментарий: текст был обновлен пользователем gmoryes (предыдущая версия, новая версия, сравнить).
Is it possible read input data with size 10^8 ?
It is not important, the main requirement, that your algorithm should perform 10^12 operations at most