Polygon Triangulation
Versandfertig in 6-10 Tagen
19,99 €
inkl. MwSt.
PAYBACK Punkte
10 °P sammeln!
High Quality Content by WIKIPEDIA articles! 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 strict 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 ...
High Quality Content by WIKIPEDIA articles! 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 strict 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.
