In computational geometry, Klee's measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d-dimensional rectangular range is defined to be a cartesian product of d intervals of real numbers, which is a subset of Rd.
The problem is named after Victor Klee, who gave an algorithm for computing the length of a union of intervals (the case d = 1) which was later shown to be optimally efficient in the sense of computational complexity theory. The computational complexity of computing the area of a union of 2-dimensional rectangular ranges is now also known, but the case d ≥ 3 remains an open problem.
Read more about Klee's Measure Problem: History and Algorithms, Current Status
Famous quotes containing the words measure and/or problem:
“Caprice, independence and rebellion, which are opposed to the social order, are essential to the good health of an ethnic group. We shall measure the good health of this group by the number of its delinquents. Nothing is more immobilizing than the spirit of deference.”
—Jean Dubuffet (1901–1985)
“If a problem is insoluble, it is Necessity. Leave it alone.”
—Mason Cooley (b. 1927)