Delta DLP 3D printing with large size

We present a delta DLP 3D printer with large size in this paper. Compared with traditional DLP 3D printers that use a low-cost off-the-shelf consumer projector and a single vertical carriage, the platform of our delta DLP 3D printer can also move horizontally in the plane. We show that this structure allows the printer to have a larger printing area than the projection area of a projector. Our system can print 3D models much larger than traditional DLP 3D printers. The major challenge to realize delta 3D printing with large size comes from how to partition an arbitrary planar polygonal shape (possibly with holes or multiple disjoint polygons) into a minimum number of rectangles with fixed size, which is NP-hard. We propose a simple yet efficient approximation algorithm to solve this problem. The time complexity of our algorithm is O(n3 log n), where n is the number of edges in the polygonal shape. A physical prototype system is built and several large 3D models with complex geometric structures have been printed as examples to demonstrate the effectiveness of our approach.

[1]  G. Toussaint Solving geometric problems with the rotating calipers , 1983 .

[2]  David W. Rosen,et al.  Additive Manufacturing Technologies: Rapid Prototyping to Direct Digital Manufacturing , 2009 .

[3]  Charles Bell 3D Printing with Delta Printers , 2015, Apress.

[4]  András Hegedüs Algorithms for covering polygons by rectangles , 1982 .

[5]  Yong-Jin Liu Semi-Continuity of Skeletons in Two-Manifold and Discrete Voronoi Approximation , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  T. K. Kundra,et al.  Additive Manufacturing Technologies , 2018 .

[7]  William H. Press,et al.  Numerical recipes in C , 2002 .

[8]  Joachim Gudmundsson,et al.  Approximation Algorithms for Covering Polygons with Squares and Similar Problems , 1997, RANDOM.

[9]  Yayue Pan,et al.  Fabrication of Smooth Surfaces based on Mask Projection Stereolithography , 2011 .

[10]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[11]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[12]  Yayue Pan,et al.  Fast Recoating Methods for the Projection-based Stereolithography Process in Micro- and Macro-Scales , 2012 .

[13]  Joseph C. Culberson,et al.  Covering polygons is hard , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[15]  Martin D. Buhmann,et al.  Radial Basis Functions: Theory and Implementations: Preface , 2003 .

[16]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.