File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Speeding up 3D Printing Using Multi-head Slicing Algorithms

TitleSpeeding up 3D Printing Using Multi-head Slicing Algorithms
Authors
Keywords3D printing
multi-head slicing
conflicting area
non-conflicting area
Issue Date2017
PublisherIEEE.
Citation
The 5th International Conference on Enterprise Systems (ES2017), Beijing, China, 22-24 September 2017 How to Cite?
AbstractThe emergence of low-cost 3D printing has catalyzed many new applications in academic, industrial, military, and medical fields. 3D printing has been dubbed a very slow process because its most common underlying printing method, Fused Deposition Modeling (FDM), is time-consuming due to the limited speed of the extruder. Multiple extruders, working simultaneously, can accelerate the printing process, but there are no extant efficient algorithms with guaranteed efficiency for solving the key challenge: how to schedule the extruders to avoid collisions during the printing operations. In this paper, we propose efficient algorithms to meet this challenge. First, we propose slicing algorithms for two extruders, which divide each slicing piece into conflicting areas and non-conflicting areas. The extruders can print the non-conflicting areas simultaneously while a conflicting area has to be printed separately by a single one. Then we extend the method to arbitrary n extruders for which we present a more practical sector based slicing algorithm. Our algorithms can achieve approximately n times efficiency when compared to the time consumed by single-extruder printers. We conduct simulations to verify the algorithms and the results show that our algorithms can significantly reduce the printing time.
Persistent Identifierhttp://hdl.handle.net/10722/245448
ISSN
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorWang, Y-
dc.contributor.authorGu, Z-
dc.contributor.authorSong, L-
dc.contributor.authorLi, T-
dc.contributor.authorCui, H-
dc.contributor.authorLau, FCM-
dc.date.accessioned2017-09-18T02:10:54Z-
dc.date.available2017-09-18T02:10:54Z-
dc.date.issued2017-
dc.identifier.citationThe 5th International Conference on Enterprise Systems (ES2017), Beijing, China, 22-24 September 2017-
dc.identifier.issn2572-6609-
dc.identifier.urihttp://hdl.handle.net/10722/245448-
dc.description.abstractThe emergence of low-cost 3D printing has catalyzed many new applications in academic, industrial, military, and medical fields. 3D printing has been dubbed a very slow process because its most common underlying printing method, Fused Deposition Modeling (FDM), is time-consuming due to the limited speed of the extruder. Multiple extruders, working simultaneously, can accelerate the printing process, but there are no extant efficient algorithms with guaranteed efficiency for solving the key challenge: how to schedule the extruders to avoid collisions during the printing operations. In this paper, we propose efficient algorithms to meet this challenge. First, we propose slicing algorithms for two extruders, which divide each slicing piece into conflicting areas and non-conflicting areas. The extruders can print the non-conflicting areas simultaneously while a conflicting area has to be printed separately by a single one. Then we extend the method to arbitrary n extruders for which we present a more practical sector based slicing algorithm. Our algorithms can achieve approximately n times efficiency when compared to the time consumed by single-extruder printers. We conduct simulations to verify the algorithms and the results show that our algorithms can significantly reduce the printing time.-
dc.languageeng-
dc.publisherIEEE.-
dc.relation.ispartofthe 5th International Conference on Enterprise Systems (ES2017)-
dc.rightsthe 5th International Conference on Enterprise Systems (ES2017). Copyright © IEEE.-
dc.rights©20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.subject3D printing-
dc.subjectmulti-head slicing-
dc.subjectconflicting area-
dc.subjectnon-conflicting area-
dc.titleSpeeding up 3D Printing Using Multi-head Slicing Algorithms-
dc.typeConference_Paper-
dc.identifier.emailWang, Y: amywang@hku.hk-
dc.identifier.emailGu, Z: zqgu@hku.hk-
dc.identifier.emailCui, H: heming@hku.hk-
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityCui, H=rp02008-
dc.identifier.authorityLau, FCM=rp00221-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ES.2017.23-
dc.identifier.scopuseid_2-s2.0-85041376662-
dc.identifier.hkuros276667-
dc.identifier.isiWOS:000434642300017-
dc.publisher.placeBeijing, China-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats