Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
This Demonstration illustrates a way to divide a triangle or the convex hull of a set of points into a mesh of subtriangles, with maximum side length less than a selected value. Delaunay triangulation is applied to the convex hull before splitting the triangles. Then the subtriangles are colored by methods that involve both random numbers and the orientation of the triangles. The aim is to obtain some "instant art", which also is fun to manipulate.
Contributed by: Ingolf Dahl (April 2008)
Additional contributions by: Jens-Peer Kuska
Open content licensed under CC BY-NC-SA
The routine to divide triangles into a mesh is from the author's web page.
The Delaunay triangulation here was performed using a method suggested by Jens-Peer Kuska; see http://forums.wolfram.com/mathgroup/archive/2007/Nov/msg00400.html.
Wolfram Demonstrations Project
Published: April 3 2008