Filling Polyhedral Molds

Abstract In manufacturing industry, finding an orientation for a mold that eliminates surface defects and ensures a complete fill after termination of the gravity casting process is an important and difficult problem. We study the problem of determining a favorable position of a mold (modeled as a polyhedron) such that, when it is filled, no air pockets and ensuing surface defects arise. Given a polyhedron in a fixed orientation, we present a linear time algorithm that determines whether the mold can be filled from that orientation without forming air pockets. We also present an algorithm that determines the most favorable orientation for a polyhedral mold in O(n2) time. A reduction from a well-known problem indicates that improving the O(n2) bound is unlikely for general polyhedral molds. We relate fillability to some well known classes of polyhedra. For some of these classes of objects, an optimal direction of fillability can be determined in linear time. Finally, for molds that satisfy a local regularity condition, we give an improved algorithm that runs in time O(nk log 2 n log log ( n k )) , where k is the number of venting holes needed to avoid air pockets in an optimal orientation.

[1]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[2]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[4]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[5]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[6]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

[7]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[8]  Wayne I. Pribble,et al.  Plastics Mold Engineering Handbook , 1987 .

[9]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[10]  Norbert M. Bikales.  Molding of plastics , 1971 .

[11]  Harry G. Mairson,et al.  Reporting and Counting Intersections Between Two Sets of Line Segments , 1988 .

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  Prosenjit Bose,et al.  Filling Polyhedral Molds , 1993, WADS.

[14]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[15]  Prosenjit Bose,et al.  Geometric and computational aspects of gravity casting , 1995, Comput. Aided Des..

[16]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[17]  Eric L. Buckleitner,et al.  Molds for Reaction Injection, Structural Foam and Expandable Styrene Molding , 1987 .

[18]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[19]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[20]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[21]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[22]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

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

[24]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[25]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[26]  Micha Sharir,et al.  Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..

[27]  Godfried T. Toussaint,et al.  Geometric and computational aspects of manufacturing processes , 1996, Comput. Graph..