• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (1): 69-72.

• 论文 • 上一篇    下一篇

基于VTK的散乱点集三角网重建算法研究

胡雅俊 智明 肖文生   

  • 出版日期:2008-01-01 发布日期:2010-05-19

  • Online:2008-01-01 Published:2010-05-19

摘要:

散乱点数据在机械产品测量造型、地理信息系统等众多领域来说都较易得到。为使VTK可视化平台中的数据处理及面显示应用面更广,本文设计了基于平坦度的自适应增量的网格构造算法,将散乱点数据格式转换成VTK数据格式,从而利用VTK流水线机制进行面绘制。该算法实现了空间直接三角剖分,而且动态调整逼近误差。实验证明,该算法能
高效、可靠地生成贴近原始曲面的三角网格,并取得较理想的VTK绘制效果。该算法对于三角剖分问题和VTK可视化平台的数据处理具有一定的理论和实际意义。

关键词: 散乱点 VTK 平坦度 三角剖分

Abstract:

Scattered point data can be easily generated in most fields such as reverse engineering for mechanical products and geographic information systems. In order to extend the applicability of data processing and surface rendering on the VTK-based visualization platform, a new method is presented which canconvert scattered points into the standard VTK data format. As the core of the conversion process, an algorithm of incremental mesh construction is int   roduced, along with the self-adapting flatness. Thus surface rendering can be carried out with the VTK pipeline. The algorithm implements the triangulat  ion in three dimensions directly and adjusts the approaching error parameter dynamically. The results of the examples show that surfaces of the models c an be reconstructed in an effective and reliable way. The method is significant for both the triangulation analysis and the VTK visualization process.

Key words: scattered point, VTK, flatness ;triangulation