Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/68780
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | - |
dc.creator | Fok, KY | - |
dc.creator | Cheng, CT | - |
dc.creator | Tse, CK | - |
dc.date.accessioned | 2017-10-04T03:39:29Z | - |
dc.date.available | 2017-10-04T03:39:29Z | - |
dc.identifier.isbn | 978-1-4673-6853-7 (electronic) | en_US |
dc.identifier.isbn | 978-1-5090-1427-9 (Print on Demand(PoD)) | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/68780 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2017 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. | en_US |
dc.rights | The following publication K. Y. Fok, C. T. Cheng and C. K. Tse, "A refinement process for nozzle path planning in 3D printing," 2017 IEEE International Symposium on Circuits and Systems (ISCAS), Baltimore, MD, USA, 2017, pp. 1-4 is available at http://dx.doi.org/10.1109/ISCAS.2017.8050471 | en_US |
dc.subject | Additive manufacturing | en_US |
dc.subject | 3D printing | en_US |
dc.subject | URPP | en_US |
dc.subject | Optimization | en_US |
dc.title | A refinement process for nozzle path planning in 3D printing | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.spage | 1 | en_US |
dc.identifier.epage | 4 | en_US |
dc.identifier.doi | 10.1109/ISCAS.2017.8050471 | - |
dcterms.abstract | A refinement process for nozzle path planning in 3D printing is presented in this paper. The nozzle path planning problem is formulated as an undirected rural postman problem (URPP). Based on the unique characteristics of URPP in 3D printing applications, a new refinement process is proposed to shorten the processing time of a conventional URPP solver. Performances of the proposed refinement process is evaluated using computer simulations. Simulation results show that when comparing with other URPP solvers, solvers with the proposed process have shorter processing time and can provide solutions with shorter transition length. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | 2017 IEEE International Symposium on Circuits and Systems (ISCAS’2017), Baltimore, MD, USA, 28-31 May 2017, p. 1-4 | - |
dcterms.issued | 2017 | - |
dc.identifier.ros | 2016005623 | - |
dc.relation.conference | IEEE International Symposium on Circuits and Systems [ISCAS] | en_US |
dc.identifier.rosgroupid | 2016005372 | - |
dc.description.ros | 2016-2017 > Academic research: refereed > Refereed conference paper | - |
dc.description.validate | 201803_a bcwh | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0124-n03 | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Conference Paper |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PID4688487.pdf | Pre-Published version | 609.91 kB | Adobe PDF | View/Open |
Page views
260
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
394
Citations as of Mar 24, 2024
SCOPUSTM
Citations
7
Last Week
0
0
Last month
Citations as of Mar 29, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.