Between Dec 22, 2025 and Jan 5, 2026, items can be submitted to the UDC and DRUM, but will not be processed until after the break. Staff will not be available to answer email during this period, and will not be able to provide DOIs for datasets until after Jan 5. If you are in need of a DOI during this period, consider Figshare, Zenodo, Open Science Framework, Harvard Dataverse or OpenICPSR.

Computing an optimal hatching direction in Layered Manufacturing

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Published Date

Publisher

Type

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

Description

Related to

Replaces

License

Series/Report Number

Technical Report; 01-007

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Schwerdt, Jörg; Smid, Michiel; HonChung, Man; Janardan, Ravi. (2001). Computing an optimal hatching direction in Layered Manufacturing. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215503.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.