The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi diagram for a set of points, triangulation of points in a plane or in space, and other related problems.

convex hull | Delaunay triangulation | geometric probability | geometric span | happy end problem | Minkowski sum | nearest neighbor problem | polygon tessellation | polyhedron packing | Sylvester's four-point problem | triangulation | vertex enumeration | Voronoi diagram