助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   多边形的内部 的翻译结果: 查询用时:0.01秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

多边形的内部
相关语句
  “多边形的内部”译为未确定词的双语例句
     Held proves that the inner Voronoi diagram of a simple polygon has at most n+k 2 vertices and 2(n+k) 3 edges, where n is the number of the polygon’s vertices and k is the number of reflex vertices.
     Held 证明了一个简单多边形的内部 Voronoi 图最多有 n+k 2 个顶点和 2(n+k) 3条边,其中 n 和 k 分别是多边形的顶点和内尖点数.
短句来源
     Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons
     多连通多边形的内部Voronoi图的顶点和边数的上界(英文)
短句来源
  相似匹配句对
     Analysis of the interior environment.
     ·内部环境分析。
短句来源
     Internal Controls
     内部控制
短句来源
     Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons
     多连通多边形的内部Voronoi图的顶点和边数的上界(英文)
短句来源
     TRIANGULATION OF A POLYGON AND ITS APPLICATION
     多边形的三角剖分及应用
短句来源
     CUTTING THE GENERAL POLYGONS
     一般多边形的切割
短句来源
查询“多边形的内部”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  interior of a polygon
The art gallery problem asks how many guards are sufficient to see every point of the interior of a polygon.
      


Presents an algorithm for deciding whether a point lies within a polygon. It is bed on the number of intersections of rays radiating from the point and number of edges of the polygon, as well as the necessary number of relocations of the point.The number of intersections is then found again. The algorithm requires O(n) arithmetic operations and O(n) comparisons, n being the number of vertices of the polygon.

提出判定点是否在多边形内部的一种算法,其方法是判定射线与多边形边的交点数目以及必要时移动该点的位置,再判定交点的数目.该算法的时间复杂性为O(n)次四则运算和O(n)次比较,其中n为多边形的顶点数.

The kernel of simple polygon is a point set within the polygon where all boundaries of polygon are visible from any point within the kernel. A new algorithm based on the conclusions available in references is introduced which can quickly determine whether the kernel of simple polygon is empty, and easily find a vertex of kernel when the kernel is not empty. Through uncomplicated generalization the algorithm can find an edge of kernel and then the kernel itself. It is comprehensible and practical to implement....

The kernel of simple polygon is a point set within the polygon where all boundaries of polygon are visible from any point within the kernel. A new algorithm based on the conclusions available in references is introduced which can quickly determine whether the kernel of simple polygon is empty, and easily find a vertex of kernel when the kernel is not empty. Through uncomplicated generalization the algorithm can find an edge of kernel and then the kernel itself. It is comprehensible and practical to implement.

简单多边形的核是位于多边形内部的一个点集 ,从其中任意一点可见多边形的全部边界 .文中考查了简单多边形的核在构成方面的性质 ,结合已有结果 ,提出了一个算法 .该算法能快速地判断简单多边形是否有核 ,有核时可以方便地求出核中一个顶点 .对算法进行简单扩展 ,可以求得核中一边及完整的核 .给出的算法容易理解 ,便于实现 ,可以广泛地应用于一些涉及可见性的问题及许多其它问题中

: A constrained Delaunay triangulation cutting algorithm is proposed for computing the triangulated irrgular network of a set of irregularly located planar points.The algorithm is designed to create a constrained maximum empty-circle convex polygon network firstly,then constrained Delaunay triangulation inside these polygons is followed.It is demonstrated in this paper that the constrained maximum empty-circle convex polygon network of a set of planar points is unique,and the ambiguty of constrained Delaunay...

: A constrained Delaunay triangulation cutting algorithm is proposed for computing the triangulated irrgular network of a set of irregularly located planar points.The algorithm is designed to create a constrained maximum empty-circle convex polygon network firstly,then constrained Delaunay triangulation inside these polygons is followed.It is demonstrated in this paper that the constrained maximum empty-circle convex polygon network of a set of planar points is unique,and the ambiguty of constrained Delaunay triangulation exists only in the inside of the polygons.The introduction of constrained maximum empty-circle convex polygon successfully solves the degeneracy problem.

文章提出了一种基于切割的平面散乱点集约束Delaunay三角剖分算法。该算法的基本思路是首先对平面散乱点集作约束最大空圆凸多边形剖分,然后对多边形的内部再作约束Delaunay三角形剖分。文章还证明了平面散乱点集的约束最大空圆凸多边形剖分是唯一的以及约束Delaunay三角剖分的不唯一性仅仅体现在约束最大空圆凸多边形的内部。使用约束最大空圆凸多边形的概念消除了由于“退化”现象(三个以上的点共圆)带来的算法上的潜在错误。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社