Multi-criteria geometric optimization problems in Layered Manufacturing
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Multi-criteria geometric optimization problems in Layered Manufacturing
Published Date
1997
Publisher
Type
Report
Abstract
In Layered Manufacturing, the choice of the build direction for the model influences several
design criteria, including the number of layers, the volume and contact-area of the support
structures, and the surface finish. These, in turn, impact the throughput and cost of the
process. In this paper, efficient geometric algorithms are given to reconcile two or more of
these criteria simultaneously, under three formulations of multi-criteria optimization: Finding a
build direction which (i) optimizes the criteria sequentially, (ii) optimizes their weighted sum, or
(iii) allows the criteria to meet designer-prescribed thresholds. While the algorithms involving
"support volume" or "contact area" apply only to convex models, the solutions for "surface
finish" and "number of layers" are applicable to any polyhedral model. Some of the latter
algorithms have also been implemented and tested on real-world models obtained from industry.
The geometric techniques used include construction and searching of certain arrangements on
the unit-sphere, 3-dimensional convex hulls, Voronoi diagrams, point location, and hierarchical
representations. Additionally, solutions are also provided, for the first time, for the constrained
versions of two fundamental geometric problems, namely polyhedron width and largest empty
disk on the unit-sphere.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 97-055
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Majhi, Jayanth; Janardan, Ravi; Smid, Michiel; Schwerdt, Jorg. (1997). Multi-criteria geometric optimization problems in Layered Manufacturing. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215340.
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.