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

图标索引 历史查询
 

多边形的裁剪
相关语句
  “多边形的裁剪”译为未确定词的双语例句
     ON THE CUTTING ALGORITHMS FOR SIMPLEX POLYGONS
     单纯多边形的裁剪算法研究
短句来源
     A Clipping Algorithm of Quadratic Cirves on Window Polygons
     二次曲线窗口上一般多边形的裁剪算法
短句来源
     Algorithm for General Polygon Clipping and Its Applications in Civil Engineering
     任意多边形的裁剪算法及其在土建工程中的应用
短句来源
     The algorithm substitutes the mixed table of intersection points and arcs for the table of intersection points. The tracing mode is similar to Weiler Atherton algorithm, but the tracing target is turned to arcs from vertexes.
     新算法中的主要特点是将原算法中的交点表改为交点、弧段混合表 ,沿用原算法的追踪方式 ,但追踪目标由顶点序列改为弧段序列 ,使之适应具有空间拓扑关系的任意多边形的裁剪要求
短句来源
     In this paper,the clipping of quadratic cirves on window polygons is analyzed in detail,and a clipping algorithm of which is presented through the construction of a series of lists of the apexes,entery points,venting points etc.
     详尽地分析了二次曲线窗口上一般多边形的裁剪问题 ,并通过构造顶交表、入点表、出点表、内表、外表等给出了一般多边形的裁剪算法。
短句来源
更多       
  相似匹配句对
     ON THE CUTTING ALGORITHMS FOR SIMPLEX POLYGONS
     单纯多边形的裁剪算法研究
短句来源
     A Clipping Algorithm of Quadratic Cirves on Window Polygons
     二次曲线窗口上一般多边形的裁剪算法
短句来源
     TRIANGULATION OF A POLYGON AND ITS APPLICATION
     多边形的三角剖分及应用
短句来源
     Reentrant Polygon Olipping
     凹多边形裁剪
短句来源
     CUTTING THE GENERAL POLYGONS
     一般多边形的切割
短句来源
查询“多边形的裁剪”译词为用户自定义的双语例句

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


A New technique for clipping is developed that describes clipping in an exactand mathematical form.The basic ideas form the foundation for a family of algori-thms for line clipping and polygon clipping.This analysis is then embedded in an algorithm.It is shown in performancetests using random data that the new algorithm is much faster than the Sutherlandclipping algorithm.The execution time of new algorithm is about half of what isrequired by the old one.

裁剪问题是计算机图形学的一个基本问题。裁剪速度又是其中最核心的问题。在许多处理裁剪问题的方法中,Ivan Sutherland 1968年提出的编码方法及其算法被公认为是最好的裁剪方法,因而在国际上得到了广泛的应用。目前一条线段的裁剪约需5毫秒,十几条线段的裁剪眼睛就能感觉出来,在复杂图形动态显示中甚至会产生扭曲变形。本文给出裁剪问题的数学定义和解的数学形式;把高维(包括二、三和四维)归结为一维的线裁剪;把多边形的裁剪变成解一元不等式组;从而发展了一套简单、快速而直接的裁剪算法。这种算法比线裁剪的编码方法和多边形逐次裁剪法的速度约快一倍,程序条数约少一半,逻辑简单而且适于一般计算机语言。

An extension to the Sutherland-Hodgman Algorithm for the polygon clipping with the overlapping edges removal is presented. A temporary vertex list and an intersection vertex list are set up when each edge of the polygon is clipped along the clipping window lines. A vertex tracing is performed thereafter to produce sub-polygons as the clipped result. The definition of these sub-polygons are the same as the input one. They do not have overlapping edges with the reentrant characteristics preserved.

本文提出一种对标准Sutherland-Hodeman多边形裁剪算法实行扩充的重迭边消去方法。这种方法在对多边形的各条边沿直线进行裁剪的时候,建立了一个中间结果顶点队列和一个交点队列,然后通过对顶点和交点进行追溯产生出作为裁剪结果的一系列子多边形。这些子多边形的定义方式与输入多边形相同,但不存在重迭的边,这样,保持了可重入性。

The major point of reentrant polygon clipping is to remove those parts of the polygon that lie outside the rectangular window. The output of a reentrant polygon clipping is also polygons, that should be eliminated degenerate boundary and closed blocking ones. It is the major difficulty of reentrant polygon clipping.This algorithm presented, a new concept on polygon clipping, It is called that not only reentrant polygon is clipped by rectangular window, but also rectangular window is clipped by reentrant polygon,...

The major point of reentrant polygon clipping is to remove those parts of the polygon that lie outside the rectangular window. The output of a reentrant polygon clipping is also polygons, that should be eliminated degenerate boundary and closed blocking ones. It is the major difficulty of reentrant polygon clipping.This algorithm presented, a new concept on polygon clipping, It is called that not only reentrant polygon is clipped by rectangular window, but also rectangular window is clipped by reentrant polygon, so it is a interactive clipping algorithm. Rapid computing rate, good functional completeness, Simple programming and saving memony are adventages of the new algorithm. The very difficult problems of reentrant polygon clipping-degenerate boundary and blocked output of closed polygons have been very successfully implemented.The algolithm is coded in FORTRAN 77 and could be executed smoothly on IBM-PC. It has been applied in CAD software package.

多边形裁剪是计算机图形处理及辅助设计的典型课题之一。所谓凹边形裁剪是指凹多边形被矩形窗口裁去位于窗口范围以外的部分。凹多边形经裁剪后的输出应仍然是多边形。但这种多边形应消除退化边界,并且是成(?)的、封闭的、一个或多个多边形。这就是凹多边形裁剪的主要困难。国外已发表了多种凹多边形裁算法。 本文提出一种多边形裁剪的新概念,即不仅凹多边形被矩形窗口裁剪,而且矩形窗口要被凹多边形反裁剪。这是一种相互裁剪算法。 该算法的特点是计算速度快,功能强,程序简单,占用内存少,并能极简便地解决多边形裁剪中最为困难的问题——退化边界问题及多边形的成块输出问题。 该算法用FORTRAN77编程,在微机IBM—PC上运引,取得了良好效果,并已装入机械CAD软件包中。

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

 


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

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