Polygon triangulation

From Wikipedia, the free encyclopedia

In computational geometry, polygon triangulation is the decomposition of a polygon into a set of triangles.

A triangulation of a polygon P is its partition into non-overlapping triangles whose union is P. In the strictest sense, these triangles may have vertices only at the vertices of P. In a less strict sense, points can be added anywhere on or inside the polygon to serve as vertices of triangles.

Triangulations are special cases of planar straight-line graphs.

A convex polygon is trivial to triangulate in linear time, by adding edges from one vertex to all other vertices. In fact, Bernard Chazelle showed in 1991 that any simple polygon can be triangulated in linear time. The proposed algorithm is very complex though, so Chazelle and others are still looking for easier algorithms.

Contents 1 Subtracting ears method 2 Using monotone polygons 3 See also 4 References

[edit] Subtracting ears method

One way to triangulate a simple polygon is by using the assertion that any simple polygon without holes has at least two so called 'ears'. An ear is a triangle with two sides on the edge of the polygon and the other one completely inside it. The algorithm then consists of finding such an ear, removing it from the polygon (which results in a new polygon that still meets the conditions) and repeating until there is only one triangle left.

This algorithm is easy to implement, but suboptimal, and it only works on polygons without holes. An implementation that keeps separate lists of convex and reflex vertices will run in O(n²) time. This method is also known as ear clipping and sometimes ear trimming.

[edit] Using monotone polygons

A monotone polygon is one with a boundary that consists of two parts, each of which consists of points that have incrementing coordinates in one dimension. Such a polygon can easily be triangulated in linear time as described by A. Fournier and D.Y. Montuno.

To break up a simple polygon into monotone polygons, follow these steps:

For each point, check if the vertices are both on the same side of the 'sweep line', a horizontal or vertical line. If they are, check the next sweep line on the other side. Break the polygon on the line between the original point and one of the points on this one.

Note that if you are moving downwards, the points where both of the vertices are below the sweep line are 'split points'. They mark a split in the polygon. From there you have to consider both sides separately.

Using this algorithm to triangulate a simple polygon takes O(n log n) time.

[edit] See also

• Catalan number

[edit] References

• Amato, Nancy M.; Goodrich, Michael T. & Ramos, Edgar A. (2001), “A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry 26 (2): 245–265, ISSN 0179-5376, doi:10.1007/s00454-001-0027-x, <http://parasol.tamu.edu/publications/abstract.php?pub_id=185> 
• Chazelle, Bernard (1991), “Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry 6: 485–524, ISSN 0179-5376, DOI 10.1007/BF02574703 
• Fournier, A. & Montuno, D. Y. (1984), “Triangulating simple polygons and equivalent problems”, ACM Transactions on Graphics 3 (2): 153–174, ISSN 0730-0301, DOI 10.1145/357337.357341 
• Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf (2000). Computational Geometry, 2nd revised edition, Springer-Verlag. ISBN 3-540-65620-0.  Chapter 3: Polygon Triangulation: pp.45–61.