The algorithms of Delaunay triangulation are the main algorithms when establishing DEM.
Delaunay三角剖分算法是构建数字高程模型(DEM)的主要算法.
A constrained growth algorithm of simple polygon triangulation is proposed.
提出了一种简单多边形三角剖分的约束生长算法.
The relation between computation accuracy and division mesh is investigated numerically.
具体数值研究了波导高次模求解精度和剖分疏密的关系.
Generally a planar triangulation method is used to enclose the unmatched contours.
通常,对末端轮廓都是以平面三角剖分封闭端面.
In the course of creating triangle gridding , program used the Delaunay - triangle method.
在三角形剖分的过程序中用到了Delaunay三角剖分法.
Finally the result of a model decomposition is given.
最后给出了简单实体的剖分结果作为示范.
A of triangulation for scale scattered 3 D points is proposed.
提出了一种针对空间大规模散乱数据点三角剖分的方法.
Results of triangulation were recorded in winged - edge structure.
剖分结果以翼边数据结构存储,供模型重构时使用.
Plane scattered data triangulation has a wide application.
平面散乱点三角剖分在实践中有广泛应用.
It is mainly made up of cross section worm gear _ spring _ slanting lumps _ ball.
它主要是由横截剖分蜗轮———弹簧———斜块———滚珠构成的.
And the applications of solving the two mathematical models with the domain discretization BEM are studied.
研究了区域剖分边界元方法在求解这两类数学模型时的应用.
The triangulation of unorganized points on a surface plays a important role for surface reconstruction.
曲面上散乱点的三角剖分在曲面重建中发挥着重要作用.
An enumerating equation of rooted loopless planar maps with node partition is presented.
得到了无环有根平面地图依节点剖分的计数方程.
The technique based on hierarchical partitioning was given , which synthetically used spatial partitioningand bounding volume hierarchy.
提出了基于分层次剖分的快速碰撞检测方法.
A new method was proposed for constructing fractal interpolation surfaces through points sampled on rectangular lattices.
提出了一种新的分形插值算法,通过矩形剖分上的采样数据点构建分形插值曲面.