Abstract
Algorithms are given for the two-dimensional versions of optimization problems arising in layered manufacturing, where a polygonal object is built by slicing its CAD model and manufacturing the slices successively. The problems considered are minimizing (i) the contact-length between the supports and the manufactured object, (ii) the area of the support structures used, and (iii) the area of the so-called trapped regions - factors that affect the cost and quality of the process.
Original language | English (US) |
---|---|
Pages (from-to) | 241-267 |
Number of pages | 27 |
Journal | Computational Geometry: Theory and Applications |
Volume | 12 |
Issue number | 3-4 |
DOIs | |
State | Published - Apr 1999 |
Bibliographical note
Funding Information:I Portions of this work appear, in preliminary form, in [11]. The present paper and a companion paper [12] extend upon and improve the results presented in [11]. ∗Corresponding author. E-mail: michiel@isg.cs.uni-magdeburg.de 1E-mail: jayanth_majhi@mentorg.com. This work was done while the author was at the Department of Computer Science & Engineering at the University of Minnesota. Research supported in part by a Grant-in-Aid of Research from the Graduate School of the University of Minnesota and by NSF grant CCR-9712226. 2 E-mail: janardan@cs.umn.edu. Research supported in part by a Grant-in-Aid of Research from the Graduate School of the University of Minnesota and by NSF grant CCR-9712226. 3E-mail: schwerdt@isg.cs.uni-magdeburg.de. 4Part of this work was done while the author was at the Department of Computer Science, King’s College, London, UK. 5E-mail: pgupta@delsoft.com. Part of this work was done while the author was at the Max-Planck-Institut für Informatik, Saarbrücken, Germany, and at the Department of Computer Science & Engineering at the University of Minnesota.
Keywords
- Computational geometry
- Layered manufacturing
- Optimization