Graph drawing

Meer over het boek

The content includes a variety of invited talks and papers that explore advanced topics in graph theory and visualization. Key discussions focus on the number of triangulations on planar point sets, integrating edge routing into layouts, and fast graph drawing techniques using sampled spectral distance embedding. The annotation highlights various methods for drawing trees, including angle and distance constraints, optimal angles, and three-dimensional representations. It also covers simultaneous graph embedding, planarity testing, and the complexities of crossing numbers in graphs with excluded minors. Several papers address the decay of crossing numbers and the significance of the "mental map" in dynamic graph layouts. Additionally, it discusses the challenges of computing geometric minimum-dilation graphs and the intersection of chordal graphs with pseudosegments. Techniques for visualizing large networks, minimizing intra-edge crossings, and optimizing metro map layouts are presented. The content also includes innovative approaches to color selection for geometric graphs, morphing planar graphs, and characterizing unlabeled level planar trees. Finally, it features advancements in circular layouts, edge clustering for large networks, and various graph drawing contests and reports.