@inproceedings{c0560eba831c4fc5a9e4bcda9ccb5002,

title = "Computing the volume of the union of cubes",

abstract = "Let C be a set of n axis-aligned cubes in R 3, and let U(C) denote the union of C. We present an algorithmthat can compute the volume of U(C) in time O(n 4/3 log n). The previously best known algorithm, by Overmars and Yap, computes the volume of the union ofany n axis-aligned boxes in R 3 in O(n 3/2log n) time.",

keywords = "Arrangements, Union of objects",

author = "Agarwal, {Pankaj K.} and Haim Kaplan and Micha Sharir",

year = "2007",

doi = "10.1145/1247069.1247121",

language = "אנגלית",

isbn = "1595937056",

series = "Proceedings of the Annual Symposium on Computational Geometry",

pages = "294--301",

booktitle = "Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07",

note = "null ; Conference date: 06-06-2007 Through 08-06-2007",

}