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.
本文介绍了直线度误差最小评定的0.618法和凸多边形法，并给出了这两种方法的高级语言程序。
Convex polygons are a usefulrepresentation, since we know that there are no obstructions between any twopoints inside a polygon.
凸多边形是一个很有用的表示法，因为我们知道凸多边形内部任意两点之间没有障碍。
The convex decomposition of arbitrary planar polygon.
任意平面多边形的凸分解。
Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window.
已有的多边形裁剪算法都是针对矩形窗口或凸多边形窗口进行的。
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.
说明：根据输入点组成线和面，并计算组成的凸多边形的质心、面积、是否和指定线交叉等。
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%.
仿真结果表明：在任意视场中，基于凸多边形的星图识别成功率高于99%，并具有较强的鲁棒性。
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.
对SCARA型操作臂的C空间作了深入研究，证明了凸多边形障碍物在SCARA型操作臂的C空间中形成一连通的障碍物子空间。
An improved algorithm is proposed based on the polygon convex decomposition algorithm based on point visibility.
在参考基于顶点可见性的凹多边形凸分解算法的基础上，提出了改进的方法。
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.
本文首先讨论了凸多边形对图形的外裁剪和内裁剪，在此基础上研究了任意多边形对图形的裁剪问题，通过编程应用，效果良好。
The convex polygon is constructed by vector product in order to solve the straightness error.
为求解直线度误差，采用矢量积构造凸多边形。
An attempt has been made to compare different algorithms which are based on the methods of 0.618, standard rotation and convex polygon.
对0.618法、基准旋转法和凸多边形法等不同算法的比较进行了尝试。
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.
该方法中的被剪切对象是较为复杂的几何实体，包括圆弧以及带有圆弧边界和带有洞的复杂多边形对象，其中剪裁窗口可以为凹多边形或凸多边形。
An algorithm of filling convex polygon is provided in order to construct real-body model fast.
本文就快速构成实体模型，提出一种有效的凸多边形填充算法。
Next, by extracting convex polygons consecutively, the noconvex polygon is described as topological structure made of convex polygons at defferent layers.
通过依次抽取外接凸多边形，将凹多边形表达为仅由凸多边形组成的多层拓扑结构。
Based on polygon convex hull method, the chord line is extracted.
采用了基于多边形凸包的方法提取弦线。
Draws a single, convex polygon.
画一个凸多边形。
Maximum empty circle convex polygon and maximum empty sphere convex polyhedron are introduced to compute triangulation on a set of irregularly located spatial points.
提出最大空圆凸多边形和最大空球凸多面体的概念。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
In this paper, we treat the convex polygon domain as locus of points and give its equation.
在传统解析几何中，平面区域未被作为点的轨迹来看待，因此没有研究平面区域的方程问题。
A particular convex polygon with seven sides has exactly one right Angle.
一凸多边形有七条边，但只有一个角是直角。
Equation about isometric polygon curve is set up with differential geometry theory. The curve is proved to be convex curve which the distance between any parallel tangent lines is equal.
应用微分几何理论，导出了等距曲线的方程，证明了它是具有任意两条平行切线之间距离都相等的卵形线。
Equation about isometric polygon curve is set up with differential geometry theory. The curve is proved to be convex curve which the distance between any parallel tangent lines is equal.
应用微分几何理论，导出了等距曲线的方程，证明了它是具有任意两条平行切线之间距离都相等的卵形线。
应用推荐