ConferenceLeibniz International Proceedings in Informatics, LIPIcs · July 1, 2021
Let C be a set of n axis-aligned cubes of arbitrary sizes in ℝ3. Let U be their union, and let κ be the number of vertices on ∂U; κ can vary between O(1) and O(n2). We show that U can be computed in O(n log3 n + κ) time if C is in general position. The alg ...
Full textCite
