Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...

ContourPlot3D[f, {x, x_min, x_max}, {y, y_min, y_max}, {z, z_min, z_max}] produces a three-dimensional contour plot of f as a function of x, y, and z. ContourPlot3D[f == g, ...

EulerianCycle[g] finds an Eulerian cycle of g if one exists.

FindCycle[g] finds a list of vertices that define a cycle in graph g.

HamiltonianPath[g] finds a Hamiltonian path in graph g if one exists. HamiltonianPath[g, All] gives all Hamiltonian paths of graph g.

LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.

MaximumClique[g] finds a largest clique in graph g. MaximumClique[g, k] returns a k-clique, if such a thing exists in g; otherwise it returns {}.

MaximumIndependentSet[g] finds a largest independent set of graph g.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

StableMarriage[mpref, fpref] finds the male optimal stable marriage defined by lists of permutations describing male and female preferences.