Splitting a Polygon into Triangles and Finding Convex Hull -- from Wolfram Library Archive

Products

Consulting & Solutions

Learning & Support

Company

Wolfram|Alpha

Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how

Title

Splitting a Polygon into Triangles and Finding Convex Hull

Author

Old MathSource #

0209-854

Revision date

1998-01-01

Description

An algorithm for breaking polygons into triangles and finding convex hull of a polygon that can be used for any planar polygon in space.

Subject

Mathematics > Geometry > Computational Geometry

Keywords

Polygons, triangles, convex hull, 3D plotting

Downloads

poly.nb (16.7 KB) - Mathematica Notebook

WOLFRAM