期刊文献+

基于Voronoi最小邻近点集的Delaunay三角化方法 被引量:1

A Delaunay Triangulation Algorithm Based on Minimum Voronoi Neighbors
下载PDF
导出
摘要 针对局部条件下网格生成的需求,提出一种基于节点的Delaunay三角化生成算法,该算法以Delaunay三角形及其对偶Voronoi图的局部性特征为基础,通过在局部搜索最小Voronoi邻近点集,来生成约束点附近的局部网格,通过建立背景索引网格,来提高算法效率。给出算法的原理证明、程序实现、效率分析和测试结果,并给出了算法的应用领域。 A node-based algorithm of Delaunay triangulation is proposed, which aims at supplying local triangulation requirements. The algorithm is based on the locality of Delaunay triangulation and its dual Voronoi graph. Local Delaunay meshes are generated by searching Minimum Voronoi Neighbors for each point. The background assistant grid is proposed to improve the efficiency. The theoretical proof, programming implementation and efficiency analysis of the algorithm are given. Finally, several practical applications of the algorithm are introduced.
出处 《图学学报》 CSCD 北大核心 2013年第6期36-41,共6页 Journal of Graphics
基金 国家自然科学基金资助项目(61003110) 国家科技重大专项基金资助项目(2011ZX05008-004-10)
关键词 DELAUNAY三角化 最小Voronoi邻近点集 基于节点模式 Delaunay triangulation minimum Voronoi neighbors node-based model
  • 相关文献

参考文献10

  • 1Delaunay B N. Sur la sphere vide.Bulletin[M].Acade'mie des Sciences URSS,1934.793-800.
  • 2Hazlewood C. Approximating constrained tetrahedrizations[J].{H}Computer Aided Geometric Design,1993,(01):67-87.
  • 3Weatherill N P,Hassan O. Efficient three dimensional Delannay triangulation with automatic point creation and imposed boundary constraints[J].{H}International Journal for Numerical Methods in Engineering,1994,(02):2005-2039.
  • 4Bowyer A. Computing Dirichlet tessellations[J].{H}The Computer Journal,1981,(02):162-166.
  • 5Watson D F. Computing the Delaunay tessellation with applications to Voronoi Polytopes[J].{H}The Computer Journal,1981,(02):167-172.
  • 6Thompson J F. Handbook of grid generation[M].CRC Press LLC,1999.644-661.
  • 7闵卫东,唐泽圣.三角网格中的数量关系[J].计算机辅助设计与图形学学报,1996,8(2):81-86. 被引量:6
  • 8Toomre A. On the distribution of matter within highly flattened galaxies[J].{H}The Astrophysical Journal,1963.385-392.
  • 9孙迈.面向油藏数值模拟的PEBI网格生成技术研究[D]{H}北京:北京航空航天大学,2007.
  • 10王继春,黄刘生,徐宏力,徐犇,李善亮.基于Voronoi图的无需测距的无线传感器网络节点定位算法[J].计算机研究与发展,2008,45(1):119-125. 被引量:20

二级参考文献16

  • 1闵卫东,唐泽圣.三角形网格转化为四边形网格[J].计算机辅助设计与图形学学报,1996,8(1):1-6. 被引量:24
  • 2肖玲,李仁发,罗娟.基于非度量多维标度的无线传感器网络节点定位算法[J].计算机研究与发展,2007,44(3):399-405. 被引量:38
  • 3闵卫东,计算机学报,1995年,18卷,5期
  • 4闵卫东,Proc of 3rd CG/CAD,1993年
  • 5闵卫东,Proc of 9th CAPE,1993年
  • 6Lo S H,Computers & Structures,1989年,31卷,3期,421页
  • 7B H Wellenhoff, H Lichtenegger, J Collins. Global Position System: Theory and Practice, Four Edition [M]. New York: Springer-Verlag, 1997.
  • 8A Savvides, C C Han, M B Srivastava. Dynamic fine-grained localization in ad hoc networks of sensors [C]. In: Proc of Mobile Computing and Networks. New York: ACM Press, 2001. 166-179.
  • 9D Niculescu, B Nath. Ad Hoc position system using AoA [ C], In: Proc of the IEEE INFOCOM. San Francisco: IEEE Computer and Communication Societies Press, 2003. 1734-1743.
  • 10P Bahl, V N Padmanabhan. RADAR: An in-building RF-based user location and tracking system [C]. In: Proc of IEEE INFOCOM. Tel-Aviv, Israel: IEEE Computer and Communications Societies Press, 2000. 775-784.

共引文献24

同被引文献13

  • 1Digne J, Cohen-Steiner D, Alliez P, et al. Feature-preserving surface re- construction and simplification from defect-laden point sets[ J]. Journal of Mathematical Imaging and Vision ,2014,48 ( 2 ) :369 - 382.
  • 2Lhuillier M. 2-Manifold Tests for 3D Delaunay Triangulation-Based Surface Reconstruction [ J ]. Journal of Mathematical Imaging and Vi- sion,2014,51 ( 1 ) :98 - 105.
  • 3Gong W,Liu Y J, Tang K, et al. Approximate Delaunay mesh recon- strnction and quality estimation from point samples [ J ]. Journal of Computational and Applied Mathematics ,2015,274( 15 ) :23 - 34.
  • 4Grlvez A,IglesiasA. Particle swarm optimization for non-uniform ra- tional B-spline surface reconstruction from clouds of 3D data points [ J ]. Information Sciences,2012,192 ( 1 ) : 174 - 192.
  • 5Boissonnat J D. Geometric structures for three-dimensional shape repre- sentation[ J]. ACM Transactions on Graphics ( TOG ), 1984,3 ( 4 ) : 266 - 286.
  • 6Edelsbrunner H, Mtlcke E P. Three-dimensional alpha shapes [ J ]. ACM Transactions on Graphics ( TOG), 1994,13 ( 1 ) :43 - 72.
  • 7Coakley E S, Rokhlin V. A fast divide-and-conquer algorithm for com- puting the spectra of real symmetric tridiagonal matrices [ J ]. Applied and Computational Ham~nic Analysis,2013,34(3) :379-414.
  • 8Xu Y,Liu L,Gotsman C,et al. Capacity-constrained Delaunay triangu- lation for point distributions [ J ]. Computers & Graphics,2011,35 ( 3 ) : 510 -516.
  • 9Cart J C,Beatson R K, Cherrie J B ,et al. Reconstruction and represen- tation of 3D objects with radial basis functions [ C ]//Proceedings of the 28th annual conference on Computer graphics and interactive tech- niques ,2001:67 - 76.
  • 10方林聪,汪国昭.基于径向基函数的曲面重建算法[J].浙江大学学报(工学版),2010,44(4):728-731. 被引量:10

引证文献1

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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