Computing optimal hatching directions in layered manufacturing

Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationComputational Science - ICCS 2001 - International Conference, 2001, Proceedings
EditorsVassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, René S. Renner, C.J. Kenneth Tan
PublisherSpringer Verlag
Pages683-692
Number of pages10
ISBN (Print)3540422323, 9783540422327
DOIs
StatePublished - 2001
EventInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
Duration: May 28 2001May 30 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2073
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Computational Science, ICCS 2001
CountryUnited States
CitySan Francisco
Period5/28/015/30/01

Fingerprint Dive into the research topics of 'Computing optimal hatching directions in layered manufacturing'. Together they form a unique fingerprint.

Cite this