 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
The picture is crummy--there are no non-convex monotone polygons
- Why don't you draw and post a nice one? Twri (talk) 21:29, 6 May 2009 (UTC)
The wording "A simple polygon may be easily cut into monotone polygons in O(n log n) time. However since a triangle is a monotone polygon, polygon triangulation is in fact cutting a polygon into monotone ones, and it may be performed in O(n) time." seems to indicate that polygon triangulation can be performed in O(n) time, where I think it is supposed to be saying that polygon triangulation of a simple polygon can be done in O(n) Emperor Dalek (talk) 04:51, 12 July 2013 (UTC)