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

图标索引 历史查询
 

convex segment
相关语句
  相似匹配句对
     On h Convex Function
     h凸函数
短句来源
     Principle and Calculation of the Carvilinear Frictional Drive at the Convex Arc Segment of the Belt Conveyer
     带式输送机凸弧段曲线摩擦驱动原理及计算
短句来源
     Another Form of the Formula for the Kinematic Measure of a Segment Contained in a Convex
     凸域内定长线段的运动测度的另一种表达式
短句来源
     The Architecture of CONVEX C-I Minisupercomputer
     CONVEX C-1小巨型计算机的体系结构
短句来源
     The deleted segment in Ae.
     ovata的缺失片段比普通小麦和Ae.
短句来源
查询“convex segment”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  convex segment
For E-junctions, we try first the labeling with the middle-segment labeled as a convex segment and the remaining segments labeled as arrows.
      


A novel algorithm is proposed in the paper for line clipping against a general polygon. By the algorithm, the polygon edges are decomposed sequentially into certain segments, under the constraint that each segment is able to form a local convex polygon. These segments are called convex segments, and a BSP tree is constructed for the segments. During the line clipping process, the BSP tree is employed to search for the convex segments in intersection with the line, and...

A novel algorithm is proposed in the paper for line clipping against a general polygon. By the algorithm, the polygon edges are decomposed sequentially into certain segments, under the constraint that each segment is able to form a local convex polygon. These segments are called convex segments, and a BSP tree is constructed for the segments. During the line clipping process, the BSP tree is employed to search for the convex segments in intersection with the line, and then calculate the clipped line against the convex segments. The algorithm shows nice performance by experiments that the time complexity of the algorithm is in between O(log N) and O(N) adaptively, and better than O(N) in most cases.

将多边形窗口的边顺序地分割成一些片段,使得每个片段都能局部地形成一个凸多边形,称为凸片段,并建立一个二叉树来管理这些凸片段·在裁剪计算时,先根据二叉树快速地找到与被裁剪线段相交的凸片段,再利用高效的凸多边形线裁剪算法对这些凸片段进行裁剪操作·文中算法能有效地降低裁剪计算的时间复杂度,使其在O(logN)~O(N)之间自适应地变化,且大部分情况下时间复杂度小于O(N)·

 
图标索引 相关查询

 


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

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