On the Computational Geometry of Pocket Machining [electronic resource] / by Martin Held.

By: Held, Martin [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 500Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1991Description: XII, 184 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540474135Subject(s): Computer science | Software engineering | Computer graphics | Computer vision | Computer aided design | Computer Science | Image Processing and Computer Vision | Computer Graphics | Software Engineering | Computer-Aided Engineering (CAD, CAE) and DesignAdditional physical formats: Printed edition:: No titleDDC classification: 006.6 | 006.37 LOC classification: TA1637-1638TA1637-1638Online resources: Click here to access online
Contents:
I Introduction -- 2 Survey of contour-parallel Milling -- 3 Survey of direction-parallel milling -- 4 Preliminaries -- 5 Computing Voronoi diagrams -- 6 Implementation issues -- 7 The concept of monotonous areas -- 8 Generating the tool path -- 9 Constructing the mesh -- 10 Generating the tool path.
In: Springer eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK6070

I Introduction -- 2 Survey of contour-parallel Milling -- 3 Survey of direction-parallel milling -- 4 Preliminaries -- 5 Computing Voronoi diagrams -- 6 Implementation issues -- 7 The concept of monotonous areas -- 8 Generating the tool path -- 9 Constructing the mesh -- 10 Generating the tool path.

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha