LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON

被引：88

作者：

MCCALLUM, D

AVIS, D

机构：

[1] School of Computer Science, McGill University, Montreal

来源：

关键词：

analysis of algorithms; Convex hull; simple polygon;

D O I：

10.1016/0020-0190(79)90069-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：201 / 206

页数：6

共 6 条

[1]

Avis, On the complexity of finding the convex hull of a set of points, Technical Report No. SOCS 79.2, (1979)

[2]

Bykat, Convex hull of a finite set of points in two dimensions, Information Processing Lett., 7, pp. 296-298, (1978)

[3]

Graham, An efficient algorithm for determining the convex hull of a planar set, Information Processing Lett., 1, pp. 132-133, (1972)

[4]

Shamos, Problems in computational geometry, (1975)

[5]

Sklansky, Measuring concavity on a rectangular mosaic, IEEE Transactions on Computers, 21, pp. 1355-1364, (1972)

[6]

Toussaint, Akl, Devroye, Efficient convex hull algorithms for points in two and more dimensions, Technical Report No. 78.5, (1978)