@inproceedings{8f22bc680fc9420babdf19a9167a12ed,

title = "On the klee{\textquoteright}s measure problem in small dimensions",

abstract = "The Klee{\textquoteright}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.",

author = "Chlebus, {Bogdan S.}",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/3-540-49477-4_22",

language = "English (US)",

isbn = "3540652604",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "304--311",

editor = "Branislav Rovan",

booktitle = "SOFSEM 1998",

note = "25th Conference on Theory and Practice of Informatics, SOFSEM 1998 ; Conference date: 21-11-1998 Through 27-11-1998",

}