On the computational geometry of pocket machining (Q1202051): Difference between revisions

The author presents a computational geometry approach to handling problems arising from \(NC\) pocket matching. Data structures and algorithms are used especially from the theory of Voronoi-diagrams. On the contrary, concepts and methods of \(CAD/CAM\) are essential parts in the selection of tool sizes, the determination of tool paths for contour- parallel and direction-parallel milling, and the optimization of tool paths. The ten chapters are presented in three parts. Chapter 1 of part I gives very short introductions to the topics of interest, easy to understand surveys about contour-parallel milling and direction-parallel milling are also given in part I. Part II deals with contour-parallel milling. In a first chapter Voronoi- diagrams are considered. It contains basic facts and discussions about the correctness and analysis of the given algorithm. The next chapter gives information on implementational issues. In the following chapters so-called monotonous areas and the problem of generating the tool path are discussed. In part III problems of direction-parallel milling are studied. In chapter 9 a high-level abstraction of the pocket and tool path geometry is introduced. Problems of zigzag path planning are considered. It follows the actual generation of the tool path. In an appendix some sample pocketing examples are plotted. The book shows that there are interesting connections between two orginally separated topics: computational geometry and geometric modelling of curves and surfaces.