Interesting problem about convex hulls

Revision en2, by P_Nyagolov, 2018-05-07 11:03:58

Hello everybody,

Recently, while exploring vjudge, I came across this problem and I have no idea how to solve it.

Basically, we are given N points (N ≤ 1000), no three points lie on the same line, and we are to find the sum of areas of the convex hulls for each subset of at least 3 points. There are multiple test cases and the sum of the N values over all test cases is up to 5000.

Can anybody share some ideas about this problem, please?

Tags convex hull, geometry


  Rev. Lang. By When Δ Comment
en2 English P_Nyagolov 2018-05-07 11:03:58 39
en1 English P_Nyagolov 2018-05-07 10:57:24 530 Initial revision (published)