A COUNTEREXAMPLE TO A CONVEX-HULL ALGORITHM FOR POLYGONS

被引:2
|
作者
TOUSSAINT, G
机构
[1] School of Computer Science, McGill University, Montreal
关键词
CONVEX HULL; SIMPLE POLYGON; COMPUTATIONAL GEOMETRY; GEOMETRIC COMPLEXITY;
D O I
10.1016/0031-3203(91)90087-L
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A linear-time algorithm was recently published (Pattern Recognition 22, 561-565, 1989) for computing the convex hull of a simple polygon. In this note we present a counter-example to that algorithm.
引用
收藏
页码:183 / 184
页数:2
相关论文
共 50 条