节点文献

基于三角网的等值线填充算法研究

Study on algorithm of isoline filling based on triangle mesh

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李强李超甘建红

【Author】 LI Qiang1,LI Chao2,GAN Jianhong3 1.College of Computer Science and Technology,Chengdu University of Information and Technology,Chengdu 610225,China 2.Development and Planning Department,Chengdu University of Information and Technology,Chengdu 610225,China 3.College of Software,Chengdu University of Information and Technology,Chengdu 610225,China

【机构】 成都信息工程学院计算机学院成都信息工程学院发展规划处成都信息工程学院软件学院

【摘要】 通过对现有等值线填充算法的深入研究,提出了一种覆盖填充等值线的算法。该算法把等值线分类为凸包边封闭等值线(CHCL)和自封闭等值线(SCL),充分利用等值线的特点,使对等值线拓扑关系及填充颜色的判定达到最简化。对于CHCL采用对凸包边等值点及凸包点追踪来确定填充区域,对于SCL则根据拓扑关系以最外层的SCL为根节点构建一棵多叉树以确定填充顺序.通过对等值区域依次反复覆盖填充,最终完成所有等值线的填充。采用了一种穿过原始离散点平滑等值线的算法,减小了等值线平滑造成的精度损失。并运用客户端语言AS3.0(ActionScript3.0)实现了算法模型。实验结果表明,该算法简单易于实现,而且运算速度能满足业务需要。

【Abstract】 With deep research on isoline filling algorithm,a new cover algorithm of isoline filling is proposed in this paper.This algorithm classifies isolines as Convex Hull Closed Isoline(CHCL)and Self Closed Isoline(SCL).Taking full advantage of isoline’s characteristic,the judgement of topological relation and filling color is simplified mostly.For CHCL isoline,tracing convex hull isoline-points and convex points are employed to determine filling area,and a multi-branches tree which is established by topological relation is adopted to determine the order of filling for SCL isoline.By repeating cover filling isoline-area orderly,all the isoline-area filling is accomplished.For smoothing isoline,a new method which can decrease the precision loss of isoline smoothing is adopted.Algorithm model is realized using client side programming language-ActionScript3.0,and it shows that this algorithm is easy to implement and the time cost can satisfy the business demands.

【基金】 成都信息工程学院人才引进项目(No.KYTZ201040)
  • 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2013年05期
  • 【分类号】TP391.41
  • 【被引频次】20
  • 【下载频次】310
节点文献中: 

本文链接的文献网络图示:

本文的引文网络