This document discusses algorithms and geometry. It covers the Postech Computer Algorithm Team and convex hulls. The Postech team works on algorithms and geometry problems. Convex hull concepts are explained, including finding the farthest point and defining a convex polygon. Formulas for computing areas and determining if a point is inside a convex shape are provided.