A New Delaunay Triangulation Algorithm Based on Constrained Maximum Circumscribed Circle

被引:0
|
作者
CAO Ming [1 ]
机构
[1] China Ship Development and Design Center
基金
中国国家自然科学基金; 中央高校基本科研业务费专项资金资助;
关键词
constrained maximum circumcircle; empty circle features; maximize minimum angle characteristics;
D O I
暂无
中图分类号
O182 [解析几何];
学科分类号
0701 ; 070101 ;
摘要
Delaunay triangulation is gradually playing an important role in the field of finite element analysis, image recognition, and medical visualization.Considering the quality and partition efficiency, a new Delaunay triangulation method based on constrained maximum circumscribed circle is proposed. First, according to two important criteria, the empty circle features and the maximized minimum angle characteristics, we established constrained conditions. Then, we iterated the container vertices, structure triangular face linked lists, and finally got the Delaunay data. The experimental results showed that the efficiency of the improved triangulation dissection method increased by 9.47% compared with traditional triangulation algorithms in irregular triangle vertex data.
引用
收藏
页码:313 / 317
页数:5
相关论文
共 50 条
  • [1] COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM
    ZHOU, JM
    SHAO, KR
    ZHOU, KD
    ZHAN, QH
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 1990, 26 (02) : 694 - 697
  • [2] A constrained Delaunay triangulation algorithm based on incremental points
    Wu, Baichao
    Tang, Aiping
    Wang, Lianfa
    [J]. ADVANCES IN CIVIL ENGINEERING, PTS 1-4, 2011, 90-93 : 3277 - 3282
  • [3] AN ONLINE ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION
    DEFLORIANI, L
    PUPPO, E
    [J]. CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1992, 54 (04): : 290 - 300
  • [4] A fast algorithm for constructing constrained Delaunay triangulation
    Nguyen Minh Nam
    Hoang Van Kiem
    Nguyen Vinh Nam
    [J]. 2009 IEEE-RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION AND VISION FOR THE FUTURE, 2009, : 11 - +
  • [5] A faster circle-sweep Delaunay triangulation algorithm
    Biniaz, Ahmad
    Dastghaibyfard, Gholamhossein
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2012, 43 (01) : 1 - 13
  • [6] A New Digital Screening Algorithm Based on Delaunay Triangulation
    Liu Chun-ying
    Dong Jin-xiang
    [J]. PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON CYBERWORLDS, 2008, : 657 - 661
  • [7] Line Recognition Algorithm Using Constrained Delaunay Triangulation
    Naouai, Mohamed
    Narjess, Melki
    Hamouda, Atef
    [J]. PROCEEDINGS ELMAR-2010, 2010, : 51 - 56
  • [8] Sweep-line algorithm for constrained Delaunay triangulation
    Domiter, V.
    Zalik, B.
    [J]. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2008, 22 (04) : 449 - 462
  • [9] Path Planning Based on Constrained Delaunay Triangulation
    Yan, Hongyang
    Wang, Huifang
    Chen, Yangzhou
    Dai, Guiping
    [J]. 2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 5168 - 5173
  • [10] AN EXTREME ALGORITHM FOR NETWORK-TOPOLOGY CONSTRUCTION BASED ON CONSTRAINED DELAUNAY TRIANGULATION
    Nguyen Minh Nam
    Le Hoai Bac
    Nguyen Vinh Nam
    [J]. INTERNATIONAL CONFERENCE ON KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2009), 2009, : 179 - +