Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1328
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Silve, S | - |
dc.coverage.spatial | 18 | en |
dc.date.accessioned | 2007-11-21T09:58:52Z | - |
dc.date.available | 2007-11-21T09:58:52Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Journal of Digital Creativity, 17(2): 100 -112 | en |
dc.identifier.issn | 1462-6268 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1328 | - |
dc.description.abstract | Laser forming is a process in which metal is shaped by thermally induced stresses, and there are three bending mechanisms. The technique involves locally heating the work piece by traversing it under a laser beam. Positioning tables with a minimum of x and y axes are used as the means of moving the metal. Control of the laser path is via the table movement and requires programs written in G-Code machine language. This can present problems for the designer but complimented by todayĆ¢ s modern computing methods, there can be some relief from arduous number crunching and it can be possible that old programming language, comparatively new software and an understanding of three-dimensional space, thermodynamics and design, can be combined for creating designed objects. | en |
dc.format.extent | 4792810 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Routledge, Taylor and Francis Group | en |
dc.relation.ispartof | 17;2 | - |
dc.subject | Laser forming | en |
dc.subject | G-Code | - |
dc.subject | Designed objects | - |
dc.title | A synthesis of programming techniques for laser forming | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1080/14626260600787696 | - |
Appears in Collections: | Design Brunel Design School Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Embargoed Paper - S Silve.txt | 815 B | Text | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.