DELAUNAY TRIANGULATION USING A UNIFORM GRID

被引：66

作者：

FANG, TP ^{[1
]}

PIEGL, LA ^{[1
]}

机构：

[1] UNIV S FLORIDA,DEPT COMP SCI & ENGN,4202 E FOWLER AVE,ENG 118,TAMPA,FL 33620

来源：

IEEE COMPUTER GRAPHICS AND APPLICATIONS | 1993年 / 13卷 / 03期

关键词：

D O I：

10.1109/38.210490

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

[No abstract available]

引用

页码：36 / 47

页数：12

共 12 条

[1] COMPUTING DIRICHLET TESSELLATIONS [J].

BOWYER, A .

COMPUTER JOURNAL, 1981, 24 (02) :162-166

[2]

Delaunay B, 1932, Z KRISTALLOGR, V84, P109

[3]

Edelsbrunner H, 1987, ALGORITHMS COMBINATO

[4]

Forrest A. R., 1987, Techniques for Computer Graphics, P23

[5] COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].

GREEN, PJ ;

SIBSON, R .

COMPUTER JOURNAL, 1978, 21 (02) :168-173

[6] PRIMITIVES FOR THE MANIPULATION OF GENERAL SUBDIVISIONS AND THE COMPUTATION OF VORONOI DIAGRAMS [J].

GUIBAS, L ;

STOLFI, J .

ACM TRANSACTIONS ON GRAPHICS, 1985, 4 (02) :74-123

[7]

GUIBAS L, 1990, 481 NEW YORK U COUR

[8] 2 ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATION [J].

LEE, DT ;

SCHACHTER, BJ .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (03) :219-242

[9]

Preparata Franco P, 2012, COMPUTATIONAL GEOMET

[10] LOCALLY EQUIANGULAR TRIANGULATIONS [J].

SIBSON, R .

COMPUTER JOURNAL, 1978, 21 (03) :243-245

← 1 2 →