|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
29th Annual Symposium on Foundations of Computer Science (FOCS 1988)
White Plains, NY, USA
October 24-October 26
ISBN: 0-8186-0877-3
| ASCII Text | x | ||
| M.H. Overmars, Chee-Keng Yap, "New upper bounds in Klee's measure problem," Foundations of Computer Science, IEEE Annual Symposium on, pp. 550-556, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1988.21971, author = {M.H. Overmars and Chee-Keng Yap}, title = {New upper bounds in Klee's measure problem}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1988}, isbn = {0-8186-0877-3}, pages = {550-556}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21971}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - New upper bounds in Klee's measure problem SN - 0-8186-0877-3 SP550 EP556 A1 - M.H. Overmars, A1 - Chee-Keng Yap, PY - 1988 KW - partition KW - Klee measure problem KW - upper bounds KW - dimensions KW - time-space upper bound KW - Euclidean d-space KW - inclusion/exclusion principle KW - trellises KW - streaming VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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(n/sup d/2/ 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.
Index Terms:
partition, Klee measure problem, upper bounds, dimensions, time-space upper bound, Euclidean d-space, inclusion/exclusion principle, trellises, streaming
Citation:
M.H. Overmars, Chee-Keng Yap, "New upper bounds in Klee's measure problem," focs, pp.550-556, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988
Usage of this product signifies your acceptance of the Terms of Use.