A fast planar region triangulation algorithm fit for VRML application

被引：0
|
作者：
Sun, H.-W. [1 ]
Wang, J. [1 ]
Yang, B.-L. [1 ]
Zhang, S.-S. [1 ]
机构：
[1] National Laboratory of CAD/CAM, Northwestern Polytechnical Univ., Xi'an 710072, China
来源：
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2001年 / 13卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Transforming product data into Web-enabled format is a feasible way to realize the product information sharing in a distributed heterogeneous environment. VRML is widely used as the Web-enabled description language to present 3D views of products. The authors introduced an improved fast algorithm for transforming multiple connected planar regions into simple connected ones, tessellate it into triangular meshes and combine small triangles into large ones. This algorithm has the merits of fast speed and few triangles, thus suitable to be applied to VRML presentation.
引用
收藏
页码：324 / 327
相关论文
共 50 条
  • [31] FIT: A fast algorithm for discovering frequent itemsets in large databases
    Luo, J
    Rajasekaran, S
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2004, 3213 : 189 - 195
  • [32] An Algorithm for Fast Frequency Sweep of Planar Microwave Circuits
    Oeguecue, Goelge
    Mittra, Raj
    2008 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM, VOLS 1-9, 2008, : 2870 - +
  • [33] A Fast Convex Hull Algorithm of Planar Point Set
    Jiang, Hong-fei
    MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 1852 - 1855
  • [34] A greedy region growing algorithm for anisotropic stretch adaptive triangulation of geometry images
    Bayazit, Ulug
    GRAPHICAL MODELS, 2019, 106
  • [35] A Triangulation Algorithm Based on Edge-pointer Search and Region-division
    Zhang J.
    Tian H.-M.
    Zidonghua Xuebao/Acta Automatica Sinica, 2021, 47 (01): : 100 - 107
  • [36] Application of a genetic algorithm in triangulation of a 3-D object surface
    Zhenyu, Chen
    Mbede, J.B.
    Yan, Zhou
    Dehua, Li
    Hanping, Hu
    International Journal of Computers and Applications, 2000, 22 (02) : 73 - 77
  • [37] Delaunay triangulation algorithm research in 3-D visibility application
    Wuhan Jiaotong Keji Daxue Xuebao, 4 (353-357):
  • [38] Discussion on the time complexity of 'An algorithm for automatic Delaunay triangulation of arbitrary planar domains' - Reply - Closure
    Du, CJ
    ADVANCES IN ENGINEERING SOFTWARE, 1997, 28 (08) : 553 - 554
  • [39] Features of Constructing Planar Localization of Acoustic Emission Sources Using Inglada's Triangulation Algorithm
    Matvienko, Yu. G.
    Vasil'ev, I. E.
    Balandin, T. D.
    Chernov, D. V.
    RUSSIAN JOURNAL OF NONDESTRUCTIVE TESTING, 2024, 60 (12) : 1325 - 1334
  • [40] Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation
    Lee, Changhee
    Kim, Donguk
    Shin, Hayong
    Kim, Deok-Soo
    COMPUTER-AIDED DESIGN, 2008, 40 (08) : 852 - 862
12345