摘要
在原有凸包推进算法的基础上,提出了一种针对散乱点集的快速生成TIN的算法。通过在三角形外接圆的最小网格覆盖中查找点扩展三角形,使得每次查找的点的个数与且只与散乱点的分布有关,而与散乱点集的大小无关;同时利用有向凸包和动态修正前沿圈等技术避免生成重复三角形,从而大大提高了建网的速度。实践证明,该算法具有可操作性和较强的实用性。该算法实现了两类基于不规则三角网数字地面模型的分析应用。
Based on original convex hull advancing front algorithm, a fast generation algorithm for TIN in light of scattered points set is proposed in this paper. The algorithm searches the points inside the least grid-coverage of triangle＇s eircumcirele to expend the triangle, by this means, the number of the candidate points searched each time only correlates to the distribution of the scattered points but not the size of the scattered points set. In addition, the technologies of directed convex hull and dynamic modification of front-edge-list are introduced to the algo- rithm in order to prevent from building repeat triangles. Practice proves that the algorithm has operability and stronger practicability. The algorithm realised the analysis and application of two kind of Digital Terrain Models built by triangulated irregular network.
出处
《计算机应用与软件》
CSCD
2009年第9期269-271,285,共4页
Computer Applications and Software
