TY - GEN

T1 - Union of convex polyhedra in three dimensions

AU - Aronov, Boris

AU - Sharir, Micha

PY - 1993

Y1 - 1993

N2 - We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.

AB - We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k3+kn log2 k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k3+kn log3 k) expected time.

UR - http://www.scopus.com/inward/record.url?scp=0027842565&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027842565&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027842565

SN - 0818643706

T3 - Annual Symposium on Foundatons of Computer Science (Proceedings)

SP - 518

EP - 527

BT - Annual Symposium on Foundatons of Computer Science (Proceedings)

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 34th Annual Symposium on Foundations of Computer Science

Y2 - 3 November 1993 through 5 November 1993

ER -