 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   任意多边形的 的翻译结果: 查询用时：0.067秒 在分类学科中查询 所有学科 计算机软件及计算机应用 机械工业 无线电电子学 建筑科学与工程 更多类别查询 历史查询  任意多边形的  arbitrary polygon
 A new algorithm of cutting the arbitrary polygon 裁剪任意多边形的一种新算法 短句来源 The technique of arbitrary polygon to be substi-tuted locally with rectangles and the method of interconnection and resistance to be extractedsimultancously are also presented. They all improve the speed of circuit extraction. 本文提出的由矩形局部替代任意多边形的技术和连接与电阻同时提取的方法都改善了电路提取的速度. 短句来源 The Delaunay triangulation of an arbitrary polygon is one of the basic algorithms in computer graphics and has extensive applications. This paper proposes a new concise and generalpurpose triangulation algorithm of the arbitrary polygon in terms of the optimum properties of Delaunay triangulation,and shows the actual application of this algorithm in the automatic finite element mesh generation. 任意多边形的三角剖分是计算机图形学领域中的一个基本算法，其用途非常广泛．本文利用著名的Delaunay三角剖分的优化性质，提出了一种简洁、通用的任意多边形Delaunay三角剖分算法，并给出了该算法在有限元网格自动生成过程中的应用． 短句来源 The concept of monotone chain in computational geometry is extended at first and used to decompose the inner and outer loops of an arbitrary polygon. Second, the nonregular vertices are sorted. At last,the decomposition between monotone chains finish the whole arbitrary polygon decompsition process. 通过扩展计算几何中的“单调链”概念，提出了一种新的任意多边形剖分算法．首先利用新的概念将任意多边形分解为单调链，其后对单调链尖点排序，最后在相邻单调链间进行分割，从而完成任意多边形的剖分．算法的时间复杂度为O（NlogN）．本文最后给出了算法在用GL对实体模型进行光照中的应用． 短句来源 This paper has offered a method and algorithm of polygon's intersection, for the arbitrary way of intersecting of solid arbitrary polygon, this method is accurate and general, and is easy for realization by computer program. 文章提出了以节点操作求解两多边形交集的方法和算法,对于实心任意多边形的任意相交方式,该方法是准确和通用的,且易于计算机程序的实现。 短句来源 arbitrary polygons
 DELAUNAY TRIANGULATION OF ARBITRARY POLYGONS 任意多边形的Delaunay三角剖分 短句来源 Delaunay Triangulation Algorithm of Arbitrary Polygons with Visual C Language 用VC语言实现任意多边形的Delaunay完全三角剖分算法 短句来源 This paper had been carrying out a study on the layout technology of arbitrary polygons with two-step theory. 本文采用二步法对任意多边形的优化排样技术进行了研究。 短句来源 “任意多边形的”译为未确定词的双语例句
 An Algorithm for Deciding the kernel of polygon 确定任意多边形的核的算法 短句来源 Algorithm for Determining the Union of Two Polygons 确定两个任意多边形的并的算法 短句来源 A FAST FILLING ALGORITHM FOR ANY POLYGON 一种新的任意多边形的快速填充算法 短句来源 Area Calculation of Polygon and is’t Use in Building Price Budget 任意多边形的面积计算及在造价分析中的应用 短句来源 A Convexity & Concavity Judging Method of the Arbitrary Polygon with 非直线边任意多边形的凸凹性判断 短句来源 更多 查询“任意多边形的”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  arbitrary polygon
 Calculation of geometric configuration factors in an enclosure whose boundary is given by an arbitrary polygon in the plane A method for generating a smooth voxelbased model from an arbitrary polygon mesh is presented. Then, a novel methodology is developed to calculate an arbitrary polygon area and locate the concave cavities in the polygon. It is shown that the problem of the optimal coverage with an arbitrary polygon can be reduced to a convex one of coverage with a multidimensional rectangle. Information loss is unavoidable with any spherical function defined over an arbitrary polygon mesh. 更多 In this article,an algorithm of drawing section-lines in computer graphics is described. It is discussed in three sections: 1.Boundaries made up of arbitrary polygons; 2.Arbitrary figures the boundaries of which are made up of straight-lines and arcs; 3.Several mono-connected figures or multi-connected figures using the same family of section-lines. The article is supplied with program flow charts and some illustrative figures.These illustrative figures are produced by the SIEMENS 7.738 computer and BENSON plotter... In this article,an algorithm of drawing section-lines in computer graphics is described. It is discussed in three sections: 1.Boundaries made up of arbitrary polygons; 2.Arbitrary figures the boundaries of which are made up of straight-lines and arcs; 3.Several mono-connected figures or multi-connected figures using the same family of section-lines. The article is supplied with program flow charts and some illustrative figures.These illustrative figures are produced by the SIEMENS 7.738 computer and BENSON plotter at the Computer Center of Hangzhou Steam-Turbine Factory. 本文介绍了计算机制图中绘制机械图样剖面线的一种算法。分三部份叙述1.周界为任意多边形;2.周界为直线和园弧组成的任意图形;3.使用同一族剖面线的多个单独封闭图形或复连通区域的图形。本文还提供了程序框图和例图。这些例图由杭州汽轮机厂计算机站 SIEMENS 7.738计算机和 BENSON 绘图机产生。 The simplified analysis of framed-tube structures of any polygon-rial section under transverse and torsional loadings is discussed in the paper. The self-equilibrating stress parameters in framed-tube structures are taken as the primary unknown functions. By using complementary energy principle the corresponding ordinary differential equations and the natural boundary conditions arc derived. It shows that this method gives high precision in numerical analysis and involves less computational work. 本文讨论截面为任意多边形的框筒结构在横向和扭转荷载下的简化计算。在计算中,以结构的自应力参数作为基本未知函数,应用最小余能原理推导出相应的常微分方程组及其自然边界条件。实例计算表明,此法具有计算量较少,精度较高和适用性较广的优点。 Here a new algorithm is described, i.e. two arbitrary linear graphs are computed with 'union, intersection and difference' to constitute another geometric graph. The two graphs being computed are arbitrary polygons with one or several loops.The characteristics of this algorithm are as follows. A loop of graph one and all loops of graph two are calculated simultaneously. Each useful point of intersection is given a feature code and jions to a chain to express its topological relations together with other apexes... Here a new algorithm is described, i.e. two arbitrary linear graphs are computed with 'union, intersection and difference' to constitute another geometric graph. The two graphs being computed are arbitrary polygons with one or several loops.The characteristics of this algorithm are as follows. A loop of graph one and all loops of graph two are calculated simultaneously. Each useful point of intersection is given a feature code and jions to a chain to express its topological relations together with other apexes and points of intersection. Then constitute different new graphs according to the demands of 'union, intersection and difference'.Owing to adopting the chain list structure of data, several loops being calculated simultaneously, judgement first and calculation second for intersection points, and doing away with much calculation of useless intersection points and multiple intersection points, the program has a very terse structure (about 150 lines of statements in FORTRAN) and needs very short time for execution only. 本文描述了由两个任意直线图形通过并、交、差运算从而构成新的几何图形的方法。参加运算的几何图形可以是一环或几环组成的任意多边形。 图形运算的特点是第一图的一个环与第二图的几个环同时进行运算,对每个求出的有用交点赋于特征码并与其他交点、顶点一起构成表示其拓扑关系的链,再根据并、交、差的不同情况形成新的图形。 由于本法采用链表数据结构,几个环同时进行运算,而且采用先判别后求交的方法,减少许多有关无用交点和重复交点的计算量,因此程序比较紧凑(仅一百五十条左右PORTRAN语句),运算速度也较快。 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关任意多边形的的内容 在知识搜索中查有关任意多边形的的内容 在数字搜索中查有关任意多边形的的内容 在概念知识元中查有关任意多边形的的内容 在学术趋势中查有关任意多边形的的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社