|
||||||||||
Convex HullTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 291 Accepted Submission(s): 43 Problem Description There are n points in three dimensional space. Consider the convex hull of n points. Given a plane, you should work out the area of section of convex hull by the plane. Input First line contains T(T <= 10), a number of test cases. For each test case, there are two integer n and m, number of points and number of queries. Next n lines contains three integers x, y, z, coordinate of point. Next m lines contains four integers a, b, c, d, specifying the equation of plane: ax + by + cz + d = 0. 1 <= n <= 1000 1 <= q <= 1000 Absolute values of x, y, z, a, b, c and d are not greater than 2000. Output For each test case, first line contains “Case #x:”, x is the number of the case. For each query, you should print one float number in three decimal places in one line. Sample Input
Sample Output
Author 金策工业综合大学(DPRK) Source | ||||||||||
|