In Layered Manufacturing, a three-dimensional polyhedral solid is built as a stack of two-dimensional slices. Each slice (a polygon) is built by filling its interior with a sequence of parallel line segments, of small non-zero width, in a process called hatching. A critical step in hatching is choosing a direction which minimizes the number of segments. Exact and approximation algorithms are given here for this problem, and their performance is analyzed both experimentally and analytically. Extensions to several related problems are discussed briefly.
|Original language||English (US)|
|Title of host publication||Computational Science - ICCS 2001 - International Conference, 2001, Proceedings|
|Editors||Vassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, René S. Renner, C.J. Kenneth Tan|
|Number of pages||10|
|ISBN (Print)||3540422323, 9783540422327|
|State||Published - 2001|
|Event||International Conference on Computational Science, ICCS 2001 - San Francisco, United States|
Duration: May 28 2001 → May 30 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||International Conference on Computational Science, ICCS 2001|
|Period||5/28/01 → 5/30/01|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.