A process for constructing a figurative tree that fills a specified connected bitmap region is presented. The process uses a Voronoi diagram based on sampled points to create a connected graph. A spanning tree is then constructed and drawn using Bézier curves. An example of using this process to create a tree that fills a text phrase is shown for several controlling parameters.