全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于非均匀细分的散乱点云数据精简算

, PP. 193-196

Keywords: 逆向工程,散乱点云,非均匀细分,数据精简,边界数据保护

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对海量散乱点云数据精简问题,提出了基于非均匀细分的精简算法。采用八叉树结构对点云数据进行空间分割,由分割结果建立k邻域。对k邻域内的散乱点进行二次曲面拟合,以拟合曲面的平均曲率为判据决定是否对八叉树空间实行非均匀细分,细分过程中由数据点之间的最大间隔角决定细分程度。构造曲率差函数,识别出边界数据点,对其进行数据保护。该算法对具有曲率多样化特点的点云数据的精简具有实用性,通过实验验证了该算法的可靠性和准确性。

References

[1]  Lee K H,Woo H,Suk T.Point data reduction using 3D grids[J].The International Journal of Advanced Manufacturing Technology,2001,18(3):201~210.
[2]  Woo H,Kang E,Wang S.A new segmentation method for point cloud data[J].International Journal of Machine Tools and Manufacture,2002,42(2):167~178.
[3]  Yuen P,Mokhtarian F,Khalili N.Curvature and torsion feature extraction from free-form 3-D meshes at multiple scales[J].IEE Proceedings-Vision,Image and Signal Processing,2000,147(5):454~462.
[4]  Milroy M J,Bradley C,Vickers G W.Segmentation of a wrap-around model using an active contour[J].Computer Aided Design,1997,29(4):299~320.
[5]  Goodsell G.On finding p-th nearest neighbors of scattered points in two dimensions for small p[J].Computer Aided Geometric Design,2000,17(4):387~392.
[6]  Piegl L A,Tiller W.Algorithm for finding all k nearest neighbors[J].Computer Aided Design,2002,34(2):167~172.
[7]  Xu Dong,Zhang Quanfang,Liu Xinguo,et al.Geometry compression for general polygon meshes[J].Journal of Computer Aided Design & Computer Graphics,2002,14(9):815~819.
[8]  Yang M,Lee E.Segmentation of measured data using a parametric quadric surface approximation[J].Computer Aided Design,1999,31(7):449~457.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133