Algorithm for computing the union, intersection or difference of two polygons

被引：0

作者：

机构：

[1] Margalit, Avraham

[2] Knott, Gary D.

来源：

Margalit, Avraham | 1600年 / 13期

关键词：

Computer Graphics;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] Computing the optimal bridge between two convex polygons
Cai, LZ
Xu, YF
Zhu, BH
INFORMATION PROCESSING LETTERS, 1999, 69 (03) : 127 - 130
[22] On computing the optimal bridge between two convex polygons
Bhattacharya, B
Benkoczi, R
INFORMATION PROCESSING LETTERS, 2001, 79 (05) : 215 - 221
[23] Computing the optimal bridge between two convex polygons
Chinese Univ of Hong Kong, Shatin, Hong Kong
Inf Process Lett, 3 (127-130):
[24] Two efficient algorithms for determining intersection points between simple polygons
Zalik, B
COMPUTERS & GEOSCIENCES, 2000, 26 (02) : 137 - 151
[25] A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
YANG Cheng-lei
Journal of Zhejiang University Science A(Science in Engineering), 2006, (09) : 1522 - 1529
[26] New fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
Yang C.-L.
Qi M.
Meng X.-X.
Li X.-Q.
Wang J.-Y.
Journal of Zhejiang University-SCIENCE A, 2006, 7 (9): : 1522 - 1529
[27] THE INTERSECTION OF A NESTED SEQUENCE OF POLYGONS
LOSSERS, OP
VITALE, RA
AMERICAN MATHEMATICAL MONTHLY, 1984, 91 (06): : 370 - 371
[28] Intersection removal for simple polygons
Lahorani, S
Krithivasan, K
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1997, 64 (3-4) : 211 - 223
[29] ON THE INTERSECTION OF 2 PLANAR POLYGONS
ZUBIAGA, RB
COMPUTERS & GRAPHICS, 1988, 12 (3-4) : 401 - 403
[30] On Intersection Graphs of Convex Polygons
Brimkov, Valentin E.
Kafer, Sean
Szczepankiewicz, Matthew
Terhaar, Joshua
COMBINATORIAL IMAGE ANALYSIS, IWCIA 2014, 2014, 8466 : 25 - 36

← 1 2 3 4 5 →