<mathematics> 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.
Last updated: 1997-08-03
Try this search on Wikipedia, OneLook, Google
Nearby terms: Computational Adequacy Theorem « computational complexity « Computational Fluid Dynamics « computational geometry » computational learning » computational molecular biology » COMpute ParallEL