AN ALGORITHM OF SEMI-DELAUNAY TRIANGULATION OF POINTS CLOUD SCATTERED ON A SURFACE

被引：0
|
作者：
Kucwaj, Jan [1 ]
机构：
[1] Cracow Univ Technol, Inst Comp Sci, Dept Phys Math & Comp Sci, Ul Warszawska 24, PL-31155 Krakow, Poland
来源：
COMPUTER SCIENCE-AGH | 2014年 / 15卷 / 03期
关键词：
Delaunay triangulation; surface meshing; surface reconstruction; advancing front technique;
D O I：
10.7494/csci.2014.15.3.329
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The purpose of this paper is to generalize the Delaunay[13] triangulation onto surfaces. A formal definition and an appropriate algorithm are presented. Starting from a plane domain Delaunay triangulation definition, a theoretical approach is evolved (which is a background for further considerations). It has been proven that, in the case of a plane surface, the introduced Delaunay triangulation of surfaces is identical to classical Delaunay triangulation of the plane domain. The proposed algorithm is implemented. and numerical results are shown.
引用
收藏
页码：329 / 348
页数：20
相关论文
共 50 条
  • [11] Research on the 3D triangulation algorithm for scattered data points on multiple connected surface
    Xiao, Shuang-Jiu
    Qiu, Ze-Yang
    Zhang, Shu-Sheng
    Yang, Hai-Cheng
    Ruan Jian Xue Bao/Journal of Software, 2002, 13 (04): : 659 - 663
  • [12] Research on Scattered Points Cloud Denoising Algorithm
    Fu Yan
    Zhai Jinlei
    2015 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC), 2015, : 633 - 637
  • [13] A modified constrained Delaunay Triangulation algorithm based on extracted boundary characteristic points
    Li, Gang
    Hao, Yan-ling
    Zu, Wei
    2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS, 2007, : 873 - 878
  • [14] ParaStream: A parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures
    Wu, Huayi
    Guan, Xuefeng
    Gong, Jianya
    COMPUTERS & GEOSCIENCES, 2011, 37 (09) : 1355 - 1363
  • [15] A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
    Amenta, Nina
    Attali, Dominique
    Devillers, Olivier
    DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 48 (01) : 19 - 38
  • [16] On Topological Changes in the Delaunay Triangulation of Moving Points
    Rubin, Natan
    DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 49 (04) : 710 - 746
  • [17] COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM
    ZHOU, JM
    SHAO, KR
    ZHOU, KD
    ZHAN, QH
    IEEE TRANSACTIONS ON MAGNETICS, 1990, 26 (02) : 694 - 697
  • [18] Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
    Dominique Attali
    Jean-Daniel Boissonnat
    Discrete & Computational Geometry, 2003, 30 : 437 - 452
  • [19] On Topological Changes in the Delaunay Triangulation of Moving Points
    Natan Rubin
    Discrete & Computational Geometry, 2013, 49 : 710 - 746
  • [20] Complexity of the Delaunay triangulation of points on polyhedral surfaces
    Attali, D
    Boissonnat, JD
    DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (03) : 437 - 452
12345