NIST

simplex

(definition)

Definition: The simplest N-dimensional polytope. The generalization of a triangle (2D) or tetrahedron (3D).

Generalization (I am a kind of ...)
polytope.

Note: The one dimensional simplex is a line segment.

Author: PEB

More information

Eric W. Weisstein, Simplex, from MathWorld--A Wolfram Web Resource.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Mon Nov 18 10:44:10 2013.

Cite this as:
Paul E. Black, "simplex", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/simplex.html