Delta DLP 3D Printing with Large Size

Chenming  Wu; Ran Yi; Yong-Jin Liu; Ying He; Charlie Wang

doi:10.1109/IROS.2016.7759338

Delta DLP 3D Printing with Large Size

Chenming Wu
, Ran Yi
, Yong-Jin Liu
, Ying He
, Charlie Wang

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

36 Citations (Scopus)

Abstract

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 xed size, which is
NP-hard. We propose a simple yet efcient 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.

Original language	English
Title of host publication	2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Publisher	IEEE
Pages	2155-2160
Number of pages	6
ISBN (Print)	978-1-5090-3762-9
DOIs	https://doi.org/10.1109/IROS.2016.7759338
Publication status	Published - 2016
Event	2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2016 - Daejeon, South Korea Duration: 9 Oct 2016 → 14 Oct 2016 http://www.iros2016.org/

Conference

Conference	2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2016
Abbreviated title	IROS 2016
Country/Territory	South Korea
City	Daejeon
Period	9/10/16 → 14/10/16
Internet address	http://www.iros2016.org/

Keywords

Printers
Solid modeling
Shape
Approximation algorithms
Liquids

Access to Document

10.1109/IROS.2016.7759338

Cite this

@inproceedings{10db871ee9924b899fa1b88f9e4c01b1,

title = "Delta DLP 3D Printing with Large Size",

abstract = "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 xed size, which is NP-hard. We propose a simple yet efcient 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.",

keywords = "Printers, Solid modeling, Shape, Approximation algorithms, Liquids",

author = "Chenming Wu and Ran Yi and Yong-Jin Liu and Ying He and Charlie Wang",

year = "2016",

doi = "10.1109/IROS.2016.7759338",

language = "English",

isbn = "978-1-5090-3762-9",

pages = "2155--2160",

booktitle = "2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)",

publisher = "IEEE",

address = "United States",

note = "2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2016, IROS 2016 ; Conference date: 09-10-2016 Through 14-10-2016",

url = "http://www.iros2016.org/",

}

TY - GEN

T1 - Delta DLP 3D Printing with Large Size

AU - Wu, Chenming

AU - Yi, Ran

AU - Liu, Yong-Jin

AU - He, Ying

AU - Wang, Charlie

PY - 2016

Y1 - 2016

N2 - 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 xed size, which is NP-hard. We propose a simple yet efcient 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.

AB - 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 xed size, which is NP-hard. We propose a simple yet efcient 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.

KW - Printers

KW - Solid modeling

KW - Shape

KW - Approximation algorithms

KW - Liquids

U2 - 10.1109/IROS.2016.7759338

DO - 10.1109/IROS.2016.7759338

M3 - Conference contribution

SN - 978-1-5090-3762-9

SP - 2155

EP - 2160

BT - 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

PB - IEEE

T2 - 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2016

Y2 - 9 October 2016 through 14 October 2016

ER -

Delta DLP 3D Printing with Large Size

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this