Heuristics for estimating contact area of supports in layered manufacturing

Layered manufacturing is a technology that allows physical prototypes of three-dimensional(3D) models to be built directly from their digital representation, as a stack of two-dimensional(2D) layers. A key design problem here is the choice of a suitable direction in which the digital model should be oriented and built so as to minimize the area of contact between the prototype and temporary support structures that are generated during the build. Devising an efficient algorithm for computing such a direction has remained a difficult problem for quite some time. In this paper, a suite of efficient and practical heuristics is presented for estimating the minimum contact area. Also given is a technique for evaluating the quality of the estimate provided by any heuristic, which does not require knowledge of the (unknown and hard-to-compute) optimal solution; instead, it provides an indirect upper bound on the quality of the estimate via two relatively easy-to-compute quantities. The algorithms are based on various techniques from computational geometry, such as ray-shooting, convex hulls, boolean operations on polygons, and spherical arrangements, and have been implemented and tested. Experimental results on a wide range of real-world models show that the heuristics perform quite well in practice.

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

[2]  Pankaj K. Agarwal,et al.  Approximation algorithms for layered manufacturing , 2000, SODA '00.

[3]  Dan Halperin,et al.  Improved construction of vertical decompositions of three-dimensional arrangements , 2002, SCG '02.

[4]  Ravi Janardan,et al.  Geometric methods in computer-aided design and manufacturing , 1998 .

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

[6]  Michiel H. M. Smid,et al.  Minimizing support structures and trapped area in two-dimensional layered manufacturing , 1999, Comput. Geom..

[7]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

[8]  Michiel H. M. Smid,et al.  Protecting critical facets in layered manufacturing , 2000, Comput. Geom..

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

[10]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

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

[12]  K. Leong,et al.  Rapid Prototyping: Principles and Applications (with Companion CD-ROM) , 2003 .

[13]  Rafiq Noorani,et al.  Rapid prototyping : principles and applications , 2006 .

[14]  Paul F. Jacobs,et al.  Rapid Prototyping & Manufacturing: Fundamentals of Stereolithography , 1992 .

[15]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[16]  Sara McMains,et al.  A coherent sweep plane slicer for layered manufacturing , 1999, SMA '99.

[17]  Prosenjit Bose,et al.  Feasibility of Design in Stereolithography , 1997, Algorithmica.

[18]  Michiel H. M. Smid,et al.  On some geometric optimization problems in layered manufacturing , 1997, Comput. Geom..

[19]  Jörg Schwerdt.  Entwurf von Optimierungsalgorithmen für geometrische Probleme im Bereich Rapid Prototyping und Manufacturing , 2001 .