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:
“We hear the haunting presentiment of a dutiful middle age in the current reluctance of young people to select any option except the one they feel will impinge upon them the least.”
—Gail Sheehy (b. 1937)
“A genuine Left doesn’t consider anyone’s suffering irrelevant or titillating; nor does it function as a microcosm of capitalist economy, with men competing for power and status at the top, and women doing all the work at the bottom.... Goodbye to all that.”
—Robin Morgan (b. 1941)