Virtual Prototyping of Die Design Part Two: Algorithmic,Computational,and Practical Considerations

Abstract

This paper presents the implementation of the algorithms used to compute the die-open directions for a near-net-shape manufac tured part described in "Virtual Prototyping of Die Design Part One. Theory and Formulation." In this approach, a set of concavity features is used to determine the die-open directions for a given part by first determining the convex hull of the geometry and then by performing a boolean subtraction between the convex hull of the part and the three-dimensional solid model of the original part geometry. This will pro vide the set of concavity features that restrict the possible die-open directions for the part. A set of possible die-open directions is deter mined for each concavity feature. The set of directions common to all concavity features is then determined to be the set of die-open direc tions for the part. The convex hull of a part (which is 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 this paper.