Definition: A corner point of a polyhedron. More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.
Note: From Algorithms and Theory of Computation Handbook, pages 19-26 and 32-39, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue Feb 12 10:57:42 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "extreme point", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/extremepoint.html