AN ONLINE ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION

被引：46

作者：

DEFLORIANI, L ^{[1
]}

PUPPO, E ^{[1
]}

机构：

[1] CNR,IST MATEMAT APPL,I-16132 GENOA,ITALY

来源：

CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING | 1992年 / 54卷 / 04期

关键词：

D O I：

10.1016/1049-9652(92)90076-A

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A constrained Delaunay triangulation is a Delaunay triangulation of a set of points and straight-line segments. A constrained Delaunay triangulation is a basic tool for describing a topographic surface in several applications. In this paper, the definition of constrained Delaunay triangulation is introduced and its basic properties are discussed. Existing algorithms for constrained Delaunay triangulation are briefly analyzed. A new on-line algorithm for constrained Delaunay triangulation that is based on the stepwise refinement of an existing triangulation by the incremental insertion of points and constraint segments is proposed. © 1992.

引用

页码：290 / 300

页数：11

共 33 条

[1]

ASANO T, 1986, ALGORITHMICA, V1, P45

[2] ANGLE CONDITION IN FINITE-ELEMENT METHOD [J].

BABUSKA, I ;

AZIZ, AK .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1976, 13 (02) :214-226

[3]

Barnhill RE, 1977, MATH SOFTWARE, V3, P69

[4]

Bernal J., 1988, 1252 NAT I STAND TEC

[5] GEOMETRIC STRUCTURES FOR 3-DIMENSIONAL SHAPE REPRESENTATION [J].

BOISSONNAT, JD .

ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :266-286

[6] SHAPE RECONSTRUCTION FROM PLANAR CROSS-SECTIONS [J].

BOISSONNAT, JD .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 44 (01) :1-29

[7] TRIANGULAR ELEMENTS IN FINITE ELEMENT METHOD [J].

BRAMBLE, JH ;

ZLAMAL, M .

MATHEMATICS OF COMPUTATION, 1970, 24 (112) :809-+

[8]

BRUZZONE E, 1991, MAY P INT WORKSH VIS

[9]

Cavendish J. C., 1974, International Journal for Numerical Methods in Engineering, V8, P679, DOI 10.1002/nme.1620080402

[10]

CHAZELLE BM, 1983, 21ST P ALL C COMM CO, P447

← 1 2 3 4 →