COMPUTING AN OPTIMAL HATCHING DIRECTION IN LAYERED MANUFACTURING
Authors:
J
rg Schwerdt a;
Michiel Smid a;
Man Chung Hon b;
Ravi Janardan b
rg Schwerdt a;
Michiel Smid a;
Man Chung Hon b;
Ravi Janardan b
| Affiliations: | a Department of Computer Science, University of Magdeburg, D-39106 Magdeburg, Germany. |
| b Department of Computer Science and Engineering, University of Minnesota, Minneapolis,MN 55455, USA. |
DOI:
10.1080/00207160212705
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
10
2002
, pages 1067
- 1081
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 15
Formats available:
PDF
(English)
View Article:
View Article (PDF)
Abstract
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In StereoLithography, a specific LM-technology, a layer is built using a laser which follows paths along equally-spaced parallel lines and hatches all segments on these lines that are contained in the layer. We consider the problem of computing a direction of these lines for which the number of segments to be hatched is minimum, and present an algorithm that solves this problem exactly. The algorithm has been implemented and experimental results are reported for real-world polyhedral models obtained from industry.
|
| Keywords: Computational Geometry; Layered Manufacturing |
| view references (15) |

Download Citation

CiteULike
Del.icio.us
BibSonomy
Connotea