摘要
对点模型处理阶段的简化进行研究,提出了一种基于数据包络的简化算法。该算法使用点对合并的聚合方法来减少点元的数量;构造内外包络时,使用二分法寻找最佳偏移值。在点对合并的过程中使用八叉树结构进行空间分解,使用贪婪算法来选择点对。实验表明,方法简单,保持了模型的尖锐特征,并且高效地实现了对模型的简化。
To investigate the simplification of point-based model during the processing phase, a method based on data envelopment using the convergence of points to reduce the number of point elements was presented. The algorithm of dichotomy was applied to find the optimum declination value when the construction of inner and outer envelopment was designed. Meanwhile, space decomposition was implemented by eight-branch trees structure in the process of the merger of couple-point which was selected by greedy choice algorithm. The experiments have shown a highly effective and simple method maintaining the sharp features of the models.
出处
《计算机应用》
CSCD
北大核心
2007年第2期355-357,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(50207004)
关键词
点图形学
点模型
包络
增量聚合
八叉树结构
贪婪算法
point-based computer graphics
point-based model
envelopment
increment polymerization
eight-branch trees structure
greedy algorithms