凸多边形

However, if the polygon is convex, then the bimedial and bisector skeletons will coincide and each subpolygon will be convex.

但是，如果原外围多边形本身是凸的，则中间线骨架与角分线骨架一致，且每个子多边形也均为凸。

This code to solve the establishment point of closure convex polygon, using convex closure insertion algorithm to establish Del...

此代码用来求解建立点的凸闭包多边形，采用凸闭包插入算法建立Delaunay三角网可以用到或参考。

Convex hull of point set and that of a polygon are two classes of it.

凸包问题是计算几何的基本问题，分为平面点集凸包和多边形凸包2类。

Based on quickqull algorithm,an improved algorithm to determine the convex hull of 2-D point set was proposed in this paper.

凸包问题是计算几何的基本问题，分为平面点集凸包和多边形凸包2类。

Lilliputian frontier is a convex polygon with non-zero area.

小人国的边境为凸多边形性状（面积不为0 with non-zero area？？

The formula for area of ellipsoidal triangle on earth ellipsoid by means of geodesic coordinate is derived in this paper. It is showed that the primary term is identical with the formula for area of plane triangle by planimetric rectangular coordinate in three angular point, while the expression of remainder terms has also regularity of its form. The presented formula can be applicable also to convex polygon on earth ellipsoid.

本文推导出用三顶点的测地坐标计算地球椭球面上三角形面积的公式，公式表明，其主项的表示式与按平面坐标求面积的计算式完全一致，而附加项的表示式亦有规律可循，因此该公式的适用范围可由椭球面三角形推广至椭球面上任意凸多边形。

If P is a convex lattice polygon, and its pair-wise disjoint family of translates are also lattice polygons, whose union contains every lattice point, it is called a TLP .

若P为凸格点多边形，其内部边界不交平移覆盖平面格点集，则称之为可平移格点多边形TLP。记顶点数为v的TLP的内格点数的下确界为i ，得出i(5)=i(6)=1，i(7)=i(8)=4。

The first one is to generate the circle for each borderline segment of the component by considering the segment length and the prescribed tolerance value. If this is not the case, the borderline segment will be equally divided into halves until the obtained circle satisfies the tolerance value over the whole borderlines of the component. The basic idea of the last two algorithms aims at covering the domain occupied by the component as much as possible. The circle generation is carried out sequentially from salient angle to the sector formed by the salient angle till the uncovered borderline segments of the component. Particularly, the three-step algorithm with gap allows that the generated circles are distributed with gap along the component contour.

二分法利用组件各边长度和设置的容差大小得到该边的候选包络圆，若该圆不满足组件所有边的容差要求，则将该边不断地对分，直至所得到的包络圆满足各边的容差要求；三步划分法和带间隙的改进三步划分法则以组件区域为划分对象，依次对组件多边形凸顶角、凸扇形区和多边形各边剩余线段划分包络圆，且带间隙的改进三步划分法则允许包络圆在组件边界上以适当的间隙分布。

First, we discuss the classification of existing spatial indexing methods and point out the problems of them. Second, the approximate representation of spatial objects is given. Third, the structure and the algorithm of CP tree, which based...

本文首先介绍了目前常用的几类空间索引技术及其特点，接着讨论了面向地理信息的空间索引技术面临的基本问题，提出了基于凸多边形的空间索引结构—— CP-树，并侧重分析了其空间运算算法及时空效率，最后指出了空间索引技术所存在的问题及下一步的研究方向。

Star sensor ; star pattern identification ; convex polygon ; algorithm

星敏感器；星图识别；凸多边形；算法；弹上星表

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.

也许他们将在壶穴里消失