微信服务号

微信订阅号

2025年4月10日 5:44 星期四
首页 > 过刊浏览>2016年第27卷第10期 >2642-2653. DOI:10.13328/j.cnki.jos.005078
PDF HTML阅读 XML下载 导出引用 引用提醒
带洞点云多层同步表面重建方法
作者:
基金项目:

国家自然科学基金（61472224，61472225）；山东省自主创新及成果转化专项（2014ZZCX08201）；山东大学青年学者未来计划（2015WLJH41）；泰山学者建设工程专项经费


Multi-Layers Surface Reconstruction Method for Point Set with Holes
Author:
Fund Project:

National Natural Science Foundation of China (61472224, 61472225); Special Funding of Independent Innovation and Transformation of Achievements in Shandong Province (2014ZZCX08201); Young Scholars Program of Shandong University (2015WLJH41); Special Funds of Taishan Scholar Construction Project

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [20]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    摘要:

    针对法向信息缺失和采样点缺失的带有洞的散乱点云数据，提出了一种高效、高质量的多层同步表面重建方法.首先利用动态等高线检测出含有洞的八叉树节点，并且基于HPR（hidden point removal）映射计算出八叉树顶点的内外状态，建立带有顶点内外标识的空间有向状态八叉树，然后基于八叉树节点内法向测试方法保证基于k近邻表面重建过程中采样点的法向的正确性，且该空间有向状态八叉树可以支持不同层次的点云同步重建，在保证重建结果正确性的前提下，提高重建效率.

    Abstract:

    This paper proposes a multi-layer surface reconstruction method based on a special oriented status octree. The method is designed to handle point sets with missing normal information and with holes. First, the octree cells distributed on holes are detected by active contours. By using hidden point removal (HPR) operator, the inside or outside status of each corner of octree cells are calculated, and the mono-oriented status octree is constructed. Then the normal direction of the initial points set inside the status octree is determined by in-cell normal detection method, and the parallel multi-layer surface reconstruction from k-nearest neighbors is carried out by using the status octree. The proposed method improves the construction efficiency while guaranteeing the construction quality.

    参考文献
    [1] Boissonnat JD.Geometric structures for three-dimensional shape representation.ACM Trans.on Graphics,1984,3(4):266-286.[doi:10.1145/357346.357349]
    [2] Lim SP,Haron H.Surface reconstruction techniques:A review.In:Artificial Intelligence Review.2012.1-20.[doi:10.1007/s10462-012-9329-z]
    [3] Lim CW,Tan TS.Surface reconstruction by layer peeling.Journal of the Visual Computer:Int'l Journal of Computer Graphics,2006,22(9):593-603.[doi:10.1007/s00371-006-0048-9]
    [4] Tamal KD,Samrat G.Tight Cocone:A water-tight surface reconstructor.In:Proc.of the 8th ACM Symp.on Solid Modeling and Applications.Washington:ACM,2003.127-134.[doi:10.1145/781606.781627]
    [5] Ni TG,Ma ZH.A fast surface reconstruction algorithm for 3D unorganized points.In:Proc.of the 2nd Int'l Conf.on Computer Engineering and Technology.Chengdu,2010.7:15-18.[doi:10.1109/ICCET.2010.5485908]
    [6] Carr JC,Beatson RK,Cherrie JB,Mitchell TJ,Fright WR,McCallum BC.Reconstruction and representation of 3D objects with radial basis functions.In:Proc.of the 28th Annual Conf.on Computer Graphics and Interactive Techniques (SIGGRAPH 2001).New York:ACM,2001.67-76.[doi:10.1145/383259.383266]
    [7] Kazhdan M,Bolitho M,Hoppe H.Poisson surface reconstruction.In:Polthier K,Sheffer A,eds.Proc.of the 4th Eurographics Symp.on Geometry Processing (SGP 2006).Switzerland:Eurographics Association,2006.61-70.
    [8] Kazhdan M,Hoppe H.Screened poisson surface reconstruction.ACM Trans.on Graphics (TOG),2013,32(3):Article 29:13.[doi:10.1145/2487228.2487237]
    [9] Ohtake Y,Belyaev A,Alexa M,Turk G,Seidel HP.Multi-Level partition of unity implicits.In:Fujii J,ed.Proc.of the ACM SIGGRAPH 2005 Courses (SIGGRAPH 2005).New York:ACM,2005.Article 173.[doi:10.1145/1198555.1198649]
    [10] Yoshihara H,Yoshii T,Shibutani T,Maekawa T.Topologically robust B-spline surface reconstruction from point clouds using level set methods and iterative geometric fitting algorithms.Computer Aided Geometric Design,2012,29(7):422-434.[doi:10.1016/j.cagd.2012.03.007]
    [11] Lin HW,Tai CL,Wang GJ.A mesh reconstruction algorithm driven by an intrinsic property of a point cloud.Computer-Aided Design,2004,36(1):1-9.[doi:10.1016/S0010-4485(03)00064-2]
    [12] Giraudot S,Cohen-Steiner D,Alliez P.Noise-Adaptive shape reconstruction from raw point sets.Computer Graphics Forum,2013,32(5):229-238.[doi:10.1111/cgf.12189]
    [13] Chen YL,Chen BY,Lai SH,Nishita T.Binary orientation trees for volume and surface reconstruction from unoriented point clouds.Computer Gaphics Forum,2010,29(7):2011-2019.[doi:10.1111/j.1467-8659.2010.01787.x]
    [14] Xie H,McDonnell KT,Qin H.Surface reconstruction of noisy and defective data sets.In:Proc.of the Conf.on Visualization 2004.IEEE Computer Society,2004.259-266.[doi:10.1109/VISUAL.2004.101]
    [15] Zhao W,Gao S,Lin H.A robust hole-filling algorithm for triangular mesh.The Visual Computer,2007,23(12):987-997.[doi:10.1007/s00371-007-0167-y]
    [16] Dey TK,Giesen J,Hudson J.Delaunay-Based shape reconstruction from large data.In:Proc.of the IEEE Symp.on Parallel and Large-Data Visualization and Graphics.2001.19-27.[doi:10.1109/PVGS.2001.964399]
    [17] Allègre R,Chaine R,Akkouche S.A streaming algorithm for surface reconstruction.In:Proc.of the Eurographics/ACM SIGGRAPH Symp.on Geometry Processing.2007.79-88.[doi:10.2312/SGP/SGP07/079-088]
    [18] Bolitho M,Kazhdan M,Burns R,Hoppe H.Multilevel streaming for out-of-core surface reconstruction.In:Belyaev A,Garland M,eds.Proc.of the 5th Eurographics Symp.on Geometry Processing (SGP 2007).Switzerland:Eurographics Association,2007.69-78.
    [19] Manson J,Petrova G,Schaefer S.Streaming surface reconstruction using wavelets.In:Proc.of the Eurographics Symp.on Geometry Processing,2008,27(5):1411-1420.[doi:10.1111/j.1467-8659.2008.01281.x]
    [20] Katz S,Tal A,Basri R.Direct visibility of point sets.ACM Trans.on Graphics (TOG),2007,26(3):Article 24.[doi:10.1145/1275808.1276407]
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

王筱婷,王璐,孟祥旭.带洞点云多层同步表面重建方法.软件学报,2016,27(10):2642-2653

复制
分享
文章指标
  • 点击次数:4135
  • 下载次数: 6953
  • HTML阅读次数: 3157
  • 引用次数: 0
历史
  • 收稿日期:2016-01-19
  • 最后修改日期:2016-03-25
  • 在线发布日期: 2016-08-11
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19808887位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号