錐形鏈輪 的英文怎麼說
中文拼音 [zhuīxíngliànlún]
錐形鏈輪
英文
taper sprocket-
Analyse the klingelnberg amk855 gear milling machine. through analyse the transmission chain of the gear milling machine, analyse the transmitting principle and manufacture principle, introduce the two - - part cutter head, the process of formation of extended epicycloide and inaginary crown gear cutting principle ; overall introduce the formation of tooth face, deduce the calculation formulas of the main setting parameter of gear milling machine, and proving the correctness of the setting calculation formulas by the program of ‘ calculating of klingelnberg cyclo - palloid spiral bevel gear milling setting parameter ’
通過剖析該機床的傳動鏈，分析了其運動原理和加工原理;介紹了雙層萬能刀盤、延伸外擺線的形成過程和假想平面產形輪切齒理論;全面介紹了齒面的形成方法，推導了銑齒機主要的調整參數的計算公式，並用「 klingelnberg擺線齒錐齒輪銑齒調整參數計算」的程序驗證了推導的公式的正確性。This thesis establishes the cylinder gear and conic gear parameter serial, and analyzes their mechanics, completed the gear ' s product size - taking shape the molding size - electrode size delivers the regulation proceeded the research. establishing the design and calculation methods for the gears precision forming the craftwork parameter, forge piece, those gears precision forming perform, mould and and tool electrodes. based on the software platform of pro / engineer 2001 and visual c + +, the system is consisted of capp and cad, which are used for forming process and mould design for the gears, are studied and developed
本文對圓柱齒輪的精密模鍛和圓錐齒輪的冷擺輾成形工藝及其力學本質進行了系統的研究，分析了齒輪精密成形的影響因素，確定了齒輪零件一鍛件?電極?模具尺寸的傳遞規律，建立了齒輪精密成形工藝參數、鍛件、預制坯、模具以及電極的設計計算方法鏈。In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object
同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
分享友人