This paper presents the implementation of the algorithms used for computing the die-open directions for a near-net-shape manufactured part, using the approach described in part one of this publication (Virtual Prototyping of Die Design - Theory and Formulation). In this approach, a set of concavity features is used to determine the die-open directions for a given part, first by determining the convex hull of the geometry, then by performing a boolean subtraction between the convex hull of the part and the 3-Dimensional solid model of the original part geometry. This will provide the set of concavity features that restrict the possible die-open directions for the part. A set of possible die-open directions is determined for each concavity feature. Subsequently, the set of directions common to all concavity features is determined to be the set of die-open directions for the part. The convex hull of a part (or a convex part) has unrestricted draw, implying that a convex part can be oriented in any fashion inside a die. The algorithms for this approach, its computational analysis, and strengths and weaknesses of the implementation are discussed in the current paper.