Isbn: 9786130323066 (3 results)

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. Englisch.…

Taschenbuch. Condition: Neu. Polygon Triangulation | Computational Geometry, Polygon, Triangle, Planar Straight-line Graph, Convex and Concave Polygons, Linear Time, Monotone Polygon, Upper and Lower Bounds, Catalan Number | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130323066 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…