Access Restriction

Author Agarwal, Pankaj K. ♦ Kaplan, Haim ♦ Sharir, Micha
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Axis-aligned Cube
Description 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 algorithm that can compute the volume of U(C) in time O(n 4/3 log n). The previously best known algorithm was by Overmars and Yap, which computes the volume of the union of boxes in R 3 in O(n 3/2 log n) time.
In Proc. 23rd ACM Sympos. Comput. Geom
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2007-01-01