全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

一种基于投影的散乱数据表面增量重建算法

DOI: 10.11834/jig.2006010235

Keywords: 散乱数据场,表面重建,曲面局平特性,三角网格,可见性准则

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对3维散乱数据场提出了一种表面重建算法.根据空间曲面的局平特性和平面三角化的基本原则,在参考点的切平面上对邻域点按角度排序,应用可见性准则删除不可见点后,相邻邻域点和参考点形成三角网格.将平面上的网格关系对应到空间,以增量方式重建反映散乱数据场拓扑关系的空间曲面.设定角度阈值优化网格,判断空间曲面的边界和孔洞.对多个数据场进行重建并对结果进行分析.对多个数据场进行重建并对结果进行分析表明,算法具有原理简单,重建速度快,重建效果好的特点.

References

[1]  Amenta N,Bern M,Kamvysselis M.A new Voronoi-based surface reconstructionalgorithm[A].In:Proceedings of the 25th Annual Conference on Computer Graphics andInteractive Techniques[C],Orlando,FL,USA,1998:415 ~ 421.
[2]  Green P J,Sibson R.Computing Dirichlet tessellations in the plane[J].The ComputerJournal,1978,21(2):168 ~ 173.
[3]  Watson D F.Computing the n-dimensional Delaunay tessellation with application toVoronoi polytops[J].The Computer Journal,1981,24(2):167 ~ 172.
[4]  WANG Qing,WANG Rong-qing,BAO Hu-jun.A fast progressive surface reconstruction algorithmfor unorganized points[J].Journal of Software,2000,11(9):1221~1227.[王青,王融清,鲍虎军等.散乱数据点的增量快速曲面重建算法[J].软件学报,2000,11(9):1221~ 1227.]
[5]  TAN Jian-rong,LI Li-xin.An algorithm for topology reconstruction from unorganizedpoints based on local flatness of surface[J].Journal of Software,2002,13(11):2121~2126.[谭建荣,李立新.基于曲面局平特性的散乱数据拓扑重建算法[J].软件学报,2002,13(11):2121~ 2126.]
[6]  Gopi M,Shankar Krishnan.A fast and efficient projection-based approach for surfacereconstruction[A].In:Proceedings of the XV Brazilian Symposium on Computer Graphics andImage Processing[C],Washington DC,EUA,2002:179 ~ 186.
[7]  Dominique Attali.R-regular shapereconstruction from unorganized points[A].In:Proceedings of the Thirteenth AnnualSymposium on Computational Geometry[C],Nice,France,1997:248 ~ 273.
[8]  Hoope H,Derose T,Duchamp T,et al.Surface reconstruction from unorganizedpoints[A].In:Proceedings of the 19th Annual Conference on Computer Graphics andInteractive Techniques[C],Chicago,USA,1992:71 ~ 78.
[9]  Bowyer A.Computing Dirichlet tessellations[J].The Computer Journal,1981,24(2):162 ~166.
[10]  Xiong Bang-shu,He Ming-yi,Yu Hua-jing.Algorithm for finding k-nearest neighbors ofscattered points[J].Jornal of Computer-adied Design & Computer Graphics,2004,16(7):909~ 912.[熊邦书,何明一,俞华?.3维散乱数据的k个最近邻域快速搜索算法[J].计算机辅助设计与图形学学报,2004,16(7):909~ 912.]

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133