Szilvasi-Nagy, M.2014-10-162014-10-1619861467-8659https://doi.org/10.1111/j.1467-8659.1986.tb00298.xTwo algorithms are presented for splitting a polyhedron into convex components: one for the case of a simple polyhedron and one for a more general case, when the polyhedron may have ring-shaped faces and cavities. The time requirement in both cases is O(DNlogN), where D is the number of concave dihedral angles and N is the number of edges. The algorithm for the simple oasis produces at most D+ 1 convex pieces which is the minimal number of the convex components.10.1111/j.1467-8659.1986.tb00298.x197-201