|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465532303316 |
|
|
Autore |
Held Martin <1950-> |
|
|
Titolo |
On the computational geometry of pocket machining / / Martin Held |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin : , : Springer, , [1991] |
|
©1991 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1991.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 184 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 500 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Milling-machines - Numerical control |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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 |
|
|
|
|