COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM

被引：6
|
作者：
ZHOU, JM
SHAO, KR
ZHOU, KD
ZHAN, QH
机构：
[1] Dept. of Elec. Engn., Huashong Univ. of sci. &. Tech., Wuhan, Hubei
来源：
IEEE TRANSACTIONS ON MAGNETICS | 1990年 / 26卷 / 02期
关键词：
D O I：
10.1109/20.106412
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper presents a new algorithm for computing optimal constrained triangulation. It is equally applicable to compute 2D and 3D optimal constrained. triangulation and Delaunay triangulation. This algorithm has no socalled degenerate and near degenerate problems. The time needed to add. a new point to an existing mesh of any element number is the same provided that the element it belongs to has been predetermined as in the self-adaptive finite elemente analysis process. This algorithm has been applied to finite element mesh generation. Test results are given in this paper. © 1990, IEEE. All rights reserved.
引用
收藏
页码：694 / 697
页数：4
相关论文
共 50 条
  • [1] AN ONLINE ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION
    DEFLORIANI, L
    PUPPO, E
    [J]. CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1992, 54 (04): : 290 - 300
  • [2] The employment of regular triangulation for constrained Delaunay triangulation
    Maur, P
    Kolingerová, I
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, 2004, 3045 : 198 - 206
  • [3] 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 - +
  • [4] A New Delaunay Triangulation Algorithm Based on Constrained Maximum Circumscribed Circle
    CAO Ming
    [J]. Wuhan University Journal of Natural Sciences, 2015, 20 (04) : 313 - 317
  • [5] Line Recognition Algorithm Using Constrained Delaunay Triangulation
    Naouai, Mohamed
    Narjess, Melki
    Hamouda, Atef
    [J]. PROCEEDINGS ELMAR-2010, 2010, : 51 - 56
  • [6] 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
  • [7] Sweep-line algorithm for constrained Delaunay triangulation
    Domiter, V.
    Zalik, B.
    [J]. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2008, 22 (04) : 449 - 462
  • [8] Constrained Delaunay triangulation using Delaunay visibility
    Yang, Yi-Jun
    Zhang, Hui
    Yong, Jun-Hai
    Zeng, Wei
    Paul, Jean-Claude
    Sun, Jiaguang
    [J]. ADVANCES IN VISUAL COMPUTING, PT 1, 2006, 4291 : 682 - 691
  • [9] Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
    Eder, Guenther
    Held, Martin
    Palfrader, Peter
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 73 : 15 - 23
  • [10] Local adjustment algorithm for inserting constrained segments in Delaunay triangulation
    Song, Zhan-Feng
    Zhan, Zhen-Yan
    Pu, Hao
    [J]. Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2002, 37 (04):
12345