计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (3): 182-184.

• 图形、图像、模式识别 • 上一篇    下一篇

一种无记忆点云迭代简化算法

杜晓晖   

  1. 华北计算技术研究所，北京 100083
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2012-01-21 发布日期:2012-01-21

Memoryless iterative point cloud simplification algorithm

DU Xiaohui   

  1. North China Institute of Computing Technology, Beijing 100083, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2012-01-21 Published:2012-01-21

PDF

摘要： 针对目前点云迭代简化算法在简化过程中需要保持原始模型信息而占用较大内存的问题，提出了一种无记忆点云迭代简化算法，简化过程中不需要记录原始模型相关几何信息。该算法使用体积优化和距离优化计算点对收缩后的最优点位置并对点对进行排序。实验表明，该算法可以在内存占用较小的情况下得到误差较小的简化模型。

关键词: 点云简化, 无记忆简化, 迭代方法, 点对收缩

Abstract: The existing algorithms of iterative point cloud simplification often maintain the original model’s information and occupy large memory during the process of iterative simplification. This paper presents a memoryless iterative algorithm which need not record geometric information of the original point cloud model. This algorithm uses the volume and distance optimizations to calculate the new point and sort order of the point-pair contractions. The experimental results show that the novel algorithm can be smaller in average errors while occupying lower memory.

Key words: point cloud simplification, memoryless simplification, iterative method, point-pair contraction

京ICP备13024262号-1
Copyright © 《计算机工程与应用》编辑部
技术支持：北京玛格泰克科技发展有限公司
总访问量
今日访问
在线人数