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

图标索引 历史查询
 

多边形窗口
相关语句
  polygonal window
    An Efficient Algorithm of Line Clipping Against Polygonal Window Based on the Vertex Encoding
    基于顶点编码的多边形窗口线裁剪高效算法
短句来源
    Bisearch-Based Line Clipping Algorithm Against a Convex Polygonal Window
    凸多边形窗口线裁剪的折半查找算法
短句来源
    Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window.
    已有的线裁剪算法都是针对矩形窗口或凸多边形窗口的。
短句来源
    Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window.
    已有的多边形裁剪算法都是针对矩形窗口或凸多边形窗口进行的。
短句来源
    A new concept of the window's vertex encoding is proposed for the first time based on the essential characteristic of the line clipping against polygonal window.
    从多边形窗口线裁剪的本质特征出发 ,首次提出窗口顶点编码的新概念 .
短句来源
  polygon window
    A Clipping Algorithm Based on Cross Product Method for Convex Polygon Window
    基于叉积法的凸多边形窗口裁剪算法
短句来源
    Second, after limitations of present algorithms are analyzed, two improved clipping algorithms of polygon against rectangle window and line against polygon window are presented.
    其次在分析现有算法不足的基础上提出了矩形窗口多边形裁剪和一般多边形窗口线裁剪的改进算法。
短句来源
    The new line against polygon window clipping algorithm which makes full use of two judgement conditions to confirm noneffective intersections between the lines and the polygon edges can only calculate the effective intersections and increases the efficiency of the clipping. Third, a new 3-d clipping algorithm of line against spherical surface window is introduced for the first time.
    一般多边形窗口线裁剪的改进算法充分利用确定被裁线段与多边形边无交的两个判断条件,对完全不可见线段以及与被裁线段无有效交点的多边形边进行了排除,只有当线段与多边形边有有效交点时才求交,避免了不必要的求交,提高了算法效率。
短句来源
    Some algorithms of line clipping have been very perfect, especially the algorithms about line clipping by the rect window, but the line clipping algorithms of general polygons window haven't been developed well. What's more, polygon clipping algortithm of the polygon window haven't been widely noticed.
    经过了近半个世纪的讨论和探索,一些线裁剪算法越来越完善,尤以矩形窗口的线裁剪方法最为突出,但一般多边形窗口的线裁剪算法并不是十分理想,而多边形窗口的多边形裁剪算法还没有受到广泛的关注。
短句来源
    Second, an algorithm about general polygons clipped by the general polygon window is designed in the paper.
    接着,设计了一个任意多边形窗口的多边形裁剪算法。
短句来源
  “多边形窗口”译为未确定词的双语例句
    Line Clipping Based on General Polygons
    基于一般多边形窗口的线裁剪
短句来源
    A New Algorithm of Line Clipping for Convex Polygons
    凸多边形窗口线裁剪的新算法
短句来源
    Efficient Algorithm for Line Clipping against General Polygon
    一般多边形窗口的有效线裁剪算法
短句来源
    A Scan Strip Based Algorithm for Line Clipping against Arbitrary Polygons
    基于扫描带的任意多边形窗口线裁剪算法
短句来源
    A new algorithm of line clipping for convex polygons with n edges is proposed.
    凸多边形窗口的线裁剪是用多边形窗口裁剪多边形的基础 . 为此 ,提出了凸 n边形窗口的线裁剪新算法 .
短句来源
更多       
查询“多边形窗口”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  polygonal window
Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
      
This paper presents a new algorithm for line clipping against a polygonal window by exploiting the local relationship between each line segment and the polygon.
      
Finally, instead of encoding the endpoints of all line segments with respect to the polygonal window, each vertex of the polygon is encoded, taking the line segment to be clipped as reference.
      
We present an algorithm for clipping a polygon or a line against a convex polygonal window.
      
  polygon window
With the summation of the vertex codes, it can be verified whether the line segment is separated from or potentially intersects the polygon window.
      


In this paper, an algorithm for line clipping against an arbitrary polygon window is presented. By means of different mathematical representations of straight line and line segment, the process of clipping is reduced to the determination of three simple conditions. The idea of the algorithm is that in the entire process of clipping, determinations are prior to calculations of intersection point but the work of determination is not more than that of other algorithms, division operations are needed only when the...

In this paper, an algorithm for line clipping against an arbitrary polygon window is presented. By means of different mathematical representations of straight line and line segment, the process of clipping is reduced to the determination of three simple conditions. The idea of the algorithm is that in the entire process of clipping, determinations are prior to calculations of intersection point but the work of determination is not more than that of other algorithms, division operations are needed only when the line segment to be clipped crosses edges of window polygon, the edges of window polygon which do not cross the line segment to be clipped are quickly rejected. Thus, divisions and other calculations are reduced to minimum and the efficiency of line clipping against a polygon window is greatly improved.

本文的裁剪策略是,巧妙地利用窗口与线段两种不同数学描述,将有效交点的判定、求交运算及包含性检验,归结为三个条件的判别。这三个条件形式简明,运算量小,整个裁剪过程,只有在存在有效交点时才做除法,把除法以及其它计算量减少到最低限度,从而大大提高了裁剪效率。经多次用不同类型的多边形窗口试验表明,该算法程序量少,运算速度快,不仅可以高效地裁剪,而且适用于几何图形并、交、差,立体消隐中有关多边形与线段的处理,还可以在工程CAD中利用零件图生成装配图。

Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window. No algorithm for line clipping based on a generalized polygon (or concave polygon) is available in the literature. It is quite valuable to develop such algorithms, because they are of practical use just like the hidden line problem. In this paper, a line clipping algorithm based on a generalized polygon is presented. The calculation effort of the algorithm is small.

已有的线裁剪算法都是针对矩形窗口或凸多边形窗口的。对于一般的多边形窗口(包括凹多边形)的线裁剪,目前尚无有效的算法。开发这种算法是很必要的,因为它在计算机图形学中有很广泛的应用,如物体的消隐处理等。因此,提出一个对于一般多边形窗口的线裁剪算法,并给出了最优实现。

In this paper, improved algorithms for 2D Line clipping against convex and non -- con- vex windows, which are derived from the Cohen -- Surtherland and Liang -- Barsky's algorithms and implemented in MicroSoft C, are presented. They also can easily be modified for dealing with problems of holes.

提出了对凸多边形和凸多边形窗口的二维线裁剪算法的改进。改进的算法是在Cohen-Sutherland算法和粱友栋-Barsky算法的基础上导出的,它也易于修改来处理空洞问题,并用MSC语言实现过。

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

 


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

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