(definition)

**Definition:**
For any set ** H** of n hyperplanes in

*Note:
From Algorithms and Theory of Computation Handbook, page 20-25, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.*

Author: CRC-A

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

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

Entry modified 17 December 2004.

HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:

Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "cutting theorem", in
*Dictionary of Algorithms and Data
Structures* [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/cuttingtherm.html