 |
|
|
|
|
 |
 |
|
Splitting a Polygon into Triangles and Finding Convex Hull
|
|
|
|
|
|
|
|
|
|
|
|
0209-854
|
|
|
|
|
|
1998-01-01
|
|
|
|
|
|
An algorithm for breaking polygons into triangles and finding convex hull of a polygon that can be used for any planar polygon in space.
|
|
|
|
|
|
|
|
|
|
|
|
Polygons, triangles, convex hull, 3D plotting
|
|
|
 |
|
|
| poly.nb (16.7 KB) - Mathematica Notebook |
|
|
