@inproceedings{3fc764d044864845b16a7ae3ebcb3379,

title = "New upper bounds in Klee's measure problem",

abstract = "New upper bounds are given for the measure problem of V. Klee (1977) that significantly improve the previous bounds for dimensions greater than 2. An O(nd2 log n, n) time-space upper bound to compute the measure of a set of n boxes in Euclidean d-space is obtained. The solution requires several novel ideas including application of the inclusion/exclusion principle, the concept of trellises, streaming, and a partition of d-space.",

author = "Overmars, {Mark H.} and Yap, {Chee Keng}",

year = "1988",

doi = "10.1109/sfcs.1988.21971",

language = "English (US)",

isbn = "0818608773",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "Publ by IEEE",

pages = "550--556",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}