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 language | English (US) |
---|---|
Pages (from-to) | 155-158 |
Number of pages | 4 |
Journal | Pattern Recognition Letters |
Volume | 2 |
Issue number | 3 |
DOIs | |
State | Published - 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
}
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 -