Publication:3154375
From MaRDI portal
zbMath1057.68653MaRDI QIDQ3154375
Roberto Tamassia, Giuseppe Di Battista, Peter Eades, Ioannis. G. Tollis
Publication date: 16 December 2004
human-computer interaction; graph algorithms; computational geometry; graph drawing; information visualization
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Evolutionary graph drawing algorithms, PATHWIDTH AND LAYERED DRAWINGS OF TREES, INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS, TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY, On the complexity of orthogonal compaction, Drawing planar graphs with circular arcs, A multi-scale algorithm for drawing graphs nicely, Incremental bipartite drawing problem, The drawability problem for minimum weight triangulations, Rectangular drawings of plane graphs without designated corners, Algorithms for multi-level graph planarity testing and layout, Curve-constrained drawings of planar graphs, Grid drawings of \(k\)-colourable graphs, Drawing graphs by eigenvectors: theory and practice, The strength of weak proximity, On simultaneous planar graph embeddings, Area-efficient planar straight-line drawings of outerplanar graphs, Drawing \(c\)-planar biconnected clustered graphs, Pushing blocks is hard., Tutte's barycenter method applied to isotopies, Crossing-number critical graphs have bounded path-width, Expansion of layouts of complete binary trees into grids, The symmetry number problem for trees, A force-directed algorithm that preserves edge-crossing properties, On the one-sided crossing minimization in a bipartite graph with large degrees, Planar minimally rigid graphs and pseudo-triangulations, Schematization of networks, New bounds on the barycenter heuristic for bipartite graph drawing., Embedding problems for paths with direction constrained edges., Incremental convex planarity testing, Computers and discovery in algebraic graph theory, Sum of edge lengths of a multigraph drawn on a convex polygon, Voronoi drawings of trees, Optimal three-dimensional orthogonal graph drawing in the general position model., Approximation algorithms for aligning points, Proximity drawings in polynomial area and volume, A multi-dimensional approach to force-directed layouts of large graphs, Tree-decompositions with bags of small diameter, A new algorithm for removing node overlapping in graph visualization, Computing straight-line 3D grid drawings of graphs in linear volume, Algorithms for the multiple label placement problem, A better heuristic for area-compaction of orthogonal representations, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm, An analysis of some linear graph layout heuristics, Upward three-dimensional grid drawings of graphs, A simulated annealing algorithm for determining the thickness of a graph, Orthogonal drawings of graphs with vertex and edge labels, One-dimensional layout optimization, with applications to graph drawing by axis separation, Unnamed Item, Automatic layout of statecharts, Random Generation of Directed Acyclic Graphs, Geometric Thickness in a Grid of Linear Area
