任意平面多边形的凸分解。
为球体碰撞器使用内插法线而不是平面多边形法线。
Uses interpolated normals for sphere collisions instead of flat polygonal normals.
在计算机视觉中，平面多边形的识别有着十分重要的意义。
The recognition of planar polygons has many important applications in computer vision.
对于平面多边形的变形，笔者提出离散曲率插值变形的方法。
This paper presents a method for morphing planar polygons via discrete curvature interpolation which employs intrinsic discrete curvature shape properties.
提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented.
基于类似形的定义给出了在透视投影下平面多边形为类似形的识别算法。
A new algorithm is presented for recognizing planar objects from a line drawing under axonometric and perspective projections based on principle of homograph.
通道横截面为规则或不规则平面多边形，因而比表面积大、传质效率高。
The cross section of the passage is a regular or irregular plane polygon, and then the specific surface area is large and the mass transfer efficiency is high.
对于平面多边形的闭合集空间合成算法，本文详细讨论了实现的理论基础、各个步骤的处理规则等。
Forthe spatial synthetic operations algorithms about the closed set of polygons in the plane, this dissertation discusses the theory of the implementation and processing rules of each step in detail.
概述了平面多边形三角形剖分的各种算法，提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法，并给出了实例。
We have proposed an arithmetic of this kind to eliminate the vertex in a circling way, ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.
Geometry描述扁平(比如欧几里得)平面上的位置，并可用来判定诸如多边形形状和面积之类的信息。
Geometry describes locations on a flat (i.e. Euclidean) plane, and can be used to determine information such as the shape and area of a polygon.
通过对多边形可见边的分析，利用平面扫描技术，给出了求其可见边的算法。
By analysing of the visibility edges of the polygons, using the plane sweep technique, we present an algorithm to find the visibility edges of the set of polygons.
文中还定义了平面单连通多边形区域的所谓分层三角剖分，并确定了此剖分下二次样条空间的维数。
Then, a new kind of so-called stratified triangulation of a simply connected planar polygonal region is introduced.
针对平面点集最小权三角划分问题的特点，提出了新的交叉算子和变异算子，即多边形交叉算子与三角形变异算子。
Based on the characteristic of MWT problem, new operators for crossover and mutation are presented, that is, polygon crossover and triangular mutation.
根据协调映射的理论，建立了平面上圆形域、矩形域、多边形域等参数域的映射模型，可根据轨迹规划的需要来选择映射的边界。
Based on the theory of conformal map, map model is built for planar parametric circle, rectangle and polygon regions. The boundary of parametric region rests with the need of tool path planning.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
背景剪裁平面决定了展现多边形时剪裁的点数，在这里我们设定的值是5000，这个值取决于您使用的坐标系。
The back clipping plane determines the cutoff point for rendering polygons. Here we're setting it to 5000. This value will vary depending on your coordinate system.
由数字控制平面的3d环境中的编辑，该方法可以处理一些几何效率，如点，线，多边形等。
Editing in 3d environment by a digital control plane, the method can deal with some geometry efficiently, such as point, line, and polygon, etc.
给出平面上多边形的面积矢量的定义及公式，并应用它求出多边形的面积公式。
Give a definition about area vector of a polygon on the plane and its formula, area formula of a polygon can be sought by it.
介绍了系统的软件模块，提出了结合最近点迭代（ICP）和通用多边形裁剪（GPC）的3D平面场景合成方法。
An ICP and GPC based 3D planar scene integration algorithm is proposed in the software module.
这样我就在草坪中间创建了一个标准的平面图，在编辑多边形中选择边缘，开始挤压并调整地形，使其和草坪部分保持一致。
For that I created a normal plane in the middle of the grass part and in edit poly mode selecting the edges I began to extrude and adjust the terrain to fit with the grass parts.
设P和Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
设P和Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
应用推荐