Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing

DOI10.4230/lipics.esa.2021.57OpenAlexW3196348964MaRDI QIDQ6075949

Boris Klemz

Publication date: 20 September 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2021.57

zbMATH Keywords

convexityplanarityplanar graphcomputational geometrygraph drawingmorphingconvex drawinghierarchical graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Planar and toroidal morphs made easier ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ Morphing triangle contact representations of triangulations

This page was built for publication: Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing