Home
This project is an attempt to procedurally generate coral using various graph theoretic techniques
Currently, the program generates some points randomly in space, marks the points above and below given thresholds as air and coral respectively, randomly marks the others, then does a Delaunay triangulation to obtain edges. The edges are coloured when drawn based on whether the types of both endpoints match.
The vertices and edges are stored using the Boost Graph Library, in an adjacency list. CGAL is used to do the Delaunay triangulation. Rendering and various other generic tasks are performed using the Cinder framework.
