2013/01/01 by Till Tantau · 1 citation
Computer Science · Mathematics · #Teaching and Learning Programming #Graph Theory and Algorithms #Computational Geometry and Mesh Generation #Computer science #Graph #Graph drawing #Combinatorics #Mathematics #Theoretical computer science
paper · doi:10.7155/jgaa.00301
openalex publication_date 2013/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
At the heart of every good graph drawing algorithm lies an efficient procedure for assigning canvas positions to a graph’s nodes. However, any real-world implementation of such an algorithm must address numerous problems that have little to do with the actual algorithm, like handling input and output formats, formatting node labels, or styling nodes and edges. We present a new framework, written in the Lua programming language, that allows implementers to focus on core algorithmic ideas and leave all other aspects to the framework. Algorithms implemented for the framework can be used directly inside the TikZ graphics language and profit from the capabilities and quality of the TEX typesetting engine. The framework comes with implementations of standard tree drawing algorithms, a modular version of Sugiyama’s layered algorithm, and several force-based multilevel algorithms.