摘要
针对非规则复杂区域填充等值线图的绘制问题,提出了一种非规则的、复杂区域填充等值线图绘制算法。算法基本思想是:首先应用环形矩形域分割数据点;然后分区逐步插入新点快速生成二维约束Delaunay三角网格化;最后应用三叉树递归原理,快速等值剖分Delaunay三角形,颜色填充绘制等值域。通过研究实例表明,该方法具有很好的实时显示与应用效果。
This paper proposes an algorithm of filling contour about irregular and complicated fields. The idea of this algorithm is as follows. At first, the multi-annular rectangles are used to separate the node of data. In this way, the point in the field is distributed in the annular rectangle field. And then, a new point is inserted step by step from the annular rectangle field and quickly creates 2D constrained Delaunay triangulation until it is inserted point of all annular rectangle field. At last, the three-branch tree recursive principle is used to cut Delaunay triangulation equivalently and to fill the equal field by color of attribute. It is fast created to graphics of filling complicated isoline. Experiment results show that this method has good effects and real-time display.
出处
《成都理工大学学报（自然科学版）》
CAS
CSCD
北大核心
2005年第4期414-418,共5页
Journal of Chengdu University of Technology: Science & Technology Edition
基金
"地质灾害防治与地质环境保护"国家专业实验室开放基金资助项目
关键词
二维约束Dclaunay三角化
三叉树递归
环形矩形域剖分算法
复杂等值图快速绘制
2D constrained Delaunay triangulation
three-branch tree recursion
a separate algorithmof annular rectangles
fast drawing of filling complicated contour
