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

Published by Omniscriptum

About this Item

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.

Seller Inventory # 9786130323066

Bibliographic Details

• Title: Polygon Triangulation : Computational Geometry, Polygon, Triangle, Planar Straight-line Graph, Convex and Concave Polygons, Linear Time, Monotone Polygon, Upper and Lower Bounds, Catalan Number
• Publisher: Omniscriptum
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 119 grams