Author(s)

T.S. Huang

Abstract

This paper discusses an algorithm, called three-dimensional convex hull, which is devised to determine the smallest convex polyhedron containing a concave polyhedron given by a solid model beforehand, as a solid model having the same data structure as that of the concave polyhedron, and describes its application to detect potential undercut problem in injection moulds design. Because of some disadvantages of the algorithm on detecting potential undercut, the author proposes a different method to generate the minimal contour solid and extensional solids from a computer solid model. Real undercuts are obtained through a Boolean difference operation on the mini

Keywords