Definition: For any set H of n hyperplanes in ℜk, and any parameter r, 1 ≤ r≤ n, there always exists a (1/r)-cutting of size O(rk). In two dimensions, a (1/r)-cutting of size s is a partition of the plane into s disjoint triangles, some of which are unbounded, such that no triangle in the partition intersects more than n/r lines in H. In ℜk, triangles are replaced by simplices. Such a cutting can be computed in O(nrk-1) time.
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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
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. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/cuttingtherm.html