Volume 31 Issue 12
Dec.  2005
Turn off MathJax
Article Contents
Meng Xianhai, Li Jigang, Yang Qinet al. Conforming Delaunay triangulation optimized by weighted method[J]. Journal of Beijing University of Aeronautics and Astronautics, 2005, 31(12): 1284-1288. (in Chinese)
Citation: Meng Xianhai, Li Jigang, Yang Qinet al. Conforming Delaunay triangulation optimized by weighted method[J]. Journal of Beijing University of Aeronautics and Astronautics, 2005, 31(12): 1284-1288. (in Chinese)

Conforming Delaunay triangulation optimized by weighted method

  • Received Date: 09 Sep 2004
  • Publish Date: 31 Dec 2005
  • As a conforming Delaunay triangulation (CDT) algorithm, Delaunay refinement method has widely application both in theory and practice. It always fails to terminate when there are some small angles intersected by input geometry constraints, so a sufficient condition for termination of Delaunay refinement method was introduced and a new conforming Delaunay triangulation algorithm was presented, which is based on Delaunay refinement method and optimized by weighted method. The algorithm imposes no angle restrictions on the input geometry domains by setting weight value to point where input constraints intersected with small angles and applying the rule of weighted Delaunay circumcircle/circumsphere claim to generate Delaunay triangular mesh, and it avoids appending any additional complex region and need not adding any Steiner points to mesh. Analysis of termination and some results applied by this algorithm were also presented. This method will be useful in the computation and analysis of complicated geometry objects.

     

  • loading
  • [1] Ruppert J. A Delaunay refinement algorithm for quality 2-dimensional mesh generation[J]. Journal of Algorithms, 1995, 18(3):548~585 [2] Shewchuk J R. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the 14th ACM Symposium on Computational Geometry. New York:ACM, 1998.86~95 [3] Shewchuk J R. Delaunay refinement algorithms for triangular mesh generation[J]. Computational Geometry, 2002, 22(1-3):21~74 [4] Cheng S W, Dey T K. Quality meshing with weighted Delaunay refinement. Proceeding of the 13th ACM-SIAM Symposium on Discrete Algorithms. New York:ACM-SIAM Press, 2002.137~146 [5] Li X Y. Generating well-shaped d-dimensional Delaunay meshes[J]. Theoretical Computer Science, 2003, 296(1):145~165 [6] Cheng S W, Dey T K, Edelsbrunner H, et al. Silver exudation[J]. Journal of the ACM, 2000, 47(5):883~904 [7] 杨 钦. 限定Delaunay三角剖分. 北京:北京航空航天大学计算机学院,2001 Yang Qin. Constrained Delaunay triangulation. Beijing:School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics,2001(in Chinese) [8] Murphy M, Mount D M, Gable C W. A point-placement strategy for conforming Delaunay tetrahedralization. Proceeding of the 11th ACM-SIAM Symposium on Discrete Algorithms. New York:ACM, 2000.67~74 [9] Cohen-Steiner D, De Verdiere E C, Yvinec M. Conforming Delaunay triangulations in 3D. Proceeding of the 18th Annual Symposium on Computational Geometry. New York:ACM, 2002.199~208 [10] Cheng S W, Poon S H. Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. New York:ACM, 2003.295~304 [11] Edelsbrunner H. Geometry and topology for mesh generation[M]. New York:Cambridge University Press, 2001 [12] 吴壮志,怀进鹏,杨 钦. Ed带权点集的Regular三角化的构造算法[J]. 计算机学报,2002, 25(11):1243~1249 Wu Zhuangzhi, Huai Jinpeng, Yang Qin. Algorithm for constructing the regular triangulation of a set of weighted points in Ed[J]. Chinese Journal of Computers, 2002, 25(11):1243~1249(in Chinese)
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(4081) PDF downloads(1135) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return