polygons

polygons的基本解释

-

多边形

与polygons相关的网络例句 [注：此内容来源于网络，仅供参考]

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.

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

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

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.

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

与polygons相关的网络解释 [注：此内容来源于网络，仅供参考]

Divide Polygons：等分多边形

Divide Faces等分面数 | Divide Polygons等分多边形 | Divide Evenly,No Objects at Ends平均划分,末端无物体

Divide Polygons：等分多边形(责任编辑:admin)

Divide Edges等分边界 | Divide Faces等分面数 | Divide Polygons等分多边形(责任编辑:admin)

inscribed polygons：内接正多边形 内接多边形

inquiry 查询 查询 | inscribed polygons 内接正多边形 内接多边形 | insert 插入 插入

inscribed polygons：内接正多边形

"inquiry","查询" | "inscribed polygons","内接正多边形" | "insert","插入"

inscribed polygons：内接多边形

inquiry 查询 | inscribed polygons 内接多边形 | insert 插入