On the klee’s measure problem in small dimensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1521, Issue , 1998, Pages 304-311

  Chlebus, Bogdan S ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTIC PERFORMANCE; D-DIMENSIONAL SPACES; SIMPLE APPROACH;

INFORMATION SCIENCE;

EID: 84957616512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49477-4_22     Document Type: Conference Paper

References (9)

1. J.L. Bentley, Algorithms for Klee's rectangle problem, Unpublished notes, Dept. of Computer Science, CMU, 1977.
2. R.A. Finkel and J.L. Bentley, Quad-trees; a data structure for retrieval on composite keys, Acta Informatica 4 (1974) 1-9.
3. M.L. Fredman and B. Weide, The complexity of computing the measure of Ul®, Comm. ACM 21 (1978) 540-544.
4. 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.
5. V. Klee, Can the measure of IJ[αi,òi] be computed in less than O(n log n) steps?, Amer. Math. Monthly 84 (1977) 284-285.
6. 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.
7. F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.
8. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
9. J. van Leeuwen and D. Wood, The measure problem for rectangular ranges in d-space, J. Algorithms 2 (1981) 282-300.