Algorithmic Figurative Tree Structures

Year: 2025 Authors: David A. Reimann

Core claim

Connected bitmap regions can be turned into tree-like artworks whose fullness and raggedness are controlled by sampling density, centroidal iteration, and curve styling.

Topics

algorithmic art, figurative trees, bitmap regions, Voronoi diagrams, Bézier curves

Domains

graph theory, computational geometry, spanning trees, Dijkstra’s algorithm, centroidal Voronoi tessellation, generative art, data visualization, topiary-inspired design

Methods

random sampling, Lloyd’s algorithm, Voronoi adjacency graph, Dijkstra spanning tree, cubic Bézier rendering

Media

bitmap, text phrase, Bézier curves, images

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.