查询词典 polygons

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.

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

By decomposing each polygon into a set of several individual convex sub-polygons and constructing the map between the two sets, this method can solve the metamorphosis problem of two polygons which have not same topology(including concave polygon and holey polygon).

解决了任意非同拓扑结构的变形问题。

A algorithm of searching and computing two adjacent polygons' closest distance based on restricted circle has been presented in this paper, that can be fitted for the situations of undistinguished shapes and location relationships of the two adjacent polygons.

本文提出了基于约束圆寻找并计算任意两个实体多边形之间的最近距离方法，并给出了约束圆的特征。这种方法适用于不用区分实体多边形的形状与位置的各种情况。

An algorithm of searching and computing two adjacent polygons' closest distance based on restricted circle has been proposed in this paper, which can be fitted for the situations of undistinguished shapes and location relationships of the two adjacent polygons.

空间方向关系、空间拓扑关系和空间相似关系、相关关系的研究都离不开空间距离这个基础(闫浩文2003)。二维空间目标间的距离关系，尤其是面状目标间的距离，描述和计算都相当复杂[1-2]。

The reason you want to do this is so that you can avoid obvious lumpiness, misshaped details, pinching, etc. When it came to Paragalis I went from the base mesh "body only" which was 2064 polygons to the third subdivision level, which was 33,024 polygons.

你之所以要这么做是为了让你能避免明显凹凸不平，有些变形的细节，捏等，当我来到Paragalis从基地网"的机构只有"这是2064多边形细分到第三级，这是去33024多边形。

The corners of each new polygons are at the intersections of the borders of the original polygons; hence computing the coordinates of border intersections is a vital function in polygon overlay.

新几何图形的角落是在原始几何图形的疆界的交叉点；因此计算疆界交叉点座标是一个重要作用在几何图形叠盖。

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的凸多边形的求交算法。

Coordinate sequence method is made up of the instruct information of polygon boundary x, y coordinate. It is the easiest polygon vector encoding method. The file structure of this method is easy, but because of the polygon boundary has stored two times, it will produce data redundancy, moreover, short of neighbor threshold information; Tree index encoding method make all the boundary points digitizing, store the coordinate sequence, connect the point index to boundary line, and then connect the line index to other polygons, so as to the tree index structure has came into being. It eliminates neighbor polygons boundary data redundancy problems; Topology structure encoding method is a method which by setting up a complete topology relationship structure, resolve the neighbor threshold and island information process problem. However, it makes arithmetic more complicated and makes database bigger.

坐标序列法是由多边形边界的x，y坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders.

摘 要：针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点，提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法GTP(General Triangulation of Polygons)。

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.

也许他们将在壶穴里消失