Skip to main content

On the Computational Geometry of Pocket Machining

  • Book
  • © 1991

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 500)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

Keywords

About this book

In this monograph the author presents a thorough computational geometry approach to handling theoretical and practical problems arising from numerically controlled pocket machining. The approach unifies two scientific disciplines: computational geometry and mechanical engineering. Topics of practical importance that are dealt with include the selection of tool sizes, the determination of tool paths, and the optimization of tool paths. Full details of the algorithms are given from a practical point of view, including information on implementation issues. This practice-minded approach is embedded in a rigorous theoretical framework enabling concise statement of definitions and proof of the correctness and efficiency of the algorithms. In particular, the construction of Voronoi diagrams and their use for offset calculations are investigated in great detail. Based on Voronoi diagrams, a graph-like structure is introduced that serves as a high-level abstraction of the pocket geometry and provides the basis for algorithmically performing shape interrogation and path planning tasks. Finally, the efficiency and robustness of the approach is illustrated with figures showing pocketing examples that have been processed by the author's own implementation.

Bibliographic Information

Publish with us