Two Algorithms for Decomposing a Polyhedron into Convex Parts

Simple item page
dc.contributor.authorSzilvasi-Nagy, M.en_US
dc.date.accessioned2014-10-16T14:15:12Z
dc.date.available2014-10-16T14:15:12Z
dc.date.issued1986en_US
dc.description.abstractTwo 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume5en_US
dc.identifier.doi10.1111/j.1467-8659.1986.tb00298.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages197-201en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1986.tb00298.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleTwo Algorithms for Decomposing a Polyhedron into Convex Partsen_US
Files
Collections
Issue 3