A new linear algorithm for triangulating monotone polygons

Godfried Toussaint

Research output: Contribution to journal › Article

Abstract

Let P = (p1, p2,...,pn) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time. Unlike the previous algorithm no specialized code is needed since the new approach uses well-known existing algorithms for first decomposing P into edge-visible polygons and subsequently triangulating these.

Original languageEnglish (US)
Pages (from-to)155-158
Number of pages4
JournalPattern Recognition Letters
Volume2
Issue number3
DOIs
StatePublished - Jan 1 1984

Keywords

  • Algorithms
  • complexity
  • computational geometry
  • computer graphics
  • edge-visible polygons
  • image processing
  • monotone polygons
  • pattern recognition
  • polygon decomposition
  • simple polygons
  • triangulation
  • visibility

ASJC Scopus subject areas

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

Cite this

A new linear algorithm for triangulating monotone polygons. / Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 2, No. 3, 01.01.1984, p. 155-158.

Research output: Contribution to journal › Article

Toussaint, G 1984, 'A new linear algorithm for triangulating monotone polygons', Pattern Recognition Letters, vol. 2, no. 3, pp. 155-158. https://doi.org/10.1016/0167-8655(84)90039-4
Toussaint G. A new linear algorithm for triangulating monotone polygons. Pattern Recognition Letters. 1984 Jan 1;2(3):155-158. https://doi.org/10.1016/0167-8655(84)90039-4
Toussaint, Godfried. / A new linear algorithm for triangulating monotone polygons. In: Pattern Recognition Letters. 1984 ; Vol. 2, No. 3. pp. 155-158.
@article{8738375634ee4418b4d70fc15e326009,
title = "A new linear algorithm for triangulating monotone polygons",
abstract = "Let P = (p1, p2,...,pn) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time. Unlike the previous algorithm no specialized code is needed since the new approach uses well-known existing algorithms for first decomposing P into edge-visible polygons and subsequently triangulating these.",
keywords = "Algorithms, complexity, computational geometry, computer graphics, edge-visible polygons, image processing, monotone polygons, pattern recognition, polygon decomposition, simple polygons, triangulation, visibility",
author = "Godfried Toussaint",
year = "1984",
month = "1",
day = "1",
doi = "10.1016/0167-8655(84)90039-4",
language = "English (US)",
volume = "2",
pages = "155--158",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A new linear algorithm for triangulating monotone polygons

AU - Toussaint, Godfried

PY - 1984/1/1

Y1 - 1984/1/1

N2 - Let P = (p1, p2,...,pn) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time. Unlike the previous algorithm no specialized code is needed since the new approach uses well-known existing algorithms for first decomposing P into edge-visible polygons and subsequently triangulating these.

AB - Let P = (p1, p2,...,pn) be a monotone polygon whose vertices are specified in terms of cartesian coordinates in order. A new simple two-step procedure is presented for triangulating P, without the addition of new vertices, in O(n) time. Unlike the previous algorithm no specialized code is needed since the new approach uses well-known existing algorithms for first decomposing P into edge-visible polygons and subsequently triangulating these.

KW - Algorithms

KW - complexity

KW - computational geometry

KW - computer graphics

KW - edge-visible polygons

KW - image processing

KW - monotone polygons

KW - pattern recognition

KW - polygon decomposition

KW - simple polygons

KW - triangulation

KW - visibility

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

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

U2 - 10.1016/0167-8655(84)90039-4

DO - 10.1016/0167-8655(84)90039-4

M3 - Article

AN - SCOPUS:0021363943

VL - 2

SP - 155

EP - 158

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 3

ER -

Access to Document