Beschreibung:
<jats:p>
A shape is pyramidal if it has a flat base with the remaining boundary forming a height function over the base. Pyramidal shapes are optimal for molding, casting, and layered 3D printing. However, many common objects are not pyramidal. We introduce an algorithm for
<jats:italic>approximate pyramidal shape decomposition</jats:italic>
. The general exact pyramidal decomposition problem is NP-hard. We turn this problem into an NP-complete problem which admits a practical solution. Specifically, we link pyramidal decomposition to the
<jats:italic>Exact Cover Problem</jats:italic>
(ECP). Given an input shape
<jats:italic>S</jats:italic>
, we develop clustering schemes to derive a set of building blocks for approximate pyramidal parts of
<jats:italic>S</jats:italic>
. The building blocks are then combined to yield a set of candidate pyramidal parts. Finally, we employ Knuth's Algorithm X over the candidate parts to obtain solutions to ECP as pyramidal shape decompositions. Our solution is equally applicable to 2D or 3D shapes, and to shapes with polygonal or smooth boundaries, with or without holes. We demonstrate our algorithm on numerous shapes and evaluate its performance.
</jats:p>