Finding feasible mold parting directions using graphics hardware

We present new programmable graphics hardware accelerated algorithms to test the 2-moldability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts as well as minimum and insufficient draft angles. Their running times grow only linearly with respect to the number of facets in the solid model, making them efficient subroutines for our algorithms that test whether a tessellated CAD model can be manufactured in a two-part mold. We have developed and implemented two such algorithms to choose candidate directions to test for 2-moldability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in the fact that they identify groups of candidate directions such that if any one direction in the group is undercut-free, all are, or if any one is not undercut-free, none are. We examine trade-offs between the algorithms' speed, accuracy, and whether they guarantee that an undercut-free direction will be found for a part if one exists.

[1]  Satyandra K. Gupta,et al.  Geometric algorithms for automated design of multi-piece permanent molds , 2004, Comput. Aided Des..

[2]  David Salesin,et al.  Rendering antialiased shadows with depth maps , 1987, SIGGRAPH.

[3]  Rajit Gadh,et al.  Virtual Prototyping of Die Design Part Two: Algorithmic, Computational, and Practical Considerations , 1997 .

[4]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[5]  Shuo-Yan Chou,et al.  Parting directions for mould and die design , 1993, Comput. Aided Des..

[6]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[7]  Kim Seng Lee,et al.  A hybrid method for recognition of undercut features from moulded parts , 2001, Comput. Aided Des..

[8]  B. Ravi,et al.  Decision criteria for computer-aided parting surface design , 1990, Comput. Aided Des..

[9]  鄺建華.  Computer-aided parting line and parting surface generation in mould design , 1992 .

[10]  Dinesh Manocha,et al.  Collision queries using oriented bounding boxes , 2000 .

[11]  Sanjay E. Sarma,et al.  Generating 5-axis NC roughing paths directly from a tessellated representation , 2000, Comput. Aided Des..

[12]  W. S. Sze,et al.  Parting line formation by slicing a 3D CAD model , 2005, Engineering with Computers.

[13]  Zhou-Ping Yin,et al.  Virtual prototyping of mold design: geometric mouldability analysis for near-net-shape manufactured parts by feature recognition and geometric reasoning , 2001, Comput. Aided Des..

[14]  Aristides A. G. Requicha,et al.  Accessibility analysis for planning of dimensional inspection with coordinate measuring machines , 1999, IEEE Trans. Robotics Autom..

[15]  Michael T. Goodrich,et al.  Efficient perspective-accurate silhouette computation and applications , 2001, SCG '01.

[16]  E. Groller,et al.  Real time simulation and visualization of NC milling processes for inhomogeneous materials on low-end graphics hardware , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[17]  Lance Williams,et al.  Casting curved shadows on curved surfaces , 1978, SIGGRAPH.

[18]  Gershon Elber,et al.  Mold Accessibility via Gauss Map Analysis , 2005, J. Comput. Inf. Sci. Eng..

[19]  Takafumi Saito,et al.  NC machining with G-buffer method , 1991, SIGGRAPH.

[20]  T. C. Woo,et al.  Spherical Maps: Their Construction, Properties, and Approximation , 1994 .

[21]  Hassan Masum,et al.  Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf , 2000, SIGA.

[22]  Ralph R. Martin,et al.  Two-dimensional visibility charts for continuous curves , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).

[23]  M. Inui,et al.  Fast visualization of NC milling result using graphics acceleration hardware , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[24]  Jens H. Krüger,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007, Eurographics.

[25]  Jun Huang,et al.  A Feature-Based Approach to Automated Design of Multi-Piece Sacrificial Molds , 2001, J. Comput. Inf. Sci. Eng..

[26]  John Fitch,et al.  Course notes , 1975, SIGS.

[27]  K. C. Hui,et al.  Mould design with sweep operations - a heuristic search approach , 1992, Comput. Aided Des..

[28]  Randima Fernando,et al.  GPU Gems: Programming Techniques, Tips and Tricks for Real-Time Graphics , 2004 .

[29]  Dinesh Manocha,et al.  Fast penetration depth computation for physically-based animation , 2002, SCA '02.

[30]  David Rappaport,et al.  Moldable and Castable Polygons , 1994, Comput. Geom..

[31]  John F. Hughes,et al.  Hardware-determined feature edges , 2004, NPAR '04.

[32]  Fritz B. Prinz,et al.  Rapid prototyping and manufacturing by gelcasting of metallic and ceramic slurries , 2002 .

[33]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[34]  Jirí Matousek,et al.  Separating an object from its cast , 2002, Comput. Aided Des..

[35]  Rajit Gadh,et al.  Virtual Prototyping of Die Design Part One: Theory and Formulation , 1997 .

[36]  Yonghua Chen,et al.  Determining parting direction based on minimum bounding box and fuzzy logics , 1997 .

[37]  Shuo-Yan Chou,et al.  Partial visibility for selecting a parting direction in mold and die design , 1995 .

[38]  Andrew Y. C. Nee,et al.  Undercut feature recognition in an injection mould design system , 1999, Comput. Aided Des..

[39]  Masatomo Inui,et al.  Fast inverse offset computation using polygon rendering hardware , 2003, Comput. Aided Des..

[40]  Yong Chen,et al.  Computer-aided design for rapid tooling :methods for mold design and design-for-manufacture , 2001 .

[41]  Andrew Y. C. Nee,et al.  Generation of optimal parting direction based on undercut features in injection molded parts , 1999 .

[42]  Dan Halperin,et al.  Exact minkowski sums of convex polyhedra , 2005, SCG.

[43]  Jun Huang,et al.  Algorithms for Computing Global Accessibility Cones , 2003, J. Comput. Inf. Sci. Eng..

[44]  Tony C. Woo,et al.  Visibility maps and spherical algorithms , 1994, Comput. Aided Des..

[45]  Tom Davis,et al.  Opengl programming guide: the official guide to learning opengl , 1993 .

[46]  Yong Chen,et al.  A Reverse Glue Approach to Automated Construction of Multi-Piece Molds , 2003 .