Optimization Problems Related to Zigzag Pocket Machining (original) (raw)

Algorithmica, 2000

Abstract

. A fundamental problem of manufacturing is to produce mechanical parts from billets by clearing areas within specified boundaries from the material. Based on a graph-theoretical formulation, the algorithmic handling of one particular machining problem—``zigzag pocket machining''—is investigated. We present a linear-time algorithm that ensures that every region of the pocket is machined exactly once, while attempting to minimize

Rev. Christopher L. Smith hasn't uploaded this paper.

Create a free Academia account to let Rev. Christopher L. Smith know you want this paper to be uploaded.

Ask for this paper to be uploaded.