salda / convex_hull_of_intersections Goto Github PK
View Code? Open in Web Editor NEWC++ program that calculates the intersections of a set of line segments and circles. From these intersection points, calculates the convex hull and its area. The program reads from the standard input and write to the standard output. The algorithm for the calculation of the convex hull is fastest in the world.