POLYGON CONTAINMENT UNDER TRANSLATION

被引：18

作者：

BAKER, BS ^{[1
]}

FORTUNE, SJ ^{[1
]}

MAHANEY, SR ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1016/0196-6774(86)90017-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：532 / 548

页数：17

共 10 条

[1]

Aho AV., 1975, DESIGN ANAL COMPUTER

[2]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[3]

Chazelle B., 1982, 23rd Annual Symposium on Foundations of Computer Science, P339, DOI 10.1109/SFCS.1982.58

[4]

CHAZELLE B, ADV COMPUTING RES, V1, P1

[5] FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].

GRAHAM, RL ;

YAO, FF .

[6]

Liu C. L., 1968, INTRO COMBINATORIAL

LOZANOPEREZ, T ;

WESLEY, MA .

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

NIEVERGELT, J ;

PREPARATA, FP .

[9]

SCHAFFER AA, 1984, UNPUB CONVEX HULLS P

[10]

SHAMOS MI, 1975, 7TH P ANN ACM S THEO, P224