000 | 03469nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-47413-5 | ||
003 | DE-He213 | ||
005 | 20160624102023.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1991 gw | s |||| 0|eng d | ||
020 |
_a9783540474135 _9978-3-540-47413-5 |
||
024 | 7 |
_a10.1007/3-540-54103-9 _2doi |
|
050 | 4 | _aTA1637-1638 | |
050 | 4 | _aTA1637-1638 | |
072 | 7 |
_aUYT _2bicssc |
|
072 | 7 |
_aUYQV _2bicssc |
|
072 | 7 |
_aCOM012000 _2bisacsh |
|
072 | 7 |
_aCOM016000 _2bisacsh |
|
082 | 0 | 4 |
_a006.6 _223 |
082 | 0 | 4 |
_a006.37 _223 |
100 | 1 |
_aHeld, Martin. _eauthor. |
|
245 | 1 | 0 |
_aOn the Computational Geometry of Pocket Machining _h[electronic resource] / _cby Martin Held. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1991. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1991. |
|
300 |
_aXII, 184 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v500 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aComputer vision. | |
650 | 0 | _aComputer aided design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aImage Processing and Computer Vision. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer-Aided Engineering (CAD, CAE) and Design. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540541035 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v500 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-54103-9 |
942 |
_2EBK6070 _cEBK |
||
999 |
_c35364 _d35364 |