Geometry Algorithm Library Skill Purpose Implement computational geometry algorithms for competitive programming and algorithmic problems. Capabilities - Convex hull (Graham scan, Andrew's monotone chain) - Line intersection algorithms - Closest pair of points - Point in polygon tests - Voronoi diagram, Delaunay triangulation - Polygon clipping Target Processes - computational-geometry Algorithm Catalog Convex Hull - Graham scan O(n log n) - Andrew's monotone chain O(n log n) - Jarvis march O(nh) Intersection Algorithms - Line sweep for segment intersection - Bentley-Ottmann algorithm - Polyg…