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

共 16 条

[1]

Delaunay B., 1934, B ACAD SCI USSR, V6, P793

[2] Efficient and good Delaunay meshes from random points [J].