Subdivides a tree ** intree** in convex polygons using the voronoi-algorithm.
Returns one patch around each node.
Patches can be coloured with

Example 1:

>> vhull_tree (sample2_tree, BO_tree (sample2_tree))

Example 2:

First get the points for the 2D boundary at 15 µm isodistance
then 2D vhull

>> c = hull_tree (sample2_tree, 15, [], [], [],'-2d');

>> [Xt Yt] = cpoints (c);

>> HP = vhull_tree (tree, [], [Xt Yt], [], [], '-2d -s');

This work is licensed under a
Creative Commons Attribution-Noncommercial-Share Alike 3.0 License