Abstract
The Klee’s measure problem is to compute the volume of the union of a given set of n isothetic boxes in a d-dimensional space. The fastest currently known algorithm for this problem, developed by Overmars and Yap [6], runs in time O(nd/2 log n). We present an alternative simple approach with the same asymptotic performance. The exposition is restricted to dimensions three and four.
This work was supported by the contract KBN 8 T11C 036 14.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.L. Bentley, Algorithms for Klee’s rectangle problem, Unpublished notes, Dept. of Computer Science, CMU, 1977.
R.A. Finkel and J.L. Bentley, Quad-trees; a data structure for retrieval on composite keys, Acta Informatica 4 1974 1–9.
M.L. Fredman and B. Weide, The complexity of computing the measure of U[ai,bi], Comm. ACM 21 1978 540–544.
S. S. Iyengar, N. S. V. Rao, R. L. Kashyap, and V. K. Vaishnavi, Multidimensional data structures: Review and outlook, Advances in Computers 27 1988 69–119.
V. Klee, Can the measure of S[ai, bi] be computed in less than O(n log n) steps?, Amer. Math. Monthly 84 1977 284–285.
M.H. Overmars and C.K. Yap, New upper bounds in Klee’s measure problem, SIAM J. Comput. 20 1991 1034–1045; a preliminary version: New upper bounds in Klee’s measure problem, Proceedings, 29th Ann. Symposium on Foundations of Computer Science, 1988, pp. 550–556.
F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.
H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
J. van Leeuwen and D. Wood, The measure problem for rectangular ranges in d-space, J. Algorithms 2 1981 282–300.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S. (1998). On the Klee’s Measure Problem in Small Dimensions. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-49477-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65260-1
Online ISBN: 978-3-540-49477-5
eBook Packages: Springer Book Archive