Computing directional constrained Delaunay triangulations

被引：22

作者：

Vigo, M ^{[1
]}

Pla, N ^{[1
]}

机构：

[1] Univ Politecn Catalunya, Dept Llenguatges & Sistemes Informat, Edifici ETSEIB, E-08028 Barcelona, Spain

来源：

COMPUTERS & GRAPHICS-UK | 2000年 / 24卷 / 02期

关键词：

constrained Delaunay triangulations; Voronoi diagram; elliptical distances;

D O I：

10.1016/S0097-8493(99)00153-3

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in Vigo (Technical Report LSI-95-UR-R, Universitat Politecnica de Catalunya, 1995; Computer & Graphics 1997;21(2):215-23) are presented. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are given. (C) 2000 Elsevier Science Ltd. All rights reserved.

引用

页码：181 / 190

页数：10

共 9 条

[1]

CHEW LP, 1986, PCSTR86132 DARM COLL

[2]

DAZZEVEDO EF, 1989, SIAM J SCI STAT COMP, V10, P1063

[3] ADAPTIVE MESH GENERATION FOR VISCOUS FLOWS USING DELAUNAY TRIANGULATION [J].

MAVRIPLIS, DJ .

JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (02) :271-291

[4]

Nielson G. M., 1989, Mathematical Methods in Computer Aided Geometric Design, P445

[5]

Okabe A., 1992, SPATIAL TESSELLATION

[6]

POSENAU MK, 1993, P 5 CAN C COMP GEOM

[7]

VIGO M, 1995, LSI9543R U POL CAT D

[8]

VIGO M, 1997, COMPUT GRAPHICS, V21, P215

[9]

VIGO M, 1999, COMPUT AIDED GEOM D, V16, P107

← 1 →