The Graham scan triangulates simple polygons

Xianshu Kong, Hazel Everett, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

The Graham scan is a fundamental backtracking technique in computational geometry which was originally designed to compute the convex hull of a set of point in the plane [9] and has since found application in several different contexts. In this note we show how to use the Graham scan to triangulate a simple polygon. The resulting algorithm triangulates an n-vertex polygon P in O(kn) time where k -1 is the number of concave vertices in P. Although the worst case running time of the algorithm is O(n2), it is easy to implement and is therefore of practical interest.

Original languageEnglish (US)
Pages (from-to)713-716
Number of pages4
JournalPattern Recognition Letters
Volume11
Issue number11
DOIs
StatePublished - Jan 1 1990

Fingerprint

Computational geometry

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

The Graham scan triangulates simple polygons. / Kong, Xianshu; Everett, Hazel; Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 11, No. 11, 01.01.1990, p. 713-716.

Research output: Contribution to journalArticle

Kong, Xianshu ; Everett, Hazel ; Toussaint, Godfried. / The Graham scan triangulates simple polygons. In: Pattern Recognition Letters. 1990 ; Vol. 11, No. 11. pp. 713-716.
@article{e900a1a283ed4420acbed4c4371d5e49,
title = "The Graham scan triangulates simple polygons",
abstract = "The Graham scan is a fundamental backtracking technique in computational geometry which was originally designed to compute the convex hull of a set of point in the plane [9] and has since found application in several different contexts. In this note we show how to use the Graham scan to triangulate a simple polygon. The resulting algorithm triangulates an n-vertex polygon P in O(kn) time where k -1 is the number of concave vertices in P. Although the worst case running time of the algorithm is O(n2), it is easy to implement and is therefore of practical interest.",
author = "Xianshu Kong and Hazel Everett and Godfried Toussaint",
year = "1990",
month = "1",
day = "1",
doi = "10.1016/0167-8655(90)90089-K",
language = "English (US)",
volume = "11",
pages = "713--716",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - The Graham scan triangulates simple polygons

AU - Kong, Xianshu

AU - Everett, Hazel

AU - Toussaint, Godfried

PY - 1990/1/1

Y1 - 1990/1/1

N2 - The Graham scan is a fundamental backtracking technique in computational geometry which was originally designed to compute the convex hull of a set of point in the plane [9] and has since found application in several different contexts. In this note we show how to use the Graham scan to triangulate a simple polygon. The resulting algorithm triangulates an n-vertex polygon P in O(kn) time where k -1 is the number of concave vertices in P. Although the worst case running time of the algorithm is O(n2), it is easy to implement and is therefore of practical interest.

AB - The Graham scan is a fundamental backtracking technique in computational geometry which was originally designed to compute the convex hull of a set of point in the plane [9] and has since found application in several different contexts. In this note we show how to use the Graham scan to triangulate a simple polygon. The resulting algorithm triangulates an n-vertex polygon P in O(kn) time where k -1 is the number of concave vertices in P. Although the worst case running time of the algorithm is O(n2), it is easy to implement and is therefore of practical interest.

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

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

U2 - 10.1016/0167-8655(90)90089-K

DO - 10.1016/0167-8655(90)90089-K

M3 - Article

VL - 11

SP - 713

EP - 716

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 11

ER -