SOME METHODS OF COMPUTATIONAL GEOMETRY APPLIED TO COMPUTER-GRAPHICS

被引：15

作者：

EDELSBRUNNER, H ^{[1
]}

OVERMARS, MH ^{[1
]}

SEIDEL, R ^{[1
]}

机构：

[1] STATE UNIV UTRECHT,DEPT COMP SCI,3508 TB UTRECHT,NETHERLANDS

来源：

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1984年 / 28卷 / 01期

关键词：

D O I：

10.1016/0734-189X(84)90142-7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：92 / 108

页数：17

共 28 条

[11]

EDELSBRUNNER H, 1981, B EATCS, V15, P34

[12]

GOWDA IG, 1980, 18TH P ANN ALL C COM, P1

[13]

Hadwiger H., 1955, J REINE ANGEW MATH, V194, P101

[14] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J].

KIRKPATRICK, D .

[15]

Knuth D.E., 1973, SORTING SEARCHING AR, V3

[16]

Lee D. T., 1977, SIAM Journal on Computing, V6, P594, DOI 10.1137/0206043

[17]

Lipton R. J., 1977, 18th Annual Symposium on Foundations of Computer Science, P162, DOI 10.1109/SFCS.1977.6

[18]

Newman W. M., 1979, PRINCIPLES INTERACTI

[19] PLANE-SWEEP ALGORITHMS FOR INTERSECTING GEOMETRIC-FIGURES [J].

NIEVERGELT, J ;

PREPARATA, FP .

[20] DYNAMIZATION OF ORDER DECOMPOSABLE SET PROBLEMS [J].

OVERMARS, MH .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1981, 2 (03) :245-260