Protecting critical facets in layered manufacturing.

DOI10.1016/S0925-7721(00)00008-0zbMath1133.68465OpenAlexW2029188798WikidataQ128081145 ScholiaQ128081145MaRDI QIDQ2482880

Yanyan Li

Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00008-0

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING ⋮ Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem ⋮ A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems ⋮ A decomposition-based approach to layered manufacturing ⋮ Computing An Optimal Hatching Direction In Layered Manufacturing

This page was built for publication: Protecting critical facets in layered manufacturing.