基于空间无序点云的层次构造三角化方法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP391.41

基金项目:

国家863项目(2007AA01Z314)


Layering triangulation method based on disordered space points
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    本文描述了一种新的利用空间无序点云重构三维模型的算法,利用分层扫描的原理将无序的三维点云进行平面投影,使用矢量外边界扫描算法将点信息提取为线段信息,由于分层的有序性使得线段之间存在着良好的拓扑关系,经过在有序线段中提取拐点矢量,连接上下两层相关点,点模型就完成了三角化。该方法计算速度快,拓扑清晰,且不会出现失真(泊松表面重建)和空洞现象(区域增长法)。

    Abstract:

    This paper described an algorithm that uses space disordered point cloud to reconstruct three-dimensional model. Layer-based scanning principle was used to project disordered three-dimensional points cloud to a plane. Outside boundary-scan algorithm based on vector direction was used to extract line information from points information. As a result of stratification, good topological relation between lines was achieved. After extracting inflection point from ordered line segments, and connecting the upper and lower layer related points, the model is complete triangulation. The algorithm is fast, good topology structure, and can avoid distortion (poisson surface reconstruction) and empty phenomena (region-growing method)

    参考文献
    相似文献
    引证文献
引用本文

成宏璟. 基于空间无序点云的层次构造三角化方法[J]. 科学技术与工程, 2010, (9): .
chenghongjing. Layering triangulation method based on disordered space points[J]. Science Technology and Engineering,2010,(9).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2009-12-21
  • 最后修改日期:2010-01-04
  • 录用日期:2009-12-31
  • 在线发布日期: 2010-03-26
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注