Efficient clipping of arbitrary polygons

被引：149

作者：

Greiner, G ^{[1
]}

Hormann, K ^{[1
]}

机构：

[1] Univ Erlangen Nurnberg, D-8520 Erlangen, Germany

来源：

ACM TRANSACTIONS ON GRAPHICS | 1998年 / 17卷 / 02期

关键词：

clipping; polygon comparison;

D O I：

10.1145/274363.274364

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Clipping 2D polygons is one of the basic routines in computer graphics. In rendering complex 3D images it has to be done several thousand times. Efficient algorithms are therefore very important. We present such an efficient algorithm for clipping arbitrary ED-polygons. The algorithm can handle arbitrary closed polygons, specifically where the clip and subject polygons may self-intersect. The algorithm is simple and faster than Vatti's [1992] algorithm, which was designed for the general case as well. Simple modifications allow determination of union and set-theoretic differences of two arbitrary polygons.

引用

页码：71 / 83

页数：13

共 13 条

[1] Andreev R. D., 1989, Computer Graphics Forum, V8, P183, DOI 10.1111/j.1467-8659.1989.tb00484.x
[2] BLINN J, 1991, IEEE COMPUT GRAPH AP, V11
[3] BLINN J, 1988, IEEE COMPUT GRAPH AP, V8
[4] Foley J. D., 1990, Computer Graphics, Principles and Practice, V2nd
[5] LIANG Y, 1983, COMMUN ACM, V11, P868
[6] Interplanetary circumstances of quasi-perpendicular interplanetary shocks in 1996-2005
Richardson, I. G.
Cane, H. V.
[J]. JOURNAL OF GEOPHYSICAL RESEARCH-SPACE PHYSICS, 2010, 115
[7] Preparata F., 2012, Computational geometry: an introduction
[8] Rappoport A., 1991, Visual Computer, V7, P19, DOI 10.1007/BF01994114
[9] SECHREST S, 1981, COMPUT GRAPH, V15, P17
[10] REENTRANT POLYGON CLIPPING
SUTHERLAND, IE
HODGMAN, GW
[J]. COMMUNICATIONS OF THE ACM, 1974, 17 (01) : 32 - 42

← 1 2 →