Bend-Minimal Orthogonal Drawing of Non-Planar Graphs

This thesis belongs to the field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of non--planar graphswit givent opology. This met9 d is anextP,,9 oft he Simple--Podevsnef drawing stKBRK9 Simple--Podevsnef is a simplificatPD of t9 more complex Podevsnef -- also known as Kandinsky -- st andard. Bot models guarant ee bendminimalit y for planar graphswit givent opology. Theygenerat ortatK9 drawings wit equal vertF size where mult,PD edges can be at hed t a single side of a node. In cont9F t t Kandinsky, Simple--Podevsnef has cert, rests9BD,D on t9 split up of such bundles. The algorit9 present9 int hist hesis expandstd drawing st andard for non--planar graphs. It tKpK crossing point of edges in a special way, and enablestbl t share identen9 grid points where appropriatK Hence it allows crossings of whole bundles of edges inst9 of single edges only. Furt,PB9EKp we show a sharp upper bound of t9 bend count fort he heuristu use of Simple-Podevsnef for non--planar graphs; we also present an ext9F ion oft he new metP d tB is ablet draw non-planar clustus9,RDB . Clust ergraphs are an ext ension of graphs, wheret here exis t a hierarchical st,pKBp9 of clusters, in whicht he nodes oft he graph are organized