Algorithm -- Conclusion

• a simple polygon with n vertices can be triangulated in O(n log n) time with an algorithm that uses O(n) storage
• the presented polygon triangulation algorithm consists of 2 steps
• first, decompose the polygon into y-monotone pieces
• second, triangulate each y-monotone piece

back