1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1108/13552540210413284
DC FieldValue
dc.titleEquidistant path generation for improving scanning efficiency in layered manufacturing
dc.contributor.authorYang, Y.
dc.contributor.authorLoh, H.T.
dc.contributor.authorFuh, J.Y.H.
dc.contributor.authorWang, Y.G.
dc.date.accessioned2014-06-17T06:20:26Z
dc.date.available2014-06-17T06:20:26Z
dc.date.issued2002
dc.identifier.citationYang, Y., Loh, H.T., Fuh, J.Y.H., Wang, Y.G. (2002). Equidistant path generation for improving scanning efficiency in layered manufacturing. Rapid Prototyping Journal 8 (1) : 30-37. ScholarBank@NUS Repository. https://doi.org/10.1108/13552540210413284
dc.identifier.issn13552546
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/60203
dc.description.abstractPath generation is an important factor that affects the quality and efficiency of most laminated manufacturing processes such as SLS, SLA and FDM. This paper introduces an efficient path generation algorithm. The principle of the algorithm and its implementation are presented. A comparative study is used to analyze the effectiveness of this method. The results of comparison on both path length and processing time between the traditional method and the proposed method are discussed.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1108/13552540210413284
dc.sourceScopus
dc.subjectAlgorithms
dc.subjectRapid prototyping
dc.subjectScanning
dc.typeArticle
dc.contributor.departmentMECHANICAL ENGINEERING
dc.description.doi10.1108/13552540210413284
dc.description.sourcetitleRapid Prototyping Journal
dc.description.volume8
dc.description.issue1
dc.description.page30-37
dc.description.codenRPJOF
dc.identifier.isiut000175693200003
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.