Current Status
The only known lower bound for any d is . The Overmars–Yap algorithm provides an upper bound of, so for d ≥ 3, it remains an open question whether faster algorithms are possible, or alternatively whether tighter lower bounds can be proven. In particular, it remains open whether the algorithm's running time must depend on d. In addition, the question of whether there are faster algorithms that can deal with special cases (for example, when the input coordinates are integers within a bounded range) remains open.
Read more about this topic: Klee's Measure Problem
Famous quotes containing the words current and/or status:
“Without the Empire we should be tossed like a cork in the cross current of world politics. It is at once our sword and our shield.”
—William Morris Hughes (1864–1952)
“As a work of art it has the same status as a long conversation between two not very bright drunks.”
—Clive James (b. 1939)