centre of area是什么意思

网络释义

用法例句

Research on Surface NC Machining Accuracy;

曲面数控加工精度的研究

Algorithm for generation of free gou tool path on sculptural surface;

复杂曲面的无干涉刀位轨迹生成

Development of Study on Numerically Controlled Machining Technology of free Surfaces;

自由曲面数控加工技术的研究进展

Powder mixed EDM of a special material curved surface;

特种材料的混粉电火花曲面加工技术

Curved surface structure of internal contraction tunnel/isolator of two-dimensional hypersonic inlet;

二元高超声速进气道内压缩通道/隔离段曲面构型

The Properties and Application of the Bicubic Bezier Curved Surface;

双三次贝齐尔曲面的特性与应用

The establishing of the space curved face to adapt CNC working;

数控加工中三维曲面模型建立的常用方法

The polishing and grinding for curved face device is given based on these turning joints,of numerical control milling machine with three linear coordinates.

介绍了转动关节的基本结构和工作原理,给出了以转动关节为基础的三坐标数控铣床的曲面抛磨装置。

Planning tool-path in the multi-coordinates machining curved face is elements and key of NC codes programming.

多坐标曲面加工的刀具轨迹规划是数控编程的基础和关键。

All quadrilateral finite element mesh generation of 3D surfaces in CAD and method of locally adding mesh density;

三维 CAD 曲面四边形网格剖分及局部加密技术

This paper presents a new method in which the disc cutter always has the same curvature and the curvature differential with that of the surfaces being machined.

提出的内凹的盘铣刀铣可加工凹曲面又加工凸曲面。

Matching surfaces with the objective function constructed according to the criterion, surfaces can be well matched, and the influence of the local high distortions was markedly reduced.

用最小二乘法的曲面匹配算法来处理待比较曲面的局部大变形问题 ,具有较大误差 ,为此提出了一种新的贴合评判标准 ,以此来构造匹配优化的目标函数并进行匹配 ,不但能达到总体优化 ,还可以减弱局部大变形对匹配结果的影响 。

The practice proved this is a easy method of curve surface NC machining.

依据双三次均匀B样条曲面造型原理 ,运用参数线加工方法及MATLAB程序设计语言生成了曲面的造型程序及刀具的数控加工轨迹 ,实践证明这是一种较为简便的曲面数控加工方

A new algorithm is proposed for calculating the approximate shortest path on curve surface which can be represented by a triangle mesh model and form a weighted graph.

为了提高曲面上任意两点间近似最短路径的计算效率,提出了求解曲面上任意两点间近似最短路径的算法,该算法首先利用三角形网格模型表示曲面,并形成相应的带权图结构,然后采用FSPA(快速最短路径法)动态计算带权图上两点的最短路径,再通过迭代细分最短路径周围的三角形网格上的边,最后由这些边构造新的子图来不断逼近曲面上两点间的最短路径。