Search results
Results From The WOW.Com Content Network
A monotone polygon can be split into two monotone chains. A polygon that is monotone with respect to the y-axis is called y-monotone. A monotone polygon with n vertices can be triangulated in O(n) time. Assuming a given polygon is y-monotone, the greedy algorithm begins by walking on one chain of the polygon from top to bottom while adding ...
Breaking a polygon into monotone polygons. 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 for simple polygons in O(n) time with a complex algorithm. [6]
Since every tree with more than one vertex has at least two leaves, every triangulated polygon with more than one triangle has at least two ears. Thus, the two ears theorem is equivalent to the fact that every simple polygon has a triangulation. [2] Triangulation algorithms based on this principle have been called ear-clipping algorithms ...
A monotone planar subdivision with some monotone chains highlighted. A (vertical) monotone chain is a path such that the y-coordinate never increases along the path. A simple polygon is (vertical) monotone if it is formed by two monotone chains, with the first and last vertices in common. It is possible to add some edges to a planar subdivision ...
It has 10 chapters, whose topics include the original art gallery theorem and Fisk's triangulation-based proof; rectilinear polygons; guards that can patrol a line segment rather than a single point; special classes of polygons including star-shaped polygons, spiral polygons, and monotone polygons; non-simple polygons; prison yard problems, in ...
And Delaunay triangulation is clearly applicable and relevant to polygon triangulation. Please don't remove that note. 95.25.208.67 18:54, 19 February 2012 (UTC) Delaunay triangulation is a completely different problem from polygon triangulation; it is a form of point set triangulation.
Polygon triangulations may be found in linear time and form the basis of several important geometric algorithms, including a simple approximate solution to the art gallery problem. The constrained Delaunay triangulation is an adaptation of the Delaunay triangulation from point sets to polygons or, more generally, to planar straight-line graphs.
Triangulation today is used for many purposes, including surveying, navigation, metrology, astrometry, binocular vision, model rocketry and, in the military, the gun direction, the trajectory and distribution of fire power of weapons. The use of triangles to estimate distances dates to antiquity.