A new linear algorithm for triangulating monotone polygons

Authors:
Godfried T Toussaint
Affiliations:
School of Computer Science, McGill University, Montreal, Quebec H3A 2K6, Canada
Venue:
Pattern Recognition Letters
Year:
1984

Citing 3
Cited 2

Computational geometry.

Computational geometry.
Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

IEEE Transactions on Computers
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

IEEE Transactions on Computers

On polyhedra induced by point sets in space

Discrete Applied Mathematics
Triangulating and guarding realistic polygons

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.10

Visualization

Abstract

Let P = (p"1, p"2,...,p"n) 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.