Between Dec 19, 2024 and Jan 2, 2025, datasets can be submitted to 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 until after Jan 2. If you are in need of a DOI during this period, consider Dryad or OpenICPSR. Submission responses to the UDC may also be delayed during this time.
 

Minimizing support structures and trapped area in two-dimensional layered manufacturing

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Minimizing support structures and trapped area in two-dimensional layered manufacturing

Published Date

1997

Publisher

Type

Report

Abstract

Efficient geometric 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.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Technical Report; 97-058

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Majhi, Jayanth; Janardan, Ravi; Smid, Michiel; Schwerdt, Jorg; Gupta, Prosenjit. (1997). Minimizing support structures and trapped area in two-dimensional layered manufacturing. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215343.

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.