Primary algorithms used in computational geometry include Convex Hull algorithms (Graham scan, Jarvis march), Triangulation methods (Delaunay triangulation), Sweep line algorithms (for intersection problems), and Spatial data structures like Quad-trees, K-d trees, and BSP trees for efficient query processing.