The study of algorithms for combinatorial,
topological, and metric problems concerning sets of points,
typically in
Euclidean space. Representative areas of
research include geometric search, convexity, proximity,
intersection, and
linear programming.