A counter-example to a convex hull algorithm for polygons

Godfried Toussaint

doi:10.1016/0031-3203(91)90087-L

A counter-example to a convex hull algorithm for polygons

Godfried Toussaint

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	183-184
Number of pages	2
Journal	Pattern Recognition
Volume	24
Issue number	2
DOIs	https://doi.org/10.1016/0031-3203(91)90087-L
State	Published - 1991

Keywords

Computational geometry
Convex hull
Geometric complexity
Simple polygon

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0031-3203(91)90087-L

Cite this

@article{86d183cc215c44f3a2b38b0bcc9cbe3b,

title = "A counter-example to a convex hull algorithm for polygons",

abstract = "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.",

keywords = "Computational geometry, Convex hull, Geometric complexity, Simple polygon",

author = "Godfried Toussaint",

year = "1991",

doi = "10.1016/0031-3203(91)90087-L",

language = "English (US)",

volume = "24",

pages = "183--184",

journal = "Pattern Recognition",

issn = "0031-3203",

publisher = "Elsevier Limited",

number = "2",

}

TY - JOUR

T1 - A counter-example to a convex hull algorithm for polygons

AU - Toussaint, Godfried

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

KW - Computational geometry

KW - Convex hull

KW - Geometric complexity

KW - Simple polygon

UR - http://www.scopus.com/inward/record.url?scp=0025919797&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025919797&partnerID=8YFLogxK

U2 - 10.1016/0031-3203(91)90087-L

DO - 10.1016/0031-3203(91)90087-L

M3 - Article

AN - SCOPUS:0025919797

SN - 0031-3203

VL - 24

SP - 183

EP - 184

JO - Pattern Recognition

JF - Pattern Recognition

IS - 2

ER -

A counter-example to a convex hull algorithm for polygons

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this