凸多边形

One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.

采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。

The implementation process of the algorithm is as follows: First, the scanning lines of each contour are generated, while the contour's shape can be divided into convex polygon and concave polygon, and the generating process of the scanning lines of each contour needs special treatments .

首先依次生成每个轮廓的轮廓扫描线，由于轮廓形状可能为凸多边形也可能为凹多边形，所以在生成各轮廓的扫描线时要增加一些特殊处理操作。

In this paper, an arbitrary edge in the plane of the convex polygon generating algorithm, discussed the randomly generated convex polygon vertex algorithm idea.

本文研究在平面中生成任意边的凸多边形的算法，讨论了随机生成凸多边形顶点坐标的算法思想。

Star pattern identification algorithm based on convex polygon with star magnitudes-independent is presented for strap-down celestial guidance.

依其坐标排序，采用由平面上的点生成凸多边形的算法，就能得到唯一的、以恒星为顶点的凸多边形。

Sort-and-Incremental Algorithm Step 4: Intersections of adjacent h-plane pairs in stack form half a convex polygon.

相邻半平面的交点组成相邻半平面的交点组成半个凸多边形。半个凸多边形。

The Convex Hull of a given points P in the plane is the unique convex polygon whose vertices are points from P and contains all points of P.

在给定的点在平面P凸包是独特的凸多边形的顶点从P点，并包含换句话说P的所有点的集合P点是最小凸集凸壳含有体育

The attitude of missile in the launch inertial coordinate frame is obtained by the relation between CRF and LICF.

由星敏感器视场中的星图，可生成唯一的最大凸多边形，基于凸多边形的星图识别算法可同时获得多颗星的瞬时位置，由此可获得弹体在赤道惯性系和发射点惯性系中的姿态及其关系。

A new method of polygon metamorphosis based on morphology and general optimization is proposed in this paper.

通过对多边形的凸剖分，并建立2种不同多边形的凸子集映射，提出了一种全新的基于凸多边形变形的全局优化方法。

When the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of these edges, a new algorithm for computing the convex hull of a simple polygon is proposed first, which is then extended to a new algorithm for computing the convex hull of a planar point set.

本文依据凸多边形的这一特性，提出求解简单多边形凸包的新算法，进而扩展得到求解平面点集凸包的新算法。新点集凸包算法先找到点集的极值点，得到极值点间的候选点子集，再求得相邻极值点间的有序凸包点列，最后顺序连接极值点间的有序凸包点列，得到凸包。

Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly. New algorithms for orientation and inclusion test for simple polygon are proposed. And Ghosh's convex hull algorithms for simple polygon and convex polygons, Subramanian's triangulation algorithm for arbitrary planar domain and O'Rourke's intersection algorithm for convex polygons are modified to make them more robust.

断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了Subramanian的平面多连通域的三角划分方法、Ghosh的多边形的凸包及多个多边形的凸包算法和O'Rourke的凸多边形的求交算法。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失