期刊文献+

基于k近邻的Surfel半径求解算法

ALGORITHM FOR GETTING SURFEL RADIUS BASED ON K-NEAREST NEIGHBOURS
下载PDF
导出
摘要 随着三维扫描技术在计算机图形学中的广泛应用,使得基于点的图形绘制技术研究越来越引起人们的广泛注意。在基于点的计算机图形绘制方法中,生成的物体表面会有一些空洞。针对以上问题提出一种基于k近邻的Surfel半径求解算法,并且在视觉上得到了较好的真实感绘制效果。 With the wide application of 3D digital scanning technology in computer graphics, research on point-based rendering technique has been attracting growing attentions. With point-based rendering the produced object will have some hollows on the surface. An algorithm for getting Surfel radius based on K-nearest neighbours is proposed in allusion to above problem, which achieves quite good realistic rendering effect in term of vision.
出处 《计算机应用与软件》 CSCD 2010年第8期266-268,共3页 Computer Applications and Software
关键词 基于点的绘制 真实感 表面空洞 K近邻 Point-based rendering Realistic Surface hole K-Nearest Neighbours
  • 相关文献

参考文献5

  • 1Alvy Ray Smith.Smooth operator[J].The Economist,1999,3:73-74.
  • 2Levoy M,Pulli K,Curless B,et al.The digital michelangelo project:3D scanning of large statues[C]//Proceedings SIGGRAPH 2000,2000:131-144.
  • 3Levoy M,Whitted T.The use of points as display primitives Technical Report TR 85-022[R].Department of Computer Science,The University of North Carolina at Chapel Hill,1985.
  • 4Pfister H,Zwicker M,Van Baar J,et al.Surfels:Surface Elements as Rendering Primitives[C]//Proceedings SIGGRAPH 2000,2000:335-342.
  • 5熊邦书,何明一,俞华璟.三维散乱数据的k个最近邻域快速搜索算法[J].计算机辅助设计与图形学学报,2004,16(7):909-912. 被引量:65

二级参考文献6

  • 1Kobbelt L P, Botsch M, Schwanecke U, et al. Feature sensitive surface extraction from volume data [A]. In:Computer Graphics Proceedings, Annual Conference Series, ACM, SIGGRAPH, Los Angeles, CA, 2001. 57~66
  • 2Goodsell. 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
  • 3Dickerson M T, Drysdale R L S, Sack J R. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors [J ]. International Journal of Computational Geometry and Applications, 1992, 2(3): 221~239
  • 4Piegl L A, Tiller W. Algorithm for finding all k nearest neighbors [J]. Computer-Aided Design, 2002, 34(2): 167~172
  • 5王青,王融清,鲍虎军,彭群生.散乱数据点的增量快速曲面重建算法[J].软件学报,2000,11(9):1221-1227. 被引量:70
  • 6周儒荣,张丽艳,苏旭,周来水.海量散乱点的曲面重建算法研究[J].软件学报,2001,12(2):249-255. 被引量:131

共引文献64

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部