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 条
  • [21] DeWall:: A fast divide and conquer Delaunay triangulation algorithm in Ed
    Cignoni, P
    Montani, C
    Scopigno, R
    COMPUTER-AIDED DESIGN, 1998, 30 (05) : 333 - 341
  • [22] Research on Algorithm of Target Triangles Fast Locating in Delaunay Triangulation
    Zhang Shinan
    Yan Jiachuan
    Pan Jun
    PROCEEDINGS OF 2020 IEEE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INFORMATION SYSTEMS (ICAIIS), 2020, : 802 - 805
  • [23] Application of Kalman Filtering Algorithm in Laser Triangulation Measurement
    Wen Xiao-qin
    Liang Jun-yuan
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 5523 - 5527
  • [24] Discussion on the time complexity of 'An algorithm for automatic Delaunay triangulation of arbitrary planar domains'
    Subramanian, G
    Raveendra, VVS
    ADVANCES IN ENGINEERING SOFTWARE, 1997, 28 (08) : 549 - 551
  • [25] A FAST PLANAR PARTITION ALGORITHM .2.
    MULMULEY, K
    PROCEEDINGS OF THE FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY, 1989, : 33 - 43
  • [26] A Fast Algorithm for the Product Structure of Planar Graphs
    Morin, Pat
    ALGORITHMICA, 2021, 83 (05) : 1544 - 1558
  • [27] A Fast Algorithm for the Product Structure of Planar Graphs
    Pat Morin
    Algorithmica, 2021, 83 : 1544 - 1558
  • [28] A fast beamforming algorithm for planar/volumetric arrays
    Odelowo, Babafemi O.
    2005 39th Asilomar Conference on Signals, Systems and Computers, Vols 1 and 2, 2005, : 1707 - 1710
  • [29] A FAST PLANAR PARTITION ALGORITHM .1.
    MULMULEY, K
    JOURNAL OF SYMBOLIC COMPUTATION, 1990, 10 (3-4) : 253 - 280
  • [30] A FAST PLANAR PARTITION ALGORITHM .2.
    MULMULEY, K
    JOURNAL OF THE ACM, 1991, 38 (01) : 74 - 103
12345