LEADER 03179nam 2200541 450 001 996465532303316 005 20220223165440.0 010 $a3-540-47413-7 024 7 $a10.1007/3-540-54103-9 035 $a(CKB)1000000000233652 035 $a(SSID)ssj0000325364 035 $a(PQKBManifestationID)11246601 035 $a(PQKBTitleCode)TC0000325364 035 $a(PQKBWorkID)10324043 035 $a(PQKB)10833729 035 $a(DE-He213)978-3-540-47413-5 035 $a(MiAaPQ)EBC6857844 035 $a(Au-PeEL)EBL6857844 035 $a(PPN)155190261 035 $a(EXLCZ)991000000000233652 100 $a20220223d1991 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aOn the computational geometry of pocket machining /$fMartin Held 205 $a1st ed. 1991. 210 1$aBerlin :$cSpringer,$d[1991] 210 4$dİ1991 215 $a1 online resource (XII, 184 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v500 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54103-9 327 $aI 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. 330 $aIn 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v500 606 $aMilling-machines$xNumerical control 615 0$aMilling-machines$xNumerical control. 676 $a621.91 700 $aHeld$b Martin$f1950-$0754256 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465532303316 996 $aOn the computational geometry of pocket machining$91517631 997 $aUNISA