助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   多边形的布尔运算 的翻译结果: 查询用时:0.008秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

多边形的布尔运算
相关语句
  polygon boolean operation
     POLYGON BOOLEAN OPERATION BASED ON EDGES RECOGNITION ALGORITHM
     基于边界识别的多边形的布尔运算
短句来源
     This paper tries to base polygon Boolean operation on the recognition of the polygon and simplify the stipulation of the line segment attribute, so as to make this operation more effective and more general.
     本文试图将多边形的布尔运算建立在多边形识别的基础上,以简化线段的属性规定,使算法更有效,更具有一般性。
短句来源
     Polygon Boolean operation is a key algorithm way in computer graphics.
     多边形的布尔运算是计算机图形学的一个关键算法.
短句来源
  “多边形的布尔运算”译为未确定词的双语例句
     Boolean operation for polygon with holes
     带有孔洞的多边形的布尔运算
短句来源
     Boolean Operations on General Planar Curved-Edge Polygons
     平面扩展简单多边形的布尔运算
短句来源
     Secondly, some foundational arithmetic such as the division of concave polygon, the polygon's boolean operation, the transform from circle to polygon, the pick-up of model top surface were designed particularly based on OpenGL.
     然后,基于图形库OpenGL完成了包括凹多边形的分割、多边形的布尔运算、圆的多边形转化、模型上表面获取等基础算法;
短句来源
     The algorithm investigated in this paper does match these definitions,and is simple. It is proved that there are not undue line segments in the result set of polygons.
     在这种定义下作多边形的布尔运算比较简单,从理论和实践均证明运算结果的多边形不会出现不希望有的线段,而且在这种多边形定义下,多边形集对布尔运算也是封闭的.
短句来源
     The declines dimension algorithm is highly an effective Boolean operation algorithm of two dimensions polygon to include the polygon that take the hole, it is also an algorithm for scanning conversion with Boolean operation two processes matching second for first, the same is also an algorithm for expanding three dimensions.
     该降维算法是一个高效的二维多边形包括带有孔洞的多边形的布尔运算算法,也是一个将扫描转换和布尔运算两个过程合二为一的算法,同样也是一个可以推广到三维的算法.
短句来源
  相似匹配句对
     Boolean operation for polygon with holes
     带有孔洞的多边形的布尔运算
短句来源
     Boolean Operations on General Planar Curved-Edge Polygons
     平面扩展简单多边形的布尔运算
短句来源
     POLYGON BOOLEAN OPERATION BASED ON EDGES RECOGNITION ALGORITHM
     基于边界识别的多边形的布尔运算
短句来源
     Polygon Boolean operation is a key algorithm way in computer graphics.
     多边形的布尔运算是计算机图形学的一个关键算法.
短句来源
     Boolean Operation on Polygons
     多边形组的布尔运算
短句来源
查询“多边形的布尔运算”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Boolean operations on two sets of polygons are studied in this paper.The class of polygons is defined as an open set,and the result of all Boolean operations are defined as an open set too.Under these definitions,the class of polygons is a closure.The algorithm investigated in this paper does match these definitions,and is simple.It is proved that there are not undue line segments in the result set of polygons.

本文讨论了二组多边形的布尔运算.多边形定义为全部内点的开集,对多连形边界的交点也作了相应的定义.在这种定义下作多边形的布尔运算比较简单,从理论和实践均证明运算结果的多边形不会出现不希望有的线段,而且在这种多边形定义下,多边形集对布尔运算也是封闭的.

Polygon Boolean operation is an important question in graphics. But the present algorithms which stipulate line segments attribute are all complicated, and not effective to certain conditions. This is because we have not realized the fact that the operation objects and operation results are all polygons. This paper tries to base polygon Boolean operation on the recognition of the polygon and simplify the stipulation of the line segment attribute, so as to make this operation more effective and more general.

多边形的布尔运算是图形学的一个重要问题,但目前的算法对线段的属性规定均较复杂,且对某些情况还不是很有效,这是因为没有利用运算的对象、结果都是多边形这一事实。本文试图将多边形的布尔运算建立在多边形识别的基础上,以简化线段的属性规定,使算法更有效,更具有一般性。

The solid reconstruction is always a key technology in reverse engineering and the paper deals with a algorithm of features ectraction and three- dimension reconstruction. It may automatically extract featuns from a series of care - sechons.In the algorithm, the feature extraction from the cross - sections of producte can be easily implemented by means of polygonization for each cross - section of products and the intemetion, union and difference algorithms for polygons. The solid reconstruction is simply discussed....

The solid reconstruction is always a key technology in reverse engineering and the paper deals with a algorithm of features ectraction and three- dimension reconstruction. It may automatically extract featuns from a series of care - sechons.In the algorithm, the feature extraction from the cross - sections of producte can be easily implemented by means of polygonization for each cross - section of products and the intemetion, union and difference algorithms for polygons. The solid reconstruction is simply discussed.

本文主要针对逆向工程中的关键问题,特征识别进行了比较深入的研究。由于零件的结构形状的复杂多样,从零件的切片图象识别出零件的各种几何特征,一直是逆向工程中的一个瓶颈。本文采用轮廓多边形化算法以及多边形布尔运算等方法,很好地解决了零件切片图象的特征提取问题,并讨论了实体重构的实现方法。

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

 


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

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