an improved algorithm for computing the volume of the union of cubes
Let C be a set of n axis-aligned cubes in ? 3 , and let U ( C ) denote the union of C . We present an algorithm that computes the volume of U ( C ) in time O ( n polylog( n )). The previously best known algorithm takes O ( n 4/3 log 2 n ) time.
union of cubes geometric data structures