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

图标索引 历史查询
 

graph drawing
相关语句
没有找到相关双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph drawing
Grasper-CL includes several advances in graph drawing.
      
Although graph drawing has been extensively studied, little attention has been paid to the problem of node overlapping.
      
In this paper, we survey algorithmic techniques for graph drawing that support the expression and satisfaction of user-defined constraints.
      
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph.
      
Canonical Ordering Trees and Their Applications in Graph Drawing
      
更多          


In this article we discuss the design of double-crystal monochromator control system of 3B3 middle-energy beam line in Beijing Synchrotron Radiation Factory. The multimedia timer and multithread technique were used to solve the high speed data transmission in serial port system and data communication in multi-serial port system. The real time graph drawing and dynamic zooming in double-crystal monochromator debugging system accomplished by VC++6.0 were also described.

讨论了北京同步辐射装置(BSRF)3B3 中能光束线双晶单色器控制系统的设计。采用多媒体定时器以及多线程技术,实现高速下数据在串口系统中的传输以及多串口数据通讯问题。在双晶单色器调试系统中,在 VC++6.0 中实现图形图像的实时绘制和动态缩放。

A new planar graph planar orthogonal straight-line drawing algorithm is proposed which is based on genetic algorithm. The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, and thus obtains a planar orthogonal straight-line drawing of the planar graph....

A new planar graph planar orthogonal straight-line drawing algorithm is proposed which is based on genetic algorithm. The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, and thus obtains a planar orthogonal straight-line drawing of the planar graph. The new algorithm is of following advantages: the method is simple and it is easier to be implemented and also the figure drawn is beautiful, finally, the algorithm is stable. The experiment results show that the final results of the drawing algorithm don't rely on the initial status of graphs.

提出了一种基于遗传算法的新的平面图平面正交直线画图算法,算法将平面图画图问题转化为约束优化问题,根据画图问题选定的美观准则构造约束函数,用遗传算法求解目标函数的最优解的近似值,从而得到平面图的平面正交直线画法。新算法的优点是方法简单,易于实现,画出的图形美观,算法稳定性好。实验结果表明,画图算法的最终结果不依赖于图的初始状态。

The digitization for engineering record curves is very important for the digital storage, reuse, share and exchange of these curves. The authors propose a new method for automatic detection and data restoration of graph drawing curves with the theory and technology of image processing and pattern recognition. The method includes the intersecting curve separation based on medial axis transformation, the seed restoration based on spatial-frequency information fusion, and the disconnected curve detection...

The digitization for engineering record curves is very important for the digital storage, reuse, share and exchange of these curves. The authors propose a new method for automatic detection and data restoration of graph drawing curves with the theory and technology of image processing and pattern recognition. The method includes the intersecting curve separation based on medial axis transformation, the seed restoration based on spatial-frequency information fusion, and the disconnected curve detection based on second order differentiation. The advantages of this method are the fast computation, high automatization and intelligence.

工程记录曲线的数字化对实现这些资源的数字存储、利用以及共享和交流具有非常重要的意义。作者采用图像处理和模式识别的理论与技术,提出一种新方法实现坐标纸绘制曲线的自动提取和数字恢复。这种方法包括基于中轴变换的交叉曲线分离的方法,基于空域-频域信息融合的种子复原和二阶导数的间断曲线的提取方法。该方法的优点是速度快,自动化和智能化程度高。

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

 


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

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