全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 多边形的外部 的翻译结果: 查询用时：0.242秒
 在分类学科中查询 所有学科 更多类别查询

 历史查询

 多边形的外部
 “多边形的外部”译为未确定词的双语例句
 By analyzing deeply the properties of the Voronoi diagram of polygons and using the space adjacency and proximity recording by polygons' outer Voronoi diagrams, we design and implement a fast intersection detection algorithm of two convex polygons and a fast distance computation algorithm between two disjoint convex polygons based on the outer Voronoi diagram of convex polygons. 通过对多边形Voronoi图性质的深入分析，利用Voronoi图所记录的空间连贯性和最邻近性质，设计实现了基于凸多边形的外部Voronoi图的两个凸多边形的快速求交和两个分离凸多边形的快速距离计算方法。 算法简单、易于理解和编程，速度快。 短句来源 A systematic method of numerical conformal mapping is developed in this paper to map the exterior of an arbitrary 2-D body having several discontinuities of surface slop onto the exterior of a unit circle. 本文发展了一种系统的一次性数值保角转绘方法,可以将一含多个角点的任意曲边多边形的外部区域,一次保角转绘为单位圆的外部区域。 短句来源 The problem is that PtInRegion function mentioned above can not always compute the correct result,especially when the point which will be judged is exactly on the edge of the other polygon. 但点在多边形的外部时返回0.但函数PtInregion并不能总是可靠地返回正确结果,特别是当要判断的点位于另一多边形的边界时. 短句来源
 相似匹配句对
 Analysis of the exterior environment. ·外部环境分析。 短句来源 External Operation; 外部操作； 短句来源 CUTTING THE GENERAL POLYGONS 一般多边形的切割 短句来源 TRIANGULATION OF A POLYGON AND ITS APPLICATION 多边形的三角剖分及应用 短句来源

我想查看译文中含有：的双语例句

 exterior of a polygon
 We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). In this paper we propose and analyze some strategies to construct asymptotically optimal algorithms for solving boundary reductions of the Laplace equation in the interior and exterior of a polygon.
 A systematic method of numerical conformal mapping is developed in this paper to map the exterior of an arbitrary 2-D body having several discontinuities of surface slop onto the exterior of a unit circle. The use of the FFT technique makes the execution of the computation very fast. The method developed can be applied to the computation of incompressible flow past an arbitrary 2-D body, to that of the apparent mass coefficients of the cross-sections, and to the generation of the orthogonal, con-formal grid... A systematic method of numerical conformal mapping is developed in this paper to map the exterior of an arbitrary 2-D body having several discontinuities of surface slop onto the exterior of a unit circle. The use of the FFT technique makes the execution of the computation very fast. The method developed can be applied to the computation of incompressible flow past an arbitrary 2-D body, to that of the apparent mass coefficients of the cross-sections, and to the generation of the orthogonal, con-formal grid used in finite difference method. Several examples presented show that the present method has an order faster in computation of the grid generation than that of the usual Thompson's method, and that the grid generated has the orthogonality everywhere. The another superiority is that, for many problems, the governing equation usually takes the especially simple form on the mapping plane. 本文发展了一种系统的一次性数值保角转绘方法,可以将一含多个角点的任意曲边多边形的外部区域,一次保角转绘为单位圆的外部区域。由于方法中应用了快速富氏变换技术(FFT),计算速度很快。这种方法可应用于计算绕任意物体的二维不可压位流,计算二维物体的表观质量系数,生成有限差分计算中所需的正交保形贴体坐标网格。对几种外形的计算结果表明,在网格生成方面,所需计算机时与Thompson方法相比,少一个数量级,网格正交性处处保证。此外,对许多问题,变换平面内的主管方程特别简单。 This paper presents a vector algorithm for constructing the convex hull of a set of planar discrete points.The computing method is to remove all or most points lying in the interior of the hull and reserve the possible vertices of the exterior boundary of the hull before the convex hull is constructed.Therefore,the number of the points for constructing the convex hull is greatly reduced.The computing rate is improved and the constructed efficiency is enhanced. 本文提出一种矢量运算方法确定平面离散点集凸包 ,其原理是在构建凸包前 ,通过矢量计算判别出位于凸包多边形内部的点 ,预先将其删去 ,保留凸包多边形外部边缘的点 ,从而减少了构建凸包的离散点数目 ,提高运算速度。新算法达到O(nlogn)时间复杂度下限 ,简单且易于实现 . On the basis of investigating the characters of an outer Voronoi diagram (OVD), we create a tree structure to help estimate the numbers of Voronoi vertices and edges. Our conclusion shows that an OVD has at most n+s+2×h-r-t-2 vertices and 2×n+2×s+3×h-r-t-3 edges, where h, n, s are the number of boundaries, edges and convex vertices of a polygon respectively, and r, t are the number of the edges and vertices on the convex hull of a polygon respectively. Average numbers of Voronoi vertices and edges on the boundary... On the basis of investigating the characters of an outer Voronoi diagram (OVD), we create a tree structure to help estimate the numbers of Voronoi vertices and edges. Our conclusion shows that an OVD has at most n+s+2×h-r-t-2 vertices and 2×n+2×s+3×h-r-t-3 edges, where h, n, s are the number of boundaries, edges and convex vertices of a polygon respectively, and r, t are the number of the edges and vertices on the convex hull of a polygon respectively. Average numbers of Voronoi vertices and edges on the boundary of a Voronoi region are also discussed. This work can be used to study the complexity of collision detection algorithms based on OVD. 在对多边形P的外部Voronoi图的性质进行研究的基础上,将其表示成树结构并利用树结构的性质给出了其所含Voronoi顶点和边数的上界n+s+2×h-r-t-2和2×n+2×s+3×h-r-t-3,其中, h, n 和s 分别是P的边界、边和凸顶点的数目; t 和r 分别是位于P的凸包上的顶点和边数同时,给出了每一个Voronoi区域所包含顶点和边数的平均值估计文中工作在基于多边形外部Voronoi图的碰撞检测算法的复杂度分析方面有着重要作用 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关多边形的外部的内容 在知识搜索中查有关多边形的外部的内容 在数字搜索中查有关多边形的外部的内容 在概念知识元中查有关多边形的外部的内容 在学术趋势中查有关多边形的外部的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社