导航网格把这个表面存为凸多边形。
给定两个可能相互重叠的凸多边形。
一凸多边形有七条边，但只有一个角是直角。
A particular convex polygon with seven sides has exactly one right Angle.
为求解直线度误差，采用矢量积构造凸多边形。
The convex polygon is constructed by vector product in order to solve the straightness error.
画一个凸多边形。
提出最大空圆凸多边形和最大空球凸多面体的概念。
Maximum empty circle convex polygon and maximum empty sphere convex polyhedron are introduced to compute triangulation on a set of irregularly located spatial points.
已有的线裁剪算法都是针对矩形窗口或凸多边形窗口的。
Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window.
因此，本文主要研究两个凸多边形的快速求交与距离计算方法。
So we mainly study the methods of fast intersection detection and distance computation of two convex polygons in this thesis.
本文就快速构成实体模型，提出一种有效的凸多边形填充算法。
An algorithm of filling convex polygon is provided in order to construct real-body model fast.
已有的多边形裁剪算法都是针对矩形窗口或凸多边形窗口进行的。
Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window.
对0.618法、基准旋转法和凸多边形法等不同算法的比较进行了尝试。
An attempt has been made to compare different algorithms which are based on the methods of 0.618, standard rotation and convex polygon.
该算法同时适用于凸多边形和凹多边形，并具有较好的区分度和匹配准确性。
This algorithm can be used for both the convex and the concave contours.
通过依次抽取外接凸多边形，将凹多边形表达为仅由凸多边形组成的多层拓扑结构。
Next, by extracting convex polygons consecutively, the noconvex polygon is described as topological structure made of convex polygons at defferent layers.
凸多边形是一个很有用的表示法，因为我们知道凸多边形内部任意两点之间没有障碍。
Convex polygons are a usefulrepresentation, since we know that there are no obstructions between any twopoints inside a polygon.
说明：根据输入点组成线和面，并计算组成的凸多边形的质心、面积、是否和指定线交叉等。
The input lines of dots and the surface, and calculate the composition of the convex polygon centroid, area, and whether the specified line cross, etc.
提出一种高效的对凸多边形组成的多面体进行圆柱面裁剪的算法，并实现了多面体的快速钻孔。
An efficient cylindrical clipping algorithm is presented to rapidly drill holes in polyhedrons, which are made up of convex polygons.
仿真结果表明：在任意视场中，基于凸多边形的星图识别成功率高于99%，并具有较强的鲁棒性。
Finally, numeral simulation shows that the star pattern identification algorithm based on the convex polygon has high robustness and the ratio of identification is above 99%.
具有边界清晰、单元形状好、网格密度可控和自动程度高的特点，适合于任意形状的凹或凸多边形。
It is characterized with well defined boundary, good shape, easy control of mesh density and high level of automation, and suit for polygons with any shape.
本文介绍了直线度误差最小评定的0.618法和凸多边形法，并给出了这两种方法的高级语言程序。
The 0.618 method and the convex polygon method for minimum condition evaluation of straightness error are introduced, and their high-level language programs are given in this paper.
利用构造出的多边形有理插值，采用凸多边形逼近任意凸域，通过区域边界温度离散值，插值近似区域内的温度场分布。
A convex domain is approached by a convex polygon, and the approximated temperature distribution within the domain can be interpolated with the temperature data at the boundaries of the domain.
本文首先讨论了凸多边形对图形的外裁剪和内裁剪，在此基础上研究了任意多边形对图形的裁剪问题，通过编程应用，效果良好。
This paper first studies the graphic outer and inner cut by convex polygon, then the graphic cut by arbitrary polygon. Its application of compiler program proves to be satisfactory.
对SCARA型操作臂的C空间作了深入研究，证明了凸多边形障碍物在SCARA型操作臂的C空间中形成一连通的障碍物子空间。
A profound approach about SCARA manipulators configuration space is made in this paper. The obstacle space of SCARA manipulator produced by convex polygon obstacle is proved to be a connected area.
该方法中的被剪切对象是较为复杂的几何实体，包括圆弧以及带有圆弧边界和带有洞的复杂多边形对象，其中剪裁窗口可以为凹多边形或凸多边形。
The cutting object is complicacy geometry entity, which is complicacy polygon with arc, arc boundary and hole, the cutting window can be cave or convex polygon.
为此，设计了以导航星凸多边形和观测凸多边形之间距离最小为准则的识别算法。针对星光制导的导弹观星时间很短，提出了根据弹道生成弹上导航星表的方法，其导航星表只需存储30颗星的75 个凸多边形。
As the star sensor of ballistic missile works only for short time, the navigation stars in the missile can be reduced to 30, and the convex polygons can be reduced to 75 for different trajectories.
为此，设计了以导航星凸多边形和观测凸多边形之间距离最小为准则的识别算法。针对星光制导的导弹观星时间很短，提出了根据弹道生成弹上导航星表的方法，其导航星表只需存储30颗星的75 个凸多边形。
As the star sensor of ballistic missile works only for short time, the navigation stars in the missile can be reduced to 30, and the convex polygons can be reduced to 75 for different trajectories.
应用推荐