You are here: irt.org | FOLDOC | computational geometry

<*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.

(1997-08-03)

Nearby terms: Computational Adequacy Theorem « computational complexity « Computational Fluid Dynamics « **computational geometry** » computational learning » computational molecular biology » COMpute ParallEL

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL