A counter-example to a convex hull algorithm for polygons

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)183-184
Number of pages2
JournalPattern Recognition
Volume24
Issue number2
DOIs
StatePublished - Jan 1 1991

Fingerprint

Pattern recognition

Keywords

  • Computational geometry
  • Convex hull
  • Geometric complexity
  • Simple polygon

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

A counter-example to a convex hull algorithm for polygons. / Toussaint, Godfried.

In: Pattern Recognition, Vol. 24, No. 2, 01.01.1991, p. 183-184.

Research output: Contribution to journalArticle

@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",
month = "1",
day = "1",
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/1/1

Y1 - 1991/1/1

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

VL - 24

SP - 183

EP - 184

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 2

ER -